Amb Breaks Well-Pointedness, Ground Amb Doesn't

DOI10.1016/j.entcs.2007.02.036zbMath1316.68098OpenAlexW2110624984WikidataQ56092880 ScholiaQ56092880MaRDI QIDQ5262940

Paul Blain Levy

Publication date: 10 July 2015

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.036

zbMATH Keywords

fixpointHowe's methodCIU theoremapplicative simulationcontext lemmaMcCarthy's amb

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Extracting total Amb programs from proofs ⋮ Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec

Cites Work

• Notions of computation and monads
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Bisimilarity as a theory of functional programming
• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
• Proving congruence of bisimulation in functional programming languages
• Thunks and the λ-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Amb Breaks Well-Pointedness, Ground Amb Doesn't