General recursive functions in a very simply interpretable typed \(\lambda\)-calculus

DOI10.1016/0304-3975(93)90088-BzbMath0796.03019MaRDI QIDQ1314352

G. Jacopini, Giovanna Sontacchi

Publication date: 9 October 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallel operatorspartial recursive functionssimply typed lambda-calculus

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• \(\mathbb{T}^\omega\) as a universal domain
• LCF considered as a programming language
• A discrimination algorithm inside \(\lambda -\beta\)-calculus

This page was built for publication: General recursive functions in a very simply interpretable typed \(\lambda\)-calculus