scientific article; zbMATH DE number 3328152
From MaRDI portal
Publication:5606582
Cited in
(16)- A Glimpse of $$ \sum_{3} $$-elementarity
- LCF considered as a programming language
- Size-based termination of higher-order rewriting
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
- Combinatory logic with polymorphic types
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
- Gödel and intuitionism
- scientific article; zbMATH DE number 7566061 (Why is no real title available?)
- Normalization proof for Peano arithmetic
- Normalization by Evaluation for Typed Weak lambda-Reduction
- scientific article; zbMATH DE number 7559285 (Why is no real title available?)
- The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.
- How to assign ordinal numbers to combinatory terms with polymorphic types
- Combinatory weak reduction in lambda calculus
- Gentzen's consistency proof without heightlines
- Well-partial orderings and their maximal order types
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5606582)
