Related papers: Free Theorems Simply, via Dinaturality
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
The paper starts with the proposal that the cause of the apparent insolubility of the free-will problem are several popular but strongly metaphysical notions and hypotheses. To reduce the metaphysics, some ideas are borrowed from physics. A…
We show "free theorems" in the style of Wadler for polymorphic functions in homotopy type theory as consequences of the abstraction theorem. As an application, it follows that every space defined as a higher inductive type has the same…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
If a higher derivative theory arises from a transformation of variables that involves time derivatives, a tailor-made Hamiltonian formulation is shown to exist. The details and advantages of this elegant Hamiltonian formulation, which…
Parametricity allows the transfer of proofs between different implementations of the same data structure. The lambdaPi-calculus modulo theory is an extension of the lambda-calculus with dependent types and user-defined rewrite rules. It is…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We consider the question of counting the degrees of freedom in theoretical models, with an emphasis on theories of fields and gravity. Among the possible approaches, the Hamiltonian formulation remains one of the most systematic and robust…
Reynold's parametricity theory captures the property that parametrically polymorphic functions behave uniformly: they produce related results on related instantiations. In dependently-typed programming languages, such relations and…
The argument from naturalness is widely employed in contemporary quantum field theory. Essentially a formalized aesthetic criterion, it received a meaning in the debate on the Higgs mechanism, which goes beyond aesthetics. We follow the…
Abstraction is a powerful idea widely used in science, to model, reason and explain the behavior of systems in a more tractable search space, by omitting irrelevant details. While notions of abstraction have matured for deterministic…
Probabilistic programming has emerged as a powerful paradigm in statistics, applied science, and machine learning: by decoupling modelling from inference, it promises to allow modellers to directly reason about the processes generating…
We develop a refinement of Whitehead's algorithm for primitive words in a free group. We generalize to subgroups, establishing a strengthened version of Whitehead's algorithm for free factors. We make use of these refinements in proving new…
An interpretable system for open-domain reasoning needs to express its reasoning process in a transparent form. Natural language is an attractive representation for this purpose -- it is both highly expressive and easy for humans to…
A theorem prover without an extensive library is much less useful to its potential users. Algebra, the study of algebraic structures, is a core component of such libraries. Algebraic theories also are themselves structured, the study of…