Related papers: A computer verified, monadic, functional implement…
Shape analysis and compuational anatomy both make use of sophisticated tools from infinite-dimensional differential manifolds and Riemannian geometry on spaces of functions. While comprehensive references for the mathematical foundations…
By the Riesz representation theorem using the Riemann-Stieltjes integral, linear continuous functionals on the set of continuous functions from the unit interval into the reals can either be characterized by functions of bounded variation…
The R-matrix formalism for the construction of integrable systems with infinitely many degrees of freedom is reviewed. Its application to Poisson, noncommutative and loop algebras as well as central extension procedure are presented. The…
This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…
We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic…
We present a new approach to the study of multiplier ideals in a local, two-dimensional setting. Our method allows us to deal with ideals, graded systems of ideals and plurisubharmonic functions in a unified way. Among the applications are…
We introduce Clerical, a programming language for exact real-number computation that combines first-order imperative-style programming with a limit operator for computation of real numbers as limits of Cauchy sequences. We address the…
The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
We introduce a symbolic method for the evaluation of definite integrals containing combinations of various functions, including exponentials, logarithm and products of Bessel functions of different types. The method we develop is naturally…
In this paper, we utilize operational methods to obtain closed-form solutions for certain classes of integrals in the spirit of Ramanujan's Master Theorem and provide several analogs to it. Although the use of operational calculus makes the…
An operatorial method, already employed to formulate a generalization of the Ramanujan master theorem, is applied to the evaluation of integrals of various type. This technique provide a very flexible and powerful tool yielding new results…
We approach the Riemann integral via generalized primitives to give a new proof for a general result on change of variable originally proven by Kestelman and Davies. Our proof is similar to Kestelman's, but we hope readers will find it…
To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary…
We present a simplified integral of functions of several variables. Although less general than the Riemann integral, most functions of practical interest are still integrable. On the other hand, the basic integral theorems can be obtained…
A purely numerical method, Direct ComputationMethod is applied to evaluate Feynman integrals. This method is based on the combination of an efficient numerical integration and an efficient extrapolation. In addition, high-precision…
We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational…
We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal…
We give an algebraic characterization of the syntax and semantics of a class of languages with variable binding. We introduce a notion of 2-signature: such a signature specifies not only the terms of a language, but also reduction rules on…
We introduce a family of variational functionals for spinor fields on a compact Riemann surface $M$ that can be used to find close-to-conformal immersions of $M$ into $\mathbb{R}^3$ in a prescribed regular homotopy class. Numerical…