A semi-algorithm for algebraic implementation proofs
- 5 October 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 104 (1) , 53-87
- https://doi.org/10.1016/0304-3975(92)90166-d
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Context induction: A proof principle for behavioural abstractions and algebraic implementationsFormal Aspects of Computing, 1991
- Observational implementation of algebraic specificationsActa Informatica, 1991
- On the algebraic definition of programming languagesACM Transactions on Programming Languages and Systems, 1987
- Algebraic implementations preserve program correctnessScience of Computer Programming, 1986
- Algebraic implementation of abstract data typesTheoretical Computer Science, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969