A Filter Model for Concurrent $\lambda$-Calculus

DOI10.1137/S0097539794275860zbMath0916.03017MaRDI QIDQ4210114

Mariangiola Dezani-Ciancaglini, Adolfo Piperno, Ugo de'Liguoro

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794275860

zbMATH Keywords

operational semantics; parallelism; full abstraction; concurrency; nondeterminism; functional programming; powerdomain; semantics of untyped lambda calculus; type-theoretic semantics

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68N15: Theory of programming languages

03B70: Logic in computer science

03G10: Logical aspects of lattices and related structures

68Q55: Semantics in the theory of computing

03B40: Combinatory logic and lambda calculus

Related Items

Unnamed Item, From Böhm's Theorem to Observational Equivalences, Unnamed Item, Soundness Conditions for Big-Step Semantics, Intersection types for \(\lambda\)-trees, Precise Subtyping for Asynchronous Multiparty Sessions, Extensional proofs in a propositional logic modulo isomorphisms, A relational semantics for parallelism and non-determinism in a functional setting, Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca, Infinite \(\lambda\)-calculus and types, Types for access control, On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus, Discrimination by parallel observers: the algorithm., Infinitary lambda calculus and discrimination of Berarducci trees., Precise subtyping for synchronous multiparty sessions, A Fully Abstract Model for Mobile Ambients, Call-by-Value Non-determinism in a Linear Logic Type Discipline, A Relational Model of a Parallel and Non-deterministic λ-Calculus, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, On the Values of Reducibility Candidates

Uses Software

• Facile