A Filter Model for Concurrent \lambda-Calculus

DOI10.1137/S0097539794275860MaRDI QIDQ4210114zbMATH OpenOpenAlexFDO

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

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

concurrencyfull abstractionfunctional programmingnondeterminismoperational semanticsparallelismpowerdomainsemantics of untyped lambda calculustype-theoretic semantics

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Logical aspects of lattices and related structures (03G10) Theory of programming languages (68N15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Recommendations

• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• scientific article; zbMATH DE number 1479607
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• A filter lambda model and the completeness of type assignment
• A Filter Model for the λμ-Calculus

Cited in

(29)

• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• Infinite \(\lambda\)-calculus and types
• Types for access control
• On the representation of McCarthy's amb in the -calculus
• Normalization, approximation, and semantics for combinator systems
• Discrimination by parallel observers: the algorithm.
• Infinitary lambda calculus and discrimination of Berarducci trees.
• A curry-style semantics of interaction: from untyped to second-order lazy -calculus
• The untyped computational \(\lambda \)-calculus and its intersection type discipline
• Precise subtyping for synchronous multiparty sessions
• A fully abstract model for mobile ambients
• A Filter Model for the λμ-Calculus
• scientific article; zbMATH DE number 3889502 (Why is no real title available?)
• 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
• A relational semantics for parallelism and non-determinism in a functional setting
• scientific article; zbMATH DE number 1479607 (Why is no real title available?)
• Relational graph models at work
• From Böhm's theorem to observational equivalences: an informal account
• Soundness conditions for big-step semantics
• Proof normalisation in a logic identifying isomorphic propositions
• Precise Subtyping for Asynchronous Multiparty Sessions
• Intersection types for -trees
• Extensional proofs in a propositional logic modulo isomorphisms
• From semantics to types: the case of the imperative \(\lambda\)-calculus
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

Describes a project that uses

Uses Software

• Facile

This page was built for publication: A Filter Model for Concurrent $\lambda$-Calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210114)