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

MaRDI QIDQ2852363zbMATH OpenFDO

Authors Soren B. Lassen

Publication date 8 October 2013

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

Mathematics Subject Classification ID

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

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

Cited in

(8)

• Proving soundness of extensional normal-form bisimilarities
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• Applicative may- and should-simulation in the call-by-value lambda calculus with AMB
• Amb Breaks Well-Pointedness, Ground Amb Doesn't
• Bisimulations for delimited-control operators
• Extracting total Amb programs from proofs
• Fully abstract normal form bisimulation for call-by-value PCF
• Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence

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)