Combinatory logic with polymorphic types
From MaRDI portal
Publication:2144609
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; zbMATH DE number 4164128
- scientific article; zbMATH DE number 6307924
- Finite combinatory logic with intersection types
Cites work
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 5318491 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 3497886 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 3328152 (Why is no real title available?)
- scientific article; zbMATH DE number 3349775 (Why is no real title available?)
- scientific article; zbMATH DE number 3358455 (Why is no real title available?)
- scientific article; zbMATH DE number 3068529 (Why is no real title available?)
- A decidable theory of type assignment
- Combinatory logic. Vol. II
- Combinatory logic. With two sections by William Craig.
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- How to assign ordinal numbers to combinatory terms with polymorphic types
- 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
- Ordinal analysis of terms of finite type
- Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- Reduction of higher type levels by means of an ordinal analysis of finite terms
- Some improvements to Turner's algorithm for bracket abstraction
- The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
Cited in
(5)- scientific article; zbMATH DE number 3941502 (Why is no real title available?)
- scientific article; zbMATH DE number 4143942 (Why is no real title available?)
- scientific article; zbMATH DE number 823591 (Why is no real title available?)
- scientific article; zbMATH DE number 6307924 (Why is no real title available?)
- scientific article; zbMATH DE number 6304248 (Why is no real title available?)
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)