A concurrent lambda calculus with futures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1231477 (Why is no real title available?)
- scientific article; zbMATH DE number 1531624 (Why is no real title available?)
- scientific article; zbMATH DE number 2161893 (Why is no real title available?)
- Computer science today. Recent trends and developments
- Concurrent Programming in ML
- Frontiers of Combining Systems
- Implicit typing à la ML for the join-calculus
- Lambda calculus with explicit recursion
- MULTILISP: a language for concurrent symbolic computation
- The Mechanical Evaluation of Expressions
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- The semantics of Scheme with future
- The semantics of future and an application
- Uniform confluence in concurrent computation
Cited in
(16)- Behavioral interface description of an object-oriented language with futures and promises
- Backwards type analysis of asynchronous method calls
- Uniform confluence in concurrent computation
- ASP\(_{\text{fun}}\) : a typed functional active object calculus
- A Mechanized Model of the Theory of Objects
- Minimal translations from synchronous communication to synchronizing locks
- Back to futures
- Concurrent objects à la carte
- Observational semantics for a concurrent lambda calculus with reference cells and futures
- A calculus of coroutines
- Observational program calculi and the correctness of translations
- Classical call-by-need and duality
- Conservative concurrency in Haskell
- Frontiers of Combining Systems
- On generic context lemmas for higher-order calculi with sharing
- Asynchronous sequential processes
This page was built for publication: A concurrent lambda calculus with futures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860851)