The lazy lambda calculus in a concurrency scenario
From MaRDI portal
Publication:1327395
DOI10.1006/inco.1994.1042zbMath0804.03008OpenAlexW2165407648MaRDI QIDQ1327395
Publication date: 22 January 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/10040673685c7f73ec7dc608d37a7c87c3056212
full abstractionconcurrencyapplicative bisimulationlazy \(\lambda\)-calculusMilner's process \(\pi\)-calculusnon-deterministic operators
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items
Infinitary lambda calculus and discrimination of Berarducci trees., A categorical framework for congruence of applicative bisimilarity in higher-order languages, On bisimilarity in lambda calculi with continuous probabilistic choice, A Complete, Co-inductive Syntactic Theory of Sequential Control and State, A two-level logic approach to reasoning about computations, Fair ambients, Theory of interaction, On the expressiveness and decidability of higher-order process calculi, A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus, Variations on mobile processes, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, From Böhm's Theorem to Observational Equivalences, From Applicative to Environmental Bisimulation, Intersection types for \(\lambda\)-trees, The λ-calculus in the π-calculus, A conservative look at operational semantics with variable binding, On the semantics of the call-by-name CPS transform, Unnamed Item, FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS, Discrimination by parallel observers: the algorithm., Decoding choice encodings, Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, Untyped lambda-calculus with input-output
