DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2011 · 11 citations · 9 references
Natural SciencesComputer ScienceMathematicsLogicSet TheoryTheory Of ComputationCategory TheoryModel TheoryType SystemsAbstractionCompositionLambda CalculusLambda Calculus SemanticsParallel CompositionRelational Calculus
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 the original Scott D infinity model of the pure lambda-calculus. This calculus is related to Boudol's resource calculus and is derived from Ehrhard and Regnier's differential extension of Linear Logic and of the lambda-calculus. We extend it with new constructions, to be understood as implementing a very simple exception mechanism, and with a ``must'' parallel composition. These new operations allow to associate a context of this calculus with any point of the model and to prove full abstraction for the finite sub-calculus where ordinary lambda-calculus application is not allowed. The result is then extended to the full calculus by means of a Taylor Expansion formula.
9
The differential lambda-calculus
Thomas Ehrhard, Laurent Régnier · Theoretical Computer Science · 2003 · 242 citations
Intuitionistic differential nets and lambda-calculus
Paolo Tranquilli · Theoretical Computer Science · 2010 · 34 citations