(Head-)normalization of typeable rewrite systems
From MaRDI portal
Publication:5055837
Recommendations
- Normalization results for typeable rewrite systems
- scientific article; zbMATH DE number 1942460
- Approximation and normalization results for typeable term rewriting systems
- scientific article; zbMATH DE number 23844
- Typed Applicative Structures and Normalization by Evaluation for System F ω
- Strong normalization in type systems: A model theoretical approach
- scientific article; zbMATH DE number 1301737
- scientific article; zbMATH DE number 4126684
- scientific article; zbMATH DE number 827981
- Normalization by evaluation for modal dependent type theory
Cites work
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 512770 (Why is no real title available?)
- scientific article; zbMATH DE number 512772 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A filter lambda model and the completeness of type assignment
- Combinatory logic. With two sections by William Craig.
- Complete restrictions of the intersection type discipline
- Intensional interpretations of functionals of finite type I
- Modularity of strong normalization in the algebraic-λ-cube
Cited in
(4)
This page was built for publication: (Head-)normalization of typeable rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055837)