A non-deterministic call-by-need lambda calculus
From MaRDI portal
Publication:5348907
DOI10.1145/289423.289462zbMath1369.68106OpenAlexW2166853829MaRDI QIDQ5348907
Arne Kutzner, Manfred Schmidt-Schauss
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
Related Items (7)
A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi ⋮ Closures of may-, should- and must-convergences for contextual equivalence ⋮ A Fresh Look at the λ-Calculus ⋮ Observational program calculi and the correctness of translations ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
This page was built for publication: A non-deterministic call-by-need lambda calculus
