A denotational approach for type-checking in object-oriented programming languages
From MaRDI portal
Publication:4697448
DOI10.1016/0096-0551(93)90037-2zbMATH Open0770.68086OpenAlexW1997553781MaRDI QIDQ4697448FDOQ4697448
Publication date: 29 June 1993
Published in: Computer Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-0551(93)90037-2
General topics in the theory of software (68N01) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)
Cited In (8)
- Mechanisms for improved covariant type-checking
- An operational approach to the semantics of classes: Application to type checking
- An operational semantics for TOOPLE: A statically-typed object-oriented programming language
- Preemptive Type Checking in Dynamically Typed Languages
- Erratum to ``Efficient inference of object types
- Lower bounds on type checking overloading
- Title not available (Why is that?)
- Type Checking by Domain Analysis in Ampersand
Uses Software
Recommendations
This page was built for publication: A denotational approach for type-checking in object-oriented programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697448)