Normal form simulation for McCarthy's \textsf{amb}

zbMATH Open1273.68088MaRDI QIDQ2852363FDOQ2852363

Authors: Soren B. Lassen 

Publication date: 8 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106002052

Recommendations

• Applicative may- and should-simulation in the call-by-value lambda calculus with AMB
• scientific article; zbMATH DE number 1418339
• Amb Breaks Well-Pointedness, Ground Amb Doesn't
• Typed Normal Form Bisimulation
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cited In (6)

• Applicative may- and should-simulation in the call-by-value lambda calculus with AMB
• Bisimulations for delimited-control operators
• Proving soundness of extensional normal-form bisimilarities
• Extracting total Amb programs from proofs
• Amb Breaks Well-Pointedness, Ground Amb Doesn't
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State

This page was built for publication: Normal form simulation for McCarthy's \textsf{amb}

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