Related papers: Frege's theory of types
In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…
First class type equalities, in the form of generalized algebraic data types (GADTs), are commonly found in functional programs. However, first-class representations of other relations between types, such as subtyping, are not yet directly…
We provide a self-contained introduction to the classical theory of universal-homogeneous models (also known as generic structures, rich models, or Fra\"iss\'e limits). In the literature, most treatments restrict consideration to embeddings…
Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
This lecture reviews the classification of simple modules of double affine Hecke algebras via the K-theory of Steinberg varieties of affine type
We present a gradually typed language, GrEff, with effects and handlers that supports migration from unchecked to checked effect typing. This serves as a simple model of the integration of an effect typing discipline with an existing…
Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.
A normalized analytic function f is shown to be univalent in the open unit disk D if its second coefficient is sufficiently small and relates to its Schwarzian derivative through a certain inequality. New criteria for analytic functions to…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
A few observations concerning topological string theories at the string-tree level are presented: (1) The tree-level, large phase space solution of an arbitrary model is expressed in terms of a variational problem, with an ``action'' equal,…
We show a possibility to apply certain philosophical concepts to the analysis of concrete mathematical structures. Such application gives a clear justification of topological and geometric properties of considered mathematical objects.
We present generalized algebraic theories corresponding to slightly modified versions of two of the type theories in our paper Type Theory with Explicit Universe Polymorphism. We first present a generalized algebraic theory for categories…
We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…
We consider the Frobenius algebra of functions on the critical set of the master function of a weighted arrangement of hyperplanes in $\C^k$ with normal crossings. We construct two potential functions (of first and second kind) of variables…
This treatise investigates holomorphic functions defined on the space of bicomplex numbers introduced by Segre. The theory of these functions is associated with Fueter's theory of regular, quaternionic functions. The algebras of quaternions…
We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n),…
Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in…
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main…