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

DOI10.1016/J.APAL.2011.09.008MaRDI QIDQ408545zbMATH OpenOpenAlexFDO

Authors Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto

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

nondeterminismparallelismdenotational semantics\(\lambda \)-calculusrelational model

Mathematics Subject Classification ID

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

Recommendations

• A Relational Model of a Parallel and Non-deterministic λ-Calculus
• Non-determinism analyses in a parallel-functional language
• scientific article; zbMATH DE number 1086633
• scientific article; zbMATH DE number 1691453
• A denotational semantics for shared-memory parallelism and nondeterminism
• Relation-based semantics for concurrency
• Toward a formal semantic framework for deterministic parallel programming

Cites work

• scientific article; zbMATH DE number 1670484 (Why is no real title available?)
• scientific article; zbMATH DE number 49833 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• A Filter Model for Concurrent $\lambda$-Calculus
• A Powerdomain Construction
• A Relational Model of a Parallel and Non-deterministic λ-Calculus
• A stable programming language
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• Foundations of Software Science and Computation Structures
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Full abstraction for lambda calculus with resources and convergence testing
• LCF considered as a programming language
• Lambda-calculi for (strict) parallel functions
• Linear logic
• Localisation and interaction in one dimension
• Not Enough Points Is Enough
• The Scott model of linear logic is the extensional collapse of its relational model
• The lambda calculus is algebraic
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(12)

• Tight typings and split bounds, fully developed
• scientific article; zbMATH DE number 7526055 (Why is no real title available?)
• scientific article; zbMATH DE number 7559280 (Why is no real title available?)
• 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
• A formal library of set relations and its application to synchronous languages
• A Relational Model of a Parallel and Non-deterministic λ-Calculus
• Relational graph models at work
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• Non-determinism analyses in a parallel-functional language
• The vectorial \(\lambda\)-calculus

This page was built for publication: A relational semantics for parallelism and non-determinism in a functional setting

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