Amb Breaks Well-Pointedness, Ground Amb Doesn't
From MaRDI portal
Publication:5262940
Recommendations
Cites work
- scientific article; zbMATH DE number 1418339 (Why is no real title available?)
- scientific article; zbMATH DE number 3390247 (Why is no real title available?)
- Bisimilarity as a theory of functional programming
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Infinitary Howe's method
- Infinite trace equivalence
- Normal form simulation for McCarthy's \textsf{amb}
- Notions of computation and monads
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
- Proving congruence of bisimulation in functional programming languages
- Reasoning about functions with effects
- Relational reasoning about contexts
- Thunks and the λ-calculus
Cited in
(5)- Extracting total Amb programs from proofs
- Normal form simulation for McCarthy's \textsf{amb}
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
- Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction
- scientific article; zbMATH DE number 3902001 (Why is no real title available?)
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)