An elementary fragment of second-order lambda calculus

An elementary fragment of second-order lambda calculus

A fragment of second-order lambda calculus (System F ) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, that is, the types are assigned levels, and a quantified variable can only be instantiated by a type of smal...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on computational logic 2005-04, Vol.6 (2), p.468-480
Hauptverfasser: Aehlig, Klaus, Johannsen, Jan
Format: Artikel
Sprache:eng
Schlagworte:
Calculus
Logic programming
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fragment of second-order lambda calculus (System F ) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, that is, 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.
ISSN:1529-3785
1557-945X
DOI:10.1145/1055686.1055695