Full abstraction for lambda calculus with resources and convergence testing

DOI10.1007/3-540-61064-2_45OpenAlexW1556311577MaRDI QIDQ5878917

Gérard Boudol, Carolina Lavatelli

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_45

zbMATH Keywords

full abstractionlambda-calculusintersection type systems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

A relational semantics for parallelism and non-determinism in a functional setting ⋮ Algebraic interpretation of lambda calculus with resources

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of basic functionality theory for \(\lambda\)-calculus
• Full abstraction in the lazy lambda calculus
• Lambda-calculi for (strict) parallel functions
• A filter lambda model and the completeness of type assignment
• Functional Characters of Solvable Terms
• Explicit substitutions