An elementary proof of strong normalization for atomic F
From MaRDI portal
An elementary proof of strong normalization for atomic \(\mathsf F\)
Recommendations
Cites work
- A simple proof of Parsons' theorem
- An upper bound for reduction sequences in the typed -calculus
- Atomic polymorphism
- Comments on predicative logic
- Constructivism in mathematics. An introduction. Volume I
- Exact bounds for lengths of reductions in typed -calculus
- scientific article; zbMATH DE number 1722646 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 949290 (Why is no real title available?)
- Intensional interpretations of functionals of finite type I
- Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
- The faithfulness of \(\mathbf{F_{at}}\): a proof-theoretic proof
Cited in
(6)- Atomic polymorphism and the existence property
- A refined interpretation of intuitionistic logic by means of atomic polymorphism
- scientific article; zbMATH DE number 1722646 (Why is no real title available?)
- -conversions of IPC implemented in atomic F
- The Russell-Prawitz embedding and the atomization of universal instantiation
- The computational content of atomic polymorphism
This page was built for publication: An elementary proof of strong normalization for atomic \(\mathsf F\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957669)