PolyTOIL
From MaRDI portal
Software:26111
swMATH14205MaRDI QIDQ26111FDOQ26111
Author name not available (Why is that?)
Cited In (19)
- Basic theory of \(F\)-bounded quantification.
- Type-safe covariant specialization with generalized matching
- A language for generic programming in the large
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Typed operational semantics for higher-order subtyping.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New Formalization of Subtyping to Match Subclasses to Subtypes
- A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA.
- Termination of system \(F\)-bounded: A complete proof
- Creol: A type-safe object-oriented model for distributed concurrent systems
- Title not available (Why is that?)
This page was built for software: PolyTOIL
