Semantical analysis of perpetual strategies in \(\lambda\)-calculus

DOI10.1016/S0304-3975(98)00140-6zbMath0913.68132OpenAlexW2025717798MaRDI QIDQ1275628

Marina Lenisa, Furio Honsell

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00140-6

zbMATH Keywords

normal formssemanticslambda calculusobservational equivalencesreduction strategies

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Intersection types and lambda models, An irregular filter model, Intersection Types and Computational Rules, On the longest perpetual reductions in orthogonal expression reduction systems, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, Simple Easy Terms, Compositional characterisations of \(\lambda\)-terms using intersection types, Perpetuality and uniform normalization in orthogonal rewrite systems, Conservation and uniform normalization in lambda calculi with erasing reductions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Full abstraction in the lazy lambda calculus
• The ant-lion paradigm for strong normalization
• Proving congruence of bisimulation in functional programming languages
• Relational properties of domains
• Inductive types and type constraints in the second-order lambda calculus
• A filter lambda model and the completeness of type assignment
• Effective longest and infinite reduction paths in untyped λ-calculi