DocumentCode :
2144632
Title :
Toward a semantics for the QUEST language
Author :
Alessi, Fabio ; Barbanera, Franco
Author_Institution :
Dipartimento di Inf., Torino Univ., Italy
fYear :
1991
fDate :
15-18 July 1991
Firstpage :
12
Lastpage :
21
Abstract :
A model is given for the second-order lambda calculus extended with inheritance, bounded quantification, recursive types, constructors and kinds. This language, called μ-FunK, can be viewed as the core of the QUEST language defined by L. Cardelli (SRC Rep. 45, 1989). Types are interpreted as intervals of partial equivalence relations. Because of the properties of intervals and their ordering, all the type constructors are continuous functions. As a consequence a system where a kind is given to each constructor constant employed can be modeled. In such a model the meaning of operator μ, the constructor of recursive types, turns out to be just the minimal fixed-point operator
Keywords :
formal languages; formal logic; μ-FunK; QUEST language; bounded quantification; constructors; continuous functions; inheritance; kinds; minimal fixed-point operator; partial equivalence relations; recursive types; second-order lambda calculus; semantics; Calculus; Computer science; Object oriented modeling; Object oriented programming; Runtime;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1991. LICS '91., Proceedings of Sixth Annual IEEE Symposium on
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-2230-X
Type :
conf
DOI :
10.1109/LICS.1991.151626
Filename :
151626
Link To Document :
بازگشت