A concurrent lambda calculus with futures

DOI10.1016/J.TCS.2006.08.016zbMath1110.68023DBLPjournals/tcs/NiehrenSS06OpenAlexW1980339691WikidataQ59759156 ScholiaQ59759156MaRDI QIDQ860851

Joachim Niehren, Gert Smolka, Jan Schwinghammer

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00090434/file/0.pdf

zbMATH Keywords

semanticsconcurrencyfunctional programming languages

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (10)

Behavioral interface description of an object-oriented language with futures and promises ⋮ ASP\(_{\text{fun}}\) : a typed functional active object calculus ⋮ Classical Call-by-Need and Duality ⋮ Backwards type analysis of asynchronous method calls ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ A Mechanized Model of the Theory of Objects ⋮ Concurrent Objects à la Carte ⋮ Asynchronous sequential processes ⋮ Observational program calculi and the correctness of translations ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures

Uses Software

• JoCaml
• Oz
• Pict
• Multilisp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambda calculus with explicit recursion
• Computer science today. Recent trends and developments
• The semantics of Scheme with future
• MULTILISP: a language for concurrent symbolic computation
• The call-by-need lambda calculus
• The semantics of future and an application
• The call-by-need lambda calculus
• Uniform confluence in concurrent computation
• Concurrent Programming in ML
• Frontiers of Combining Systems
• The Mechanical Evaluation of Expressions
• Implicit typing à la ML for the join-calculus

This page was built for publication: A concurrent lambda calculus with futures