Definierbare Funktionen imλ-Kalkül mit Typen

DOI10.1007/BF02276799zbMath0329.02011OpenAlexW2334137773WikidataQ63090393 ScholiaQ63090393MaRDI QIDQ4094854

Helmut Schwichtenberg

Publication date: 1976

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137913

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (max. 100)

Word operation definable in the typed \(\lambda\)-calculus ⋮ A characterization of lambda-terms transforming numerals ⋮ An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ The Typed Böhm Theorem ⋮ Introduction to Type Theory ⋮ The typed lambda-calculus is not elementary recursive ⋮ LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS ⋮ Ordinals and ordinal functions representable in the simply typed lambda calculus ⋮ \(\lambda\)-definability of free algebras ⋮ Functions over free algebras definable in the simply typed lambda calculus ⋮ A quantitative model for simply typed λ-calculus

Cites Work

• Combinatory logic. Vol. II
• Unnamed Item
• Unnamed Item

This page was built for publication: Definierbare Funktionen imλ-Kalkül mit Typen