… a new lambda calculus with futures, (fut), that models the operational semantics of concurrent
… , a concurrent extension of Standard ML. (fut) is a minimalist extension of the call-by-value -…

… We introduce a new concurrent lambda calculus with futures, … based channel approaches
was solved with the join-calculus [… The join-calculus, however, does not model futures on which …

… In this thesis, we develop the theory of a concurrent computation model with futures and
promises, called λFP . Its sequential core is based on the call-by-value λ-calculus, but it also …

… λ(fut), a concurrent λ-calculus with reference cells and futures. The calculus λ(fut) models the
… In call-by-need lambda calculi this phenomenon is known as a black hole. We require that …

… concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that
concurrent buffers and handled futures … encoding of buffers in a calculus without handles, which …

… We begin with the description of the calculus λτ (fc), a typed concurrent λ-calculus with type
constructors and futures. Further we extend it with concurrent handles and concurrent buffers …

… the integration of functional and concurrent calculi: For instance we … for the study of the lazy
it-calculus in “richer” settings, the … future work, some questions which remain to be examined. …

The formal systems that are nowadays called λ-calculus and combinatory logic were both
invented in the 1920s, and their aim was to describe the most basic properties of function-…

… ) is a sleek calculus that models a minimal need of concurrency paradigms, … calculi
translations. In this thesis we extend the lambda calculus with futures by more complex concurrency …

… -calculus [13], a conservative extension of the π-calculus, that already provides better support
for modeling concurrent … We conclude with a summary of related and future work in Section …