A semantic basis for Quest
From MaRDI portal
Cites work
Cited in
(18)- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
- Typed operational semantics for higher-order subtyping.
- A computable expression of closure to efficient causation
- Subtyping recursion and parametric polymorphism in kernel Fun
- Basic theory of F-bounded quantification.
- Comparing object encodings.
- Type destructors
- Foundations for virtual types
- Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
- Types for modules
- CPO-models for second order lambda calculus with recursive types and subtyping
- A paradigmatic object-oriented programming language: Design, static typing and semantics
- Types as parameters
- Subtyping + extensionality: confluence of \(\beta \eta\)top reduction in \(\mathrm{F}_\leq\)
- An operational semantics for TOOPLE: A statically-typed object-oriented programming language
- An exper model for Quest
- From CML to its process algebra
- Divergence of \(F_{\leq}\) type checking
This page was built for publication: A semantic basis for Quest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939689)