The following pages link to A semantic basis for Quest (Q4939689):
Displaying 18 items.
- From CML to its process algebra (Q672132) (← links)
- Divergence of \(F_{\leq}\) type checking (Q673966) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Typed operational semantics for higher-order subtyping. (Q1401950) (← links)
- A computable expression of closure to efficient causation (Q1617623) (← links)
- Subtyping recursion and parametric polymorphism in kernel Fun (Q1780453) (← links)
- Basic theory of \(F\)-bounded quantification. (Q1854309) (← links)
- Comparing object encodings. (Q1854318) (← links)
- Type destructors (Q1854494) (← links)
- Foundations for virtual types (Q1854531) (← links)
- Integration of parametric and ``ad hoc'' second order polymorphism in a calculus with subtyping (Q1918933) (← links)
- Types for modules (Q2375744) (← links)
- CPO-models for second order lambda calculus with recursive types and subtyping (Q3142273) (← links)
- A paradigmatic object-oriented programming language: Design, static typing and semantics (Q4764618) (← links)
- Types as parameters (Q5044771) (← links)
- Subtyping + extensionality: Confluence of βηtop reduction in F≤ (Q5096246) (← links)
- An operational semantics for TOOPLE: A statically-typed object-oriented programming language (Q5890071) (← links)
- An exper model for Quest (Q6116585) (← links)
