Filter models for conjunctive-disjunctive \(\lambda\)-calculi

DOI10.1016/S0304-3975(96)80703-1zbMath0874.03015OpenAlexW4210461193MaRDI QIDQ672044

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

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)80703-1

zbMATH Keywords

operational semanticsfilter modelparallelismdenotational semanticsnondeterminismtype assignmentcapabilitiesextended lambda-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

What is a categorical model of the differential and the resource λ-calculi? ⋮ Call-by-Value Non-determinism in a Linear Logic Type Discipline ⋮ 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 ⋮ A Relational Model of a Parallel and Non-deterministic λ-Calculus ⋮ 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ Infinite \(\lambda\)-calculus and types ⋮ A Fully Abstract Model for Mobile Ambients ⋮ Discrimination by parallel observers: the algorithm.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Principal type schemes for an extended type theory
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A mathematical semantics for a nondeterministic typed lambda-calculus
• Domain theory in logical form
• Complete restrictions of the intersection type discipline
• A calculus of mobile processes. II
• LCF considered as a programming language
• Power domains
• Full abstraction in the lazy lambda calculus
• Lambda-calculi for (strict) parallel functions
• Type inference, abstract interpretation and strictness analysis
• A semantics for static type inference
• A semantics for static type inference in a nondeterministic language
• A fully abstract denotational model for higher-order processes
• The lazy lambda calculus in a concurrency scenario
• The completeness theorem for typing lambda-terms
• Intersection and union types: Syntax and semantics
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• A filter lambda model and the completeness of type assignment
• Lambda‐Calculus Models and Extensionality
• Functions as processes
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• A Powerdomain Construction
• Principal Type Schemes for the Strict Type Assignment System