Call-by-name extensionality and confluence

DOI10.1017/S095679681700003XzbMath1418.68033MaRDI QIDQ5372008

Zena M. Ariola, Philip Johnson-Freyd, Paul Downen

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Unique normal forms for lambda calculus with surjective pairing
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Skew confluence and the lambda calculus with letrec
• A call-by-name lambda-calculus machine
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• λμ-calculus and Böhm's theorem
• The duality of computation
• Typing streams in the Λμ-calculus
• The Duality of Computation under Focus
• An approach to call-by-name delimited continuations
• Parametric polymorphism and operational equivalence
• Polarised Intermediate Representation of Lambda Calculus with Sums
• Reduction System for Extensional Lambda-mu Calculus
• The Duality of Construction

This page was built for publication: Call-by-name extensionality and confluence