The following pages link to (Q5606582):
Displaying 12 items.
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (Q505454) (← links)
- Normalization proof for Peano arithmetic (Q892146) (← links)
- Combinatory weak reduction in lambda calculus (Q1129266) (← links)
- LCF considered as a programming language (Q1243117) (← links)
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) (Q1295369) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- Gentzen's consistency proof without heightlines (Q2377348) (← links)
- Well-Partial Orderings and their Maximal Order Types (Q3295157) (← links)
- (Q5089021) (← links)
- Normalization by Evaluation for Typed Weak lambda-Reduction (Q5091147) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
