A non-deterministic call-by-need lambda calculus

DOI10.1145/289423.289462MaRDI QIDQ5348907zbMATH OpenOpenAlexFDO

Authors Arne Kutzner, Manfred Schmidt-Schauß

Publication date 21 August 2017

Published in Proceedings of the third ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL http://publikationen.ub.uni-frankfurt.de/files/3471/p324-kutzner.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• A non-deterministic call-by-need lambda calculus
• The call-by-need lambda calculus
• Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
• The call-by-need lambda calculus
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

Cited in

(13)

• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
• A non-deterministic call-by-need lambda calculus
• A lambda-calculus for dynamic binding
• Linearity in the non-deterministic call-by-value setting
• Closures of may-, should- and must-convergences for contextual equivalence
• Observational program calculi and the correctness of translations
• A Fresh Look at the λ-Calculus
• The Call-by-Need Lambda Calculus, Revisited
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Observational semantics for a concurrent lambda calculus with reference cells and futures
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• On generic context lemmas for higher-order calculi with sharing

This page was built for publication: A non-deterministic call-by-need lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348907)