Please use this identifier to cite or link to this item: doi:10.22028/D291-25773
Title: A concurrent lambda-calculus with promises and futures
Author(s): Schwinghammer, Jan
Language: English
Year of Publication: 2002
SWD key words: Lambda-Kalkül
DDC notations: 004 Computer science, internet
Publikation type: Other
Abstract: Concurrency plays an important role in programming language design. Logic variables in the form of futures and promises provide a means of synchronization and communication in concurrent computation. Futures and promises, which differ from general logic variables in that a distinction is made between reading and writing them, have been introduced previously. However, no formal operational semantics has been provided for promises. In order to formally investigate properties of futures and promises in a functional setting, a concurrent lambda-calculus extended with futures and promises is presented. It is intended to provide a computation model for the programming language Alice. We prove the calculus confluent, and give a proof showing strong normalization in the simply typed case without promises. Further, we introduce a type system so as to statically enforce proper use of promises in the calculus.
Link to this record: urn:nbn:de:bsz:291-scidok-2897
Date of registration: 6-Jul-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
Schwinghammer-Diplom.pdf561,77 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.