Lambda-calculi for (strict) parallel functions
From MaRDI portal
Publication:1314269
DOI10.1006/inco.1994.1003zbMath0796.03021MaRDI QIDQ1314269
Publication date: 26 September 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00075174/file/RR-1387.pdf
parallel computation; full abstraction; continuous functions; type assignment; call-by-value; realizability interpretation; domains of parallel functions; lazy \(\lambda\)-calculus; parallel lambda-calculus
68Q55: Semantics in the theory of computing
68N01: General topics in the theory of software
03B40: Combinatory logic and lambda calculus
Related Items
Intersection types for \(\lambda\)-trees, Distributed processes and location failures, A relational semantics for parallelism and non-determinism in a functional setting, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Full abstractness for a functional/concurrent language with higher-order value-passing, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, A fully abstract denotational semantics for the \(\pi\)-calculus, On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus, Discrimination by parallel observers: the algorithm., Infinitary lambda calculus and discrimination of Berarducci trees., A Fully Abstract Model for Mobile Ambients, Term Collections in λ and ρ-calculi, Linear-algebraic λ-calculus: higher-order, encodings, and confluence., A Relational Model of a Parallel and Non-deterministic λ-Calculus, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
