PolyTOIL
From MaRDI portal
Cited in
(23)- Basic theory of F-bounded quantification.
- Type-safe covariant specialization with generalized matching
- A new formalization of subtyping to match subclasses to subtypes
- A language for generic programming in the large
- A CuCh interpretation of an object-oriented language
- \(F\)-bounded quantification and the matching relation
- scientific article; zbMATH DE number 2089395 (Why is no real title available?)
- Evolution of rule-based programs
- Matching for the lambda calculus of objects
- Comparing object encodings.
- Foundations for virtual types
- Objects and classes in Algol-like languages
- Semantics of temporal classes
- Smalltalk
- BETA
- Featherweight Java
- gbeta
- Typed operational semantics for higher-order subtyping.
- scientific article; zbMATH DE number 1420790 (Why is no real title available?)
- scientific article; zbMATH DE number 1088218 (Why is no real title available?)
- Termination of system F-bounded: A complete proof
- Creol: A type-safe object-oriented model for distributed concurrent systems
- On problems in polymorphic object-oriented languages with self types and matching
This page was built for software: PolyTOIL
