A proof system for verifying composability of abstract implementations
- 1 January 1984
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 357-374
- https://doi.org/10.1007/3-540-13346-1_18
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A kernel language for algebraic specification and implementation extended abstractPublished by Springer Nature ,1983
- Characterizing composability of abstract implementationsLecture Notes in Computer Science, 1983
- Algebraic implementation of abstract data typesTheoretical Computer Science, 1982
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data TypesJournal of the ACM, 1982
- Implementation of parameterised specificationsPublished by Springer Nature ,1982
- Universal realization, persistent interconnection and implementation of abstract modulesPublished by Springer Nature ,1982
- Parameter passing commutes with implementation of parameterized data typesPublished by Springer Nature ,1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- On the representation of data typesPublished by Springer Nature ,1981