A characterization of lambda-terms transforming numerals

DOI10.1017/S0956796816000113zbMath1420.68042MaRDI QIDQ5371970

Paweł Parys

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Unnamed Item ⋮ The Complexity of the Diagonal Problem for Recursion Schemes

Cites Work

• Unnamed Item
• Word operation definable in the typed \(\lambda\)-calculus
• The typed lambda-calculus is not elementary recursive
• Regular Cost Functions, Part I: Logic and Algebra over Words
• Böhm trees as higher-order recursion schemes
• On the Significance of the Collapse Operation
• Definierbare Funktionen imλ-Kalkül mit Typen
• How Many Numbers Can a Lambda-Term Contain?
• Pumping by Typing

This page was built for publication: A characterization of lambda-terms transforming numerals