English
Related papers

Related papers: Models and theories of lambda calculus

200 papers

This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this…

Logic in Computer Science · Computer Science 2007-05-23 Andrew Gacek , Gopalan Nadathur

This note is a survey on the basic aspects of moduli theory along with some examples. In that respect, one of the purposes of this current document is to understand how the introduction of stacks circumvents the non-representability problem…

Algebraic Geometry · Mathematics 2022-02-15 Kadri İlker Berktav

Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…

Logic in Computer Science · Computer Science 2019-07-16 Beniamino Accattoli , Andrea Condoluci , Giulio Guerrieri , Claudio Sacerdoti Coen

We propose a way to unify two approaches of non-cloning in quantum lambda-calculi: logical and algebraic linearities. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as…

Logic in Computer Science · Computer Science 2019-12-06 Alejandro Díaz-Caro , Gilles Dowek , Juan Pablo Rinaldi

Delimited control operator shift0 exhibits versatile capabilities: it can express layered monadic effects, or equivalently, algebraic effects. Little did we know it can express lambda calculus too! We present $ \Lambda_\$ $, a call-by-value…

Programming Languages · Computer Science 2023-06-22 Mateusz Pyzik

$\tau$-tilting theory can be thought of as a generalization of the classical tilting theory which allows mutations at any indecomposable summand of a support $\tau$-tilting pair. Indeed, for any algebra $\Lambda$ its tilting modules…

Representation Theory · Mathematics 2025-12-17 Jonah Berggren , Khrystyna Serhiyenko

We generalize to the relations $(\lambda, \mu) \stackrel{\kappa}{\Rightarrow} (\lambda', \mu')$ and $\alm (\lambda, \mu) \stackrel{\kappa}{\Rightarrow} \alm (\lambda', \mu')$ some results obtained in Parts II and IV. We also present a…

Logic · Mathematics 2009-03-30 Paolo Lipparini

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…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

Group Theory · Mathematics 2015-10-20 Attila Nagy

Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in…

Logic in Computer Science · Computer Science 2012-11-07 Herman Geuvers , Robbert Krebbers , James McKinna

Various topological concepts are often involved in the research of mathematical logic, and almost all of these concepts can be regarded as developing from the Stone representation theorem. In the Stone representation theorem, a Boolean…

Logic · Mathematics 2022-10-18 Yunfei Qin

Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…

Logic in Computer Science · Computer Science 2021-02-01 Tatsuya Abe , Daisuke Kimura

We give a broad study of representation and module theory of Rota-Baxter algebras. Regular-singular decompositions of Rota-Baxter algebras and Rota-Baxter modules are obtained under the condition of quasi-idempotency. Representations of an…

Representation Theory · Mathematics 2019-12-09 Li Guo , Zongzhu Lin

An enumerative invariant theory in Algebraic Geometry, Differential Geometry, or Representation Theory, is the study of invariants which 'count' $\tau$-(semi)stable objects $E$ with fixed topological invariants $[E]=\alpha$ in some…

Algebraic Geometry · Mathematics 2022-09-26 Jacob Gross , Dominic Joyce , Yuuji Tanaka

In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…

Logic · Mathematics 2023-06-22 Karim Nour , Mohamad Ziadeh

The notion of lambda-symmetries, originally introduced by C. Muriel and J.L. Romero, is extended to the case of systems of first-order ODE's (and of dynamical systems in particular). It is shown that the existence of a symmetry of this type…

Exactly Solvable and Integrable Systems · Physics 2009-11-13 G. Cicogna

We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to model side-effects and treat read and write as algebraic…

Logic in Computer Science · Computer Science 2025-09-03 Ugo de'Liguoro , Riccardo Treglia

We prove a global well-posedness and asymptotic convergence theorem for the \((3+1)\)-dimensional vacuum Einstein equations with positive cosmological constant \(\Lambda\) on globally hyperbolic spacetimes \(\widetilde M \cong M \times…

General Relativity and Quantum Cosmology · Physics 2026-04-07 Puskar Mondal

We give a generalization of the theory of $\mathbb{Z}_2$-graded manifolds to a theory of $\mathcal{I}$-graded manifolds, where $\mathcal{I}$ is a commutative semi-ring with some additional properties. We prove Batchelor's theorem in this…

Differential Geometry · Mathematics 2022-11-09 Shuhan Jiang

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…

Computer Science and Game Theory · Computer Science 2017-01-11 Ulrich Berger