Abstract
Type free lazy λ-calculus is enriched with angelic parallelism and demonic nondeterminism. Call-by-name and call-by-value abstractions are considered and the operational semantics is stated in terms of a must convergency predicate. We introduce a type assignment system with intersection and union types and we prove the induced logical semantics to be fully abstract.
Cite
CITATION STYLE
Dezani-Ciancaglini, M., de’Liguoro, U., & Piperno, A. (1994). Fully abstract semantics for concurrent λ-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 789 LNCS, pp. 16–35). Springer Verlag. https://doi.org/10.1007/3-540-57887-0_88
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
