scientific article
From MaRDI portal
Publication:3204024
zbMath0716.68012MaRDI QIDQ3204024
Thierry Coquand, Val Breazu-Tannen, Carl A. Gunter, Andrej Scedrov
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polymorphic lambda calculusinheritanceobject-oriented programmingparametric polymorphismtype-checkingFuntype disciplines
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Related Items (14)
On confluence for weakly normalizing systems ⋮ Subtyping + extensionality: Confluence of βηtop reduction in F≤ ⋮ Typed homomorphic relations extended with subtypes ⋮ An exper model for Quest ⋮ A modest model of records, inheritance, and bounded quantification ⋮ Inheritance as implicit coercion ⋮ Recursive types for Fun ⋮ Toward a semantics for the QUEST language ⋮ Linear logic, coherence and dinaturality ⋮ Transitivity in coercive subtyping ⋮ Coercion completion and conservativity in coercive subtyping ⋮ Operations on records ⋮ The semantics of second-order lambda calculus ⋮ Type inference with partial types
This page was built for publication:
