Combinatory logic with polymorphic types

DOI10.1007/s00153-021-00792-5OpenAlexW3197736966MaRDI QIDQ2144609

William R. Stirton

Publication date: 14 June 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00792-5

zbMATH Keywords

normalizabilitycombinatory logicsystem Fpolymorphic types

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Proof theory and constructive mathematics (03Fxx)

Uses Software

• Automath

Cites Work

• A decidable theory of type assignment
• How to assign ordinal numbers to combinatory terms with polymorphic types
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• Reduction of higher type levels by means of an ordinal analysis of finite terms
• Combinatory logic. With two sections by William Craig.
• Lectures on the Curry-Howard isomorphism
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Combinatory logic. Vol. II
• Some improvements to Turner's algorithm for bracket abstraction
• Ordinal analysis of terms of finite type
• How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
• Recent Advances in Ordinal Analysis: Π¹₂— CA and Related Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item