Related papers: Generic Fibrational Induction
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
This paper studies the problem of learning computable functions in the limit by extending Gold's inductive inference framework to incorporate \textit{computational observations} and \textit{restricted input sources}. Complimentary to the…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
The tensor functor called $\alpha$-induction arises from a Frobenius algebra object, or a Q-system, in a braided unitary fusion category. In the operator algebraic language, it gives extensions of endomorphism of $N$ to $M$ arising from a…
Inferring network topology from dynamical observations is a fundamental problem pervading research on complex systems. Here, we present a simple, direct method to infer the structural connection topology of a network, given an observation…
We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…
We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…
Imputation of data with general structures (e.g., data with continuous, binary, unordered categorical, and ordinal variables) is commonly performed with fully conditional specification (FCS) instead of joint modeling. A key drawback of FCS…
In this partly expository paper we discuss conditions for the global injectivity of $C^2$ semi-algebraic local diffeomorphisms $f:\mathbb{R}^n \to \mathbb{R}^n$. In case $n > 2$, we consider the foliations of $\mathbb{R}^n$ defined by the…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of…
We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a…
On construit des foncteurs de formes differentielles generalisees. Ceux-ci, dans le cas d'espaces nilpotents de type fini, determinent le type d'homotopie faible des espaces. Ils sont munis, d'une maniere elementaire et naturelle, de…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to…
To every finite-dimensional $\mathbb C$-algebra $\Lambda$ of finite representation type we associate an affine variety. These varieties are a large generalization of the varieties defined by "$u$ variables" satisfying "$u$-equations", first…
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 paper we generalize Tannakian formalism to fiber functors over general tensor categories. We will show that (under some technical conditions) if the fiber functor has a section, then the source category is equivalent to the category…