An Elementary Fragment of Second-Order Lambda Calculus
Logic in Computer Science
2007-05-23 v3
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0210022,
title = {An Elementary Fragment of Second-Order Lambda Calculus},
author = {Klaus Aehlig and Jan Johannsen},
journal= {arXiv preprint arXiv:cs/0210022},
year = {2007}
}
Comments
16 pages; corrections