Amb Breaks Well-Pointedness, Ground Amb Doesn't

DOI10.1016/J.ENTCS.2007.02.036zbMATH Open1316.68098OpenAlexW2110624984WikidataQ56092880 ScholiaQ56092880MaRDI QIDQ5262940FDOQ5262940

Authors: 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

Recommendations

• Not Enough Points Is Enough
• The breakdown point -- examples and counterexamples
• On weak ground

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)

Cites Work

• Notions of computation and monads
• Bisimilarity as a theory of functional programming
• Proving congruence of bisimulation in functional programming languages
• Title not available (Why is that?)
• Infinite trace equivalence
• Thunks and the λ-calculus
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Relational reasoning about contexts
• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
• Reasoning about functions with effects
• Infinitary Howe's method
• Title not available (Why is that?)
• Normal form simulation for McCarthy's \textsf{amb}

Cited In (4)

• Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
• Extracting total Amb programs from proofs
• Title not available (Why is that?)
• Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction

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

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