Results 11 to 20 of about 230,472 (297)
The Safe Lambda Calculus [PDF]
Logical Methods in Computer Science, 2009 Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and
William Blum, C. -H. Luke Ong
doaj +6 more sources
The dagger lambda calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols into the rich and well established tradition of type theory.
Philip Atzemoglou
doaj +4 more sources
Lambda-Calculus, Multiplicities and the pi-Calculus [PDF]
, 1995 In this paper we study the semantics of the $\lambda$-calculus induced by Milner's encoding into the $\pi$-calculus. We show that the resulting may testing preorder on $\lambda$-terms coincides with the inclusion of Lévy-Longo trees.
Boudol, Gérard, Laneve, Cosimo
core +8 more sources
The permutative lambda calculus [PDF]
, 2012 International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus with three equations and one reduction rule for permuting constructors, generalising many calculi in the literature, in particular Regnier's sigma ...
Accattoli, Beniamino, Kesner, Delia
core +4 more sources
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus [PDF]
Logical Methods in Computer Science, 2017 We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant ...
Giulio Guerrieri +2 more
doaj +2 more sources
Lambda Calculus in Core Aldwych [PDF]
, 2016 Core Aldwych is a simple model for concurrent computation, involving the concept of agents which communicate through shared variables. Each variable will have exactly one agent that can write to it, and its value can never be changed once written, but a ...
Communicating Process Architectures +1 more
core +4 more sources
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion [PDF]
Logical Methods in Computer Science, 2012 We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus.
Thomas Ehrhard +3 more
doaj +1 more source
Trees from Functions as Processes [PDF]
Logical Methods in Computer Science, 2018 Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees.
Davide Sangiorgi, Xian Xu
doaj +1 more source
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi [PDF]
Logical Methods in Computer Science, 2009 The intuitionistic fragment of the call-by-name version of Curien and Herbelin's \lambda\_mu\_{\~mu}-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed lambda-calculus.
Jose Espirito Santo +2 more
doaj +1 more source
Confluence via strong normalisation in an algebraic λ-calculus with rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms.
Pablo Buiras +2 more
doaj +1 more source