Class-Based versus Object-Based: A Denotational Comparison
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Semantics and logic of object calculi
Theoretical Computer Science - Logic, semantics and theory of programming
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
Difunctorial Semantics of Object Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Step-indexed kripke models over recursive worlds
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
About hoare logics for higher-order store
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A Domain-Theoretic Model Of Nominally-Typed Object-Oriented Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
The main contribution of this paper is a formal characterization of recursive object specifications based on a denotational untyped semantics of the object calculus and thediscussion of existence of those (recursive) specifications. The semantics is then applied to prove soundness of a programming logic [2] for the object calculus [1] and to suggestpossible extensions. For the purposes of this discussion we use an informal logic of predomains in order to avoid any commitment to a particular syntax of specification logic.