Type theories and object-oriented programmimg

DOI10.1145/62058.62060zbMath0649.68009OpenAlexW2041042883MaRDI QIDQ3795187

Chris Tomlinson, Scott Danforth

Publication date: 1988

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/62058.62060

zbMATH Keywords

surveyinheritancepolymorphismobject-oriented programmingtype inferencedata abstractionabstract data typestype checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Graphical inheritance notation for state-based classes ⋮ Recursive types for Fun ⋮ The data model of FAD, a database programming language ⋮ Divergence of \(F_{\leq}\) type checking ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ A paradigmatic object-oriented programming language: Design, static typing and semantics

This page was built for publication: Type theories and object-oriented programmimg