Related papers: Formalisation in Constructive Type Theory of Baren…
We present a hierarchical viewpoint on the operator-algebraic formulation of quantum systems, in which $C^{*}$-algebras are responsible for the universal and intrinsic description, whereas von Neumann algebras provide the detailed account…
In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…
Induction is the process by which we obtain predictive laws or theories or models of the world. We consider the structural aspect of induction. We answer the question as to whether we can find a finite and minmalistic set of operations on…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
An abstract mathematical framework is presented in this paper as a unification of several deformed or generalized algebra proposed recently in the context of generalized statistical theories intended to treat certain complex thermodynamic…
We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…
We formulate a general principle that supplants a Boolean \sigma-algebra of intrinsic properties of a classical system by a \sigma-complex (a union of \sigma-algebras) of extrinsic properties of a quantum system that are elicited by…
We examine the connections between deterministic, complete, and general global optimisation of continuous functions and a general concept of regression from the perspective of constructive type theory via the concept of 'searchability'. We…
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…
We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory)…
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…
Fractional supersymmetric quantum mechanics of order $\lambda$ is realized in terms of the generators of a generalized deformed oscillator algebra and a Z$_{\lambda}$-grading structure is imposed on the Fock space of the latter. This…
We use tools from non-standard analysis to formulate the building blocks of quantum field theory within the framework of categorical quantum mechanics. Building upon previous work, we construct an object of *Hilb having quantum fields as…
This paper introduces Relational Type Theory (RelTT), a new approach to type theory with extensionality principles, based on a relational semantics for types. The type constructs of the theory are those of System F plus relational…
We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse lambda-calculus operators and using them can take as input the semantic representation…
The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
A connection between the theory of formal groups and arithmetic number theory is established. In particular, it is shown how to construct general Almkvist--Meurman--type congruences for the universal Bernoulli polynomials that are related…
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses lambda tree syntax to treat object language binding and encodes binding related properties…