Specifications in an arbitrary institution

Information and Computation

Volumn 76, Issue 2-3, 1988, Pages 165-210

  Sannella, Donald ^a   Tarlecki, Andrzej ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY; COMPUTER PROGRAMMING;

ALGEBRAIC SPECIFICATIONS; ARBITRARY INSTITUTION; AXIOMATIC SPECIFICATIONS; SPECIFICATION LANGUAGES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0023963235     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(88)90008-9     Document Type: Article

References (66)

1. A Birkhoff variety theorem for continuous algebras
2. Axioms for abstract model theory
3. Equational partiality
4. On the power of algebraic specifications
5. I/O computable data structures
6. Many-sorted theories and their algebras with some applications to data types
7. Partial abstract types
8. Partial algebras—Survey of a unifying approach towards a two-valued model theory for partial algebras
9. The semantics of Clear, a specification language
10. An informal introduction to specifications using Clear
11. Programming language constructs for which it is impossible to obtain good Hoare axiom systems
12. Algebraic implementation of abstract data types
13. Parameterized data types in algebraic specification languages (short version)
14. Algebraic specifications with generating constraints
15. Observability concepts in abstract data type specification
16. Abstract errors for abstract data types
17. Introducing institutions
18. Some fundamental algebraic tools for the semantics of computation. Part 1. Comma categories, colimits, signatures and theories
19. Universal realization, persistent interconnection and implementation of abstract modules
20. An initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types
21. Final data types and their specification
22. CLU Reference Manual
23. Completeness of proof systems for equational specifications
24. Characterizing specification languages which admit initial semantics
25. Why Horn formulas matter in computer science: Initial structures and generic examples
26. A proposal for Standard ML
27. Gedanken-experiments on sequential machines
28. On the correctness of type transformations
29. Behavioural equivalence—A unifying concept for initial and final specification methods
30. Mapping out specification
31. Structured theories in LCF
32. Building specifications in an arbitrary institution
33. Program specification and development in Standard ML
34. On observational equivalence and algebraic specification
35. Proc. 10th Colloq. on Trees in Algebra and Programming, Joint Conf. on Theory and Practice of Software Development (TAPSOFT)
36. Proc. Intl. Conf. on Foundations of Computation Theory
37. Formal specification of a display-oriented text editor
38. Free constructions in algebraic institutions
39. Free constructions in algebraic institutions
40. On the existence of free models in abstract algebraic institutions
41. Quasi-varieties in abstract algebraic institutions
42. Continuous abstract data types
43. Continuous abstract data types—Basic machinery and results
44. Final algebra semantics and data type extensions
45. Structured algebraic specifications
46. Structured Algebraic Specifications: A Kernel Language