Supercompilation for Martin-Lof's type theory
From MaRDI portal
Publication:300348
Recommendations
Cites work
- scientific article; zbMATH DE number 50149 (Why is no real title available?)
- scientific article; zbMATH DE number 53088 (Why is no real title available?)
- scientific article; zbMATH DE number 2085175 (Why is no real title available?)
- A tutorial implementation of a dependently typed lambda calculus
- A tutorial on the universality and expressiveness of fold
- Higher-level supercompilation as a metasystem transition
- Practical foundations for programming languages
- The concept of a supercompiler
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
Cited in
(10)- Supercompilation for datatypes
- scientific article; zbMATH DE number 1420853 (Why is no real title available?)
- The strength of Martin-Löf type theory with a superuniverse. I
- Positive supercompilation for a higher-order call-by-value language
- Polynomial-time Martin-Löf type theory
- Certifying supercompilation for Martin-Löf's type theory
- The concept of a supercompiler
- scientific article; zbMATH DE number 3943000 (Why is no real title available?)
- Intermediate representation of programs with type specification based on pattern matching
- Positive supercompilation for a higher order call-by-value language
This page was built for publication: Supercompilation for Martin-Lof's type theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300348)
