English
Related papers

Related papers: Strict Ideal Completions of the Lambda Calculus

200 papers

Deciding termination is a fundamental problem in the analysis of probabilistic imperative programs. We consider the qualitative and quantitative probabilistic termination problems for an imperative programming model with discrete…

Logic in Computer Science · Computer Science 2024-07-25 Rupak Majumdar , V. R. Sathiyanarayana

We study the interpretation of the lambda-calculus in a framework based on tropical mathematics, and we show that it provides a unifying framework for two well-developed quantitative approaches to program semantics: on the one hand program…

Logic in Computer Science · Computer Science 2023-11-28 Davide Barbarossa , Paolo Pistone

We present a novel unity of logic, viz., a single sequent calculus that embodies classical, intuitionistic and linear logics. Concretely, we define classical linear logic negative (CLL$^-$), a new logic that is classical and linear yet…

Logic · Mathematics 2021-01-08 Norihiro Yamada

Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the…

Programming Languages · Computer Science 2010-12-23 Conrad Rau , Manfred Schmidt-Schauß

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

We introduce the \emph{resource control cube}, a system consisting of eight intuitionistic lambda calculi with either implicit or explicit control of resources and with either natural deduction or sequent calculus. The four calculi of the…

Logic · Mathematics 2013-05-20 Silvia Ghilezan , Jelena Ivetic , Pierre Lescanne , Silvia Likavec

For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…

Programming Languages · Computer Science 2020-07-28 Pierre-Évariste Dagand , Lionel Rieg , Gabriel Scherer

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…

Logic in Computer Science · Computer Science 2019-03-14 Ranald Clouston , Aleš Bizjak , Hans Bugge Grathwohl , Lars Birkedal

Quantitative algebras are algebras enriched in the category $\mathsf{Met}$ of metric spaces so that all operations are nonexpanding. Mardare, Plotkin and Panangaden introduced varieties (aka $1$-basic varieties) as classes of quantitative…

Category Theory · Mathematics 2023-01-04 Jiří Adámek , Matěj Dostál , Jiří Velebil

We show that the normal form of the Taylor expansion of a $\lambda$-term is isomorphic to its B\"ohm tree, improving Ehrhard and Regnier's original proof along three independent directions. First, we simplify the final step of the proof by…

Logic in Computer Science · Computer Science 2023-06-22 Federico Olimpieri , Lionel Vaux Auclair

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

Combinatorics · Mathematics 2022-06-14 Valerii Sopin

The paper presents fundamental metrical theorems for a class of continued fraction-like expansions known as $\theta$-expansions. We first prove Khinchine's Weak Law of Large Numbers for the sum of digits, followed by the Diamond-Vaaler…

Number Theory · Mathematics 2026-01-21 Andreas Rusu , Gabriela Ileana Sebe , Dan Lascu

We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…

Logic · Mathematics 2018-02-06 Dániel T. Soukup , Lajos Soukup

We establish the existence of infinitely many complete metrics with constant scalar curvature on prescribed conformal classes on certain noncompact product manifolds. These include products of closed manifolds with constant positive scalar…

Differential Geometry · Mathematics 2019-02-21 Renato G. Bettiol , Paolo Piccione

It is not hard to prove that a uniformly continuous real function, whose integral up to infinity exists, vanishes at infinity, and it is probably little known that this statement runs under the name "Barbalat's Lemma." In fact, the latter…

Optimization and Control · Mathematics 2016-12-19 Bálint Farkas , Sven-Ake Wegner

In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…

Logic in Computer Science · Computer Science 2014-09-29 Benoît Valiron , Steve Zdancewic

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

Logic · Mathematics 2021-01-20 Christian Herrmann

In this work we study the mathematical aspects of the development in the continuum thermodynamics known as the "Entropy Principle". It started with the pioneering works of B.Coleman, W.Noll and I. Muller in 60th of XX cent. and got its…

Mathematical Physics · Physics 2010-08-03 Serge Preston

Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…

Logic · Mathematics 2017-05-23 Stepan Kuznetsov

Directly infinite algebras, those algebras, $E$ which have a pair of elements $x$ and $y$ where $1 = xy \neq yx$, are well known to have a sub-algebra isomorphic to $M_\infty(K)$, the set of infinite $\zplus \times \zplus$-indexed matrices…

Rings and Algebras · Mathematics 2021-12-16 Daniel P. Bossaller
‹ Prev 1 8 9 10 Next ›