A Relational Model of a Parallel and Non-deterministic λ-Calculus

DOI10.1007/978-3-540-92687-0_8zbMath1211.03026OpenAlexW1585954935MaRDI QIDQ3605523

Antonio Bucciarelli, Giulio Manzonetto, Thomas Ehrhard

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92687-0_8

zbMATH Keywords

denotational semanticsnon-determinism\(\lambda \)-calculusrelational modelparallel composition

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Related Items (6)

What is a categorical model of the differential and the resource λ-calculi? ⋮ Modelling Local Variables: Possible Worlds and Object Spaces ⋮ A relational semantics for parallelism and non-determinism in a functional setting ⋮ The Scott model of linear logic is the extensional collapse of its relational model ⋮ A typed, algebraic, computational lambda-calculus ⋮ Probabilistic coherence spaces as a model of higher-order probabilistic computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• LCF considered as a programming language
• Lambda-calculi for (strict) parallel functions
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• A stable programming language
• Not Enough Points Is Enough
• A Powerdomain Construction
• A Filter Model for Concurrent $\lambda$-Calculus
• Localisation and interaction in one dimension
• The lambda calculus is algebraic
• Foundations of Software Science and Computation Structures

This page was built for publication: A Relational Model of a Parallel and Non-deterministic λ-Calculus