Combinatory logic with polymorphic types

DOI10.1007/S00153-021-00792-5OpenAlexW3197736966MaRDI QIDQ2144609FDOQ2144609

Authors: 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

Recommendations

• Polymorphic types in functional logic programming
• scientific article; zbMATH DE number 823591
• Implementing polymorphic typing in a logic programming language
• Combinatory logic. Pure, applied and typed
• scientific article; zbMATH DE number 3941502
• Syntactic logical relations for polymorphic and recursive types
• Typing in reflective combinatory logic
• scientific article
• scientific article; zbMATH DE number 6307924
• Finite combinatory logic with intersection types

zbMATH Keywords

combinatory logicsystem Fpolymorphic typesnormalizability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Automath

This page was built for publication: Combinatory logic with polymorphic types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144609)