Full Abstraction at Package Boundaries of Object-Oriented Languages

DOI10.1007/978-3-642-25032-3_3zbMath1349.68047OpenAlexW185513335MaRDI QIDQ3098051

Arnd Poetzsch-Heffter, Unnamed Author

Publication date: 11 November 2011

Published in: Formal Methods, Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25032-3_3

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (1)

Full Abstraction at Package Boundaries of Object-Oriented Languages

Uses Software

• Java Jr

Cites Work

• Unnamed Item
• Unnamed Item
• Refactoring and representation independence for class hierarchies
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• A syntactic approach to type soundness
• Full Abstraction at Package Boundaries of Object-Oriented Languages
• Ownership confinement ensures representation independence for object-oriented programs
• A bisimulation for type abstraction and recursion
• Refinement Calculus
• Verification: Theory and Practice
• Programming Languages and Systems
• Small bisimulations for reasoning about higher-order imperative programs
• Theoretical Aspects of Computing - ICTAC 2004
• Programming Languages and Systems
• A bisimulation for dynamic sealing

This page was built for publication: Full Abstraction at Package Boundaries of Object-Oriented Languages