Parameter-free polymorphic types

DOI10.1016/J.APAL.2008.06.002zbMath1156.03012OpenAlexW2046193889MaRDI QIDQ958481

Klaus Aehlig

Publication date: 5 December 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.06.002

zbMATH Keywords

typespolymorphismlambda calculussecond-order arithmeticinductive definitions

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Atomic polymorphism ⋮ MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics

Cites Work

• Handbook of proof theory
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• On the computational content of the axiom of choice
• Induction and inductive definitions in fragments of second order arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameter-free polymorphic types