A semantic basis for Quest

DOI10.1017/S0956796800000198zbMath0941.68528WikidataQ56982252 ScholiaQ56982252MaRDI QIDQ4939689

Luca Cardelli

Publication date: 8 February 2000

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

semanticssubtypingtype inference rulesimpredicative type quantifierspartial equivalence relation model of typesprogramming language Quest

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items (18)

A computable expression of closure to efficient causation ⋮ An operational semantics for TOOPLE: A statically-typed object-oriented programming language ⋮ Types as parameters ⋮ Types for modules ⋮ Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping ⋮ Subtyping + extensionality: Confluence of βηtop reduction in F≤ ⋮ An exper model for Quest ⋮ Typed operational semantics for higher-order subtyping. ⋮ From CML to its process algebra ⋮ Divergence of \(F_{\leq}\) type checking ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ Basic theory of \(F\)-bounded quantification. ⋮ Comparing object encodings. ⋮ Type destructors ⋮ Foundations for virtual types ⋮ The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus ⋮ A paradigmatic object-oriented programming language: Design, static typing and semantics ⋮ CPO-models for second order lambda calculus with recursive types and subtyping

Cites Work

• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A semantics of multiple inheritance
• Polymorphic type inference and containment
• Lambda‐Calculus Models and Extensionality

This page was built for publication: A semantic basis for Quest