Functionals defined by recursion
From MaRDI portal
Publication:2535386
DOI10.1305/ndjfl/1093956080zbMath0183.01403OpenAlexW2075824323MaRDI QIDQ2535386
Publication date: 1967
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093956080
Related Items (10)
Constructive set theoretic models of typed combinatory logic ⋮ An upper bound for reduction sequences in the typed \(\lambda\)-calculus ⋮ On a conjecture of Bergstra and Tucker ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ An abstract Church-Rosser theorem. II: Applications ⋮ A sequent calculus for type assignment ⋮ Ordinal analysis of terms of finite type ⋮ Typing and computational properties of lambda expressions ⋮ Reduction of higher type levels by means of an ordinal analysis of finite terms ⋮ The completeness theorem for typing lambda-terms
This page was built for publication: Functionals defined by recursion
