A paradigmatic object-oriented programming language: Design, static typing and semantics
From MaRDI portal
Publication:4764618
Recommendations
- scientific article; zbMATH DE number 615137
- scientific article; zbMATH DE number 52915
- scientific article; zbMATH DE number 1330432
- Implementing statically typed object-oriented programming languages
- An object-oriented deductive language
- A meta-language for typed object-oriented languages
- An abstract, reusable, and extensible programming language design architecture
- A domain-theoretic model of nominally-typed object-oriented programming
- A logic of object-oriented programs
Cites work
- scientific article; zbMATH DE number 3821076 (Why is no real title available?)
- scientific article; zbMATH DE number 49427 (Why is no real title available?)
- scientific article; zbMATH DE number 108549 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- A modest model of records, inheritance, and bounded quantification
- A semantic basis for Quest
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Denotational semantics of a parallel object-oriented language
- Inheritance as implicit coercion
- Operations on records
- Polymorphic type inference and containment
- Recursion over realizability structures
- The programming language oberon
- The semantics of second-order lambda calculus
- Type theories and object-oriented programmimg
Cited in
(21)- Basic theory of F-bounded quantification.
- Type-safe covariant specialization with generalized matching
- Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
- An operational approach to the semantics of classes: Application to type checking
- Matching MyType to subtyping
- An operational semantics for TOOPLE: A statically-typed object-oriented programming language
- Matching for the lambda calculus of objects
- Comparing object encodings.
- An imperative object calculus
- Dynamic overloading with copy semantics in object-oriented languages: a formal account
- Type-based hot swapping of running modules
- Privacy via subsumption
- A meta-language for typed object-oriented languages
- Paragon: a language using type hierarchies for the specification, implementation and selection of abstract data types
- An abstract, reusable, and extensible programming language design architecture
- Termination of system F-bounded: A complete proof
- Formal reasoning about modules, reuse and their correctness
- A declarative framework for object-oriented programming with genetic inheritance
- Semantic types and approximation for Featherweight Java
- Divergence of \(F_{\leq}\) type checking
- scientific article; zbMATH DE number 615137 (Why is no real title available?)
This page was built for publication: A paradigmatic object-oriented programming language: Design, static typing and semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764618)
