Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

FROCOS
2005
Springer

favoriteEmaildiscussreport

144views Control Systems» more FROCOS 2005»

A Concurrent Lambda Calculus with Futures

13 years 10 months ago

A Concurrent Lambda Calculus with Futures

Download www.cse.unsw.edu.au

Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with futures λ(fut), which formalizes the operational semantics of the programming language Alice ML. We show that natural program optimizations, as well as partial evaluation with respect to deterministic rules, are correct for λ(fut). This relies on a number of fundamental properties that we establish for our observational semantics.

Joachim Niehren, Jan Schwinghammer, Gert Smolka

Real-time Traffic

Concurrent Lambda Calculus | FROCOS 2005 | Language Alice Ml | Observational Semantics |

claim paper

Related Content

» Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures

» Propositions as sessions

» Lolliproc to concurrency from classical linear logic via curryhoward and control

» Psicalculi a framework for mobile processes with nominal data and logic

» Psicalculi Mobile Processes Nominal Data and Logic

» Type inference in intuitionistic linear logic

» How to Make adhoc Polymorphism Less adhoc

» Dynamic rebinding for marshalling and update with destructtime

» Joinads A Retargetable ControlFlow Construct for Reactive Parallel and Concurrent Programm...

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FROCOS
Authors	Joachim Niehren, Jan Schwinghammer, Gert Smolka

Comments (0)