Computer Science – Logic in Computer Science
Scientific paper
2002-10-25
Computer Science
Logic in Computer Science
16 pages; corrections
Scientific paper
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.
Aehlig Klaus
Johannsen Jan
No associations
LandOfFree
An Elementary Fragment of Second-Order Lambda Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Elementary Fragment of Second-Order Lambda Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Elementary Fragment of Second-Order Lambda Calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-614340