Ordinals and ordinal functions representable in the simply typed lambda calculus

DOI10.1016/S0168-0072(98)00046-3zbMath0932.03016MaRDI QIDQ1302304

Norman Danner

Publication date: 13 March 2000

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

ordinal notationsordinal functionssimply typed lambda calculusordinal computation

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Combinatory logic and lambda calculus (03B40)

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• \(\lambda\)-definability of free algebras
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• Word operation definable in the typed \(\lambda\)-calculus
• The typed lambda-calculus is not elementary recursive
• Functions over free algebras definable in the simply typed lambda calculus
• Definierbare Funktionen imλ-Kalkül mit Typen

This page was built for publication: Ordinals and ordinal functions representable in the simply typed lambda calculus