On observational equivalence and algebraic specification

Journal of Computer and System Sciences

Volumn 34, Issue 2-3, 1987, Pages 150-178

  Sannella, Donald ^a   Tarlecki, Andrzej ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY; MATHEMATICAL TECHNIQUES - ALGEBRA;

ALGEBRAIC SPECIFICATION; BEHAVIORAL EQUIVALENCE; OBSERVATIONAL EQUIVALENCE; OBSERVATIONAL EQUIVALENCE OF ALGEBRAS; UNREACHABLE ALGEBRAS;

COMPUTER PROGRAMMING;

EID: 0022047452     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(87)90023-7     Document Type: Article

References (59)

1. Back and forth through infinitary logic
2. Axioms for abstract model theory
3. Report on a Wide Spectrum Language for Program Specification and Development
4. I/O computable data structures
5. Partial abstract types
6. The semantics of Clear, a specification language
7. Algebras, theories and freeness: An introduction for computer scientists
8. HOPE An experimental applicative language
9. An unsolvable problem of elementary number theory
10. Testing equivalences for processes
11. On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
12. On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
13. An Algebraic Specification Concept for Modules
14. Algebraic implementation of abstract data types
15. Denotational and initial algebra semantics of the algebraic specification language LOOK
16. Algebraic specifications with generating constraints
17. Parameterized specifications parameter passing and implementation
18. Observability concepts in abstract data type specification
19. Algebraic Specifications with Partially Ordered Sorts and Declarations
20. Algebraic and operational semantics of specifications allowing exceptions and errors
21. Abstract errors for abstract data types
22. Order Sorted Algebras: Exceptions and Error Sorts, Coercions and Overloaded Operators
23. CAT, a System for the Structured Elaboration of Correct Programs from Structured Specifications
24. Introducing institutions
25. Completeness of many-sorted equational logic
26. Completeness of many-sorted equational logic
27. Universal realization, persistent interconnection and implementation of abstract modules
28. An Initiality Primer
29. An introduction to OBJ: A language for writing and testing software specifications
30. An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types
31. An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types
32. Initial algebra semantics and continuous algebras
33. Formal specification as a design tool
34. Final data types and their specification
35. CLU Reference Manual
36. An Appraisal of Program Specifications
37. Logical Implementation
38. Abstract semantic algebras
39. On the correctness of type transformations
40. Behavioural Equivalence—a unifying concept for initial and final specification methods
41. Structured theories in LCF
42. Building specifications in an arbitrary institution
43. Program specification and development in Standard ML
44. Proceedings 9th ICALP
45. Proceedings Intl. Conf. on Foundations of Computation Theory
46. A Theory of Program Modules, Their Specification and Implementation (extended abstract)
47. Logic with denumerably long formulas and finite strings of quantifiers
48. On the existence of free models in abstract algebraic institutions
49. Data type specification: Parameterization and the power of specification techniques
50. Final algebra semantics and data type extensions
51. Structured algebraic specifications
52. Structured Algebraic Specifications: A Kernel Language