scientific article; zbMATH DE number 3328152
From MaRDI portal
Publication:5606582
Cited in
(18)- Combinatory weak reduction in lambda calculus
- LCF considered as a programming language
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
- Combinatory logic with polymorphic types
- Gentzen's consistency proof without heightlines
- Well-partial orderings and their maximal order types
- How to assign ordinal numbers to combinatory terms with polymorphic types
- Size-based termination of higher-order rewriting
- A Glimpse of $$ \sum_{3} $$-elementarity
- The search for a reduction in combinatory logic equivalent to -reduction. II.
- Probabilistic rewriting: normalization, termination, and unique normal forms
- Normalization by Evaluation for Typed Weak lambda-Reduction
- Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
- Gödel and intuitionism
- Proof-theoretic investigation of -reduction in the simply typed -calculus
- Judgmental and definitional equality from a Fregean perspective
- Normalization proof for Peano arithmetic
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)
