The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
From MaRDI portal
Publication:4645809
Recommendations
- scientific article; zbMATH DE number 2040977
- scientific article; zbMATH DE number 5007860
- scientific article; zbMATH DE number 4113956
- Publication:4941901
- The semantics of lazy functional languages
- Inductive prover based on equality saturation for a lazy functional language
- Implementing theorem provers in a purely functional style
Cites work
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 1231468 (Why is no real title available?)
- scientific article; zbMATH DE number 675533 (Why is no real title available?)
- scientific article; zbMATH DE number 2079040 (Why is no real title available?)
- Comprehending monads
- Computational adequacy via ‘mixed’ inductive definitions
- Deriving a lazy abstract machine
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Isabelle. A generic theorem prover
- The congruence of two programming language definitions
- Two-Level Functional Languages
Cited in
(5)- scientific article; zbMATH DE number 2086498 (Why is no real title available?)
- The adequacy of Launchbury's natural semantics for lazy evaluation
- scientific article; zbMATH DE number 2079040 (Why is no real title available?)
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- scientific article; zbMATH DE number 5007860 (Why is no real title available?)
This page was built for publication: The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645809)