Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0884.68076
Alessi, Fabio; Barbanera, Franco
Toward a semantics for the quest language. (English)
[J] RAIRO, Inform. Théor. Appl. 28, No.6, 513-555 (1994). ISSN 0988-3754

Summary: A model is given for the second-order lambda calculus extended with inheritance, bounded quantification, recursive types, constructors and kinds. This language can be viewed as the core of the QUEST language defined by Cardelli. Types are interpreted as intervals of partial equivalence relations. In such a model the meaning of the operator $\mu$, the constructor of recursive types, turns out to be the natural one i.e. the least fixed point operator.

MSC 2000:: *68Q55 Semantics
68N15 Programming languages

Keywords: second-order lambda calculus; QUEST language

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]