A relational semantics for parallelism and non-determinism in a functional setting

DOI10.1016/j.apal.2011.09.008zbMath1241.03010OpenAlexW2169655078MaRDI QIDQ408545

Antonio Bucciarelli, Giulio Manzonetto, Thomas Ehrhard

Publication date: 10 April 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2011.09.008

zbMATH Keywords

parallelismdenotational semanticsnondeterminism\(\lambda \)-calculusrelational model

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

Call-by-Value Non-determinism in a Linear Logic Type Discipline ⋮ Extensional proofs in a propositional logic modulo isomorphisms ⋮ Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications ⋮ Tight typings and split bounds, fully developed ⋮ Unnamed Item ⋮ The vectorial \(\lambda\)-calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Scott model of linear logic is the extensional collapse of its relational model
• Linear logic
• 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
• A Relational Model of a Parallel and Non-deterministic λ-Calculus
• 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
• Full abstraction for lambda calculus with resources and convergence testing
• Foundations of Software Science and Computation Structures