An Elementary Fragment of Second-Order Lambda Calculus [article]

Klaus Aehlig, Jan Johannsen
2004 arXiv   pre-print
A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be non-interleaved and stratified, i.e., the types are assigned levels, and a quantified variable can only be instantiated by a type of smaller level, with a slightly liberalized treatment of the level zero.
arXiv:cs/0210022v3 fatcat:7zywa2andzc3boacifjgb2dy6i