Applicative may- and should-simulation in the call-by-value lambda calculus with AMB

DOI10.1007/978-3-319-08918-8_26MaRDI QIDQ5170830zbMATH OpenOpenAlexFDO

Authors David Sabel, Manfred Schmidt-Schauß

Publication date 24 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08918-8_26

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• On applicative similarity, sequentiality, and full abstraction
• Normal form simulation for McCarthy's \textsf{amb}
• Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
• On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
• Simulation in the call-by-need lambda-calculus with letrec

Cited in

(1)

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

This page was built for publication: Applicative may- and should-simulation in the call-by-value lambda calculus with AMB

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