Thunks and the λ-calculus
From MaRDI portal
Publication:4358459
DOI10.1017/S0956796897002748zbMATH Open0881.68025OpenAlexW2138037343MaRDI QIDQ4358459FDOQ4358459
Authors: John Hatcliff, Olivier Danvy 
Publication date: 16 February 1998
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796897002748
Recommendations
- The \(\lambda\)-context calculus
- The Intensional Lambda Calculus
- A calculus of lambda calculus contexts
- The lambda-context calculus (extended version)
- An intuitionistic λ-calculus with exceptions
- Programming in the λ-Calculus: From Church to Scott and Back
- The structural \(\lambda \)-calculus
- Some lambda calculus and type theory formalized
- Lambda calculus and intuitionistic linear logic
Cited In (10)
- On one-pass CPS transformations
- Title not available (Why is that?)
- The simple type theory of normalisation by evaluation
- Semantics of quantum programming languages: Classical control, quantum control
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Amb Breaks Well-Pointedness, Ground Amb Doesn't
- On the semantics of the call-by-name CPS transform
- Programming in the λ-Calculus: From Church to Scott and Back
- On the call-by-value CPS transform and its semantics
- From reduction-based to reduction-free normalization
This page was built for publication: Thunks and the λ-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358459)
