Related papers: General Recursion and Formal Topology
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…
Representation theorems for formal systems often take the form of an inductive translation that satisfies certain invariants, which are proved inductively. Theory morphisms and logical relations are common patterns of such inductive…
Humans can generate reasonable answers to novel queries (Schulz, 2012): if I asked you what kind of food you want to eat for lunch, you would respond with a food, not a time. The thought that one would respond "After 4pm" to "What would you…
Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also…
In this paper a mathematically precise global (i.e. not the usual local) approach is presented to the variational principles of general relativistic classical field theories. Problems of the classic (usual) approaches are also discussed in…
This paper describes a new technique, called "knowledge patterns", for helping construct axiom-rich, formal ontologies, based on identifying and explicitly representing recurring patterns of knowledge (theory schemata) in the ontology, and…
There are many scientific problems generated by the multiple and conflicting alternative definitions of linguistic recursion and human recursive processing that exist in the literature. The purpose of this article is to make available to…
Random tensor models are generalizations of random matrix models which admit $1/N$ expansions. In this article we show that the topological recursion, a modern approach to matrix models which solves the loop equations at all orders, is also…
We formulate a general approach to higher concurrencies in general and neural codes in particular, and suggest how the higher order aspects may be dealt with in using topology.
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…
We prove that every degree-g polynomial in the $\psi$-classes on $\overline{\mathcal M}_{g, n}$ can be expressed as a sum of tautological classes supported on the boundary with no $\kappa$-classes. Such equations, which we refer to as…
For a given spectral curve, we construct a family of symplectic dual spectral curves for which we prove an explicit formula expressing the $n$-point functions produced by the topological recursion on these curves via the $n$-point functions…
We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. Our approach enjoys the fact that our elimination rule is…
In this work, we study vector-valued functional equations with multiple recursive terms that arise naturally when we are dealing with vector-valued multiplicative Lindley-type recursions. We provide a detailed framework for the solution of…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
Whether language models (LMs) have inductive biases that favor typologically frequent grammatical properties over rare, implausible ones has been investigated, typically using artificial languages (ALs) (White and Cotterell, 2021;…
Large language models have the potential to simplify formal theorem proving and make it more accessible. But how to get the most out of these models is still an open question. To answer this question, we take a step back and explore the…
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our…
We present a fully abstract model of a call-by-value language with higher-order functions, recursion and natural numbers, as an exponential ideal in a topos. Our model is inspired by the fully abstract models of O'Hearn, Riecke and…