2007
DOI: 10.1016/j.entcs.2007.02.041
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
20
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
4
2
1

Relationship

6
1

Authors

Journals

citations
Cited by 18 publications
(20 citation statements)
references
References 10 publications
0
20
0
Order By: Relevance
“…A common feature is that fairness of execution is mirrored in the semantic theory. This combination of may-and must-convergence properly captures the non-determinism arising in concurrent programming languages Niehren et al 2007). Given a language C we write = C for the observational semantics on programs of the language C, which equates all programs with equal may-and must-convergence behavior in all contexts.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A common feature is that fairness of execution is mirrored in the semantic theory. This combination of may-and must-convergence properly captures the non-determinism arising in concurrent programming languages Niehren et al 2007). Given a language C we write = C for the observational semantics on programs of the language C, which equates all programs with equal may-and must-convergence behavior in all contexts.…”
Section: Introductionmentioning
confidence: 99%
“…We now describe our approach and results in more detail. We start with an enriched core language of Alice ML, the calculus λ τ (fch) which extends the calculi of Niehren et al (2006Niehren et al ( , 2007. This is a typed call-by-value lambda with futures, polymorphic data and type constructors, concurrent threads, reference cells, and handled futures.…”
Section: Introductionmentioning
confidence: 99%
“…Besides observing whether a program can terminate (called may-convergence) our notion of contextual equivalence also observes whether a program never loses the ability to terminate after some reductions (called should-convergence or sometimes mustconvergence, see e.g. [3,15,22,23]). The latter notion slightly differs from the classic notion of must-convergence (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…The operational semantics of CHF is related to the operational semantics for Concurrent Haskell introduced in [11,17] where also exceptions are considered. CHF also borrows some ideas from the impure call-by-value lambda calculus with futures [14,15].…”
Section: Introductionmentioning
confidence: 99%
“…[3,24], for process calculi and algebras [9,5,23], and also for concurrent lambda calculi that model real concurrent programming languages e.g. Concurrent Haskell, STM Haskell and Alice ML (see [20,[25][26][27]). …”
Section: Introductionmentioning
confidence: 99%