A Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 17, Issue 2, 1995, Pages 366-393

  Walicki, Michal ^a   Meldal, Sigurd ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Algebraic specifications; reasoning with nondeterminism

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

ALGEBRAIC SPECIFICATIONS; FUNCTIONAL SEMANTICS; NONDETERMINISM; NONDETERMINISTIC LANGUAGES; NONPROCEDURAL LANGUAGES;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 0029275563     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/201059.201070     Document Type: Article

References (48)

1. Aceto L., Denicola R., And Fantechi A. 1986. Testing Equivalencies For Event Structures. In Mathematical Models For The Semantics Of Parallelism. Lecture Notes In Computer Science, Vol. 280. Springer, Berlin.
2. Bauer F. 1985. The Munich Project Cip: The Wide Spectrum Language. Lecture Notes in Computer Science, vol. 183. Springer-Verlag, Berlin.Bergtra J. A. And Klop J. W. 1989. Process theory based on bisimulation semantics. In Proceedings of the REX School /Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer-Verlag, Berlin, 50–122.
3. Birkhoff G. 1935. On the structure of abstract algebras. Proc. Cambridge Philos. Soc. 31, 433–454.
4. Chang C. C. And Keisler H. J. 1977. Model Theory. North-Holland, Amsterdam. Dershowitz N. And Jouannaud J. P. 1990. Rewriting systems. In Handbook of Theoretical
5. Computer Science. Vol. B. The MIT Press, Cambridge, Mass. Dijkstra E. W. 1976. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J. Ehrig H. And Mahr B. 1985. Fundamentals of Algebraic Specification. Vol. 1. Springer, Berlin.
6. Goguen J. A. 1988. What is unification? A categorical view of substitution, equation, and solution. Tech. Rep. CSLI-88-124, Center for Study of Languages and Information, Stanford Univ. Stanford. Calif. Goguen J. A. And Meseguer J. 1987. Remarks on remarks on many-sorted equational logic. SIGPLAN Not. 22, 4 (Apr.), 41–48.
7. Goguen, J. A. And Meseguer J. 1982. Universial realization, persistent interconnection and implementation of abstract modules. In Proceedings of the 9th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 140. Springer, Berlin.
8. Goguen J. A. And Meseguer J. 1981. Completeness of many-sorted equational logic. SIG-PLAN Not. 16, 7.
9. Hennessy M. 1988. Observing processes. In Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science, vol. 354. Springer, Berlin.
10. Hennessy M. And Milner R. 1980. On observing nondeterminism and concurrency. In Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 85. Springer, Berlin.
11. Hesselink W. H. 1988. A mathematical approach to nondeterminism in data types. ACM Trans. Program. Lang. Syst. 10.
12. Hoare C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall International, Englewood, Cliffs, N.J.
13. Hoare C. A. R. And Wirth N. 1973. An axiomatic definition of the programming language PASCAL. Acta Informatica 2, 335–355.
14. Hoare C. A. R. And Wirth N. 1993. An axiomatic definition of the programming language PASCAL. Acta Informatica 2, 335–355.
15. Hussmann H. 1993. Nondeterminism in Algebraic Specifications and Algebraic Programs. Birkhauser.Hussmann H. 1990. Nondeterministic algebraic specifications. Ph.D. thesis, Fakultat fur Mathematik und Informatik, Universitat Passau.
16. Hussmann H. 1988. Nondeterministic algebraic specifications and nonconfluent term rewriting. In Algebraic and Logic Programming. Lecture Notes in Computer Science, vol. 343. Springer, Berlin.
17. Hussmann H. 1985. Rapid prototyping for algebraic specifications-RAP system user's manual. Tech. Rep. MIP-8504, Universitat Passau.
18. Huet G. And Oppen D. 1980. Equations and rewrite rules: A survey. In Formal Language Theory: Perspectives and Open Problems. Academic Press, New York.
19. Hupbach U. L. And Reichel H. 1983. On behavioural equivalence of data types. EIK J. Inf. Process. Cybernet. 19, 6, 297–305.
20. The semantics of a simple language for parallel programming. In North-Holland, Amsterdam. G. Kahn Hupbach U. L. And Reichel H. 1974. On behavioural equivalence of data types. EIK J. Inf. Process. Cybernet. 19, 6, 297–305.
21. Kahn G. 1974. The semantics of a simple language for parallel programming. In Proceedings of IFIP 1974. North-Holland, Amsterdam.Kaplan S. 1988. Rewriting with a nondeterministic choice operator. Theor. Comput. Sci. 56, 37–57.
22. Kaplan S. 1987. Conditional rewriting. In Conditional Term Rewriting Systems. Lecture Notes in Computer Science, vol. 308. Springer, Berlin.
23. Kapur, D. 1980. Towards a theory of abstract data types. Ph.D. thesis, Laboratory for Computer Science, MIT, Cambridge, Mass.
24. Kriauciukas V. And Walicki M. 1994. Reasoning and rewriting with set-relations I: Ground case. In Proceedings ofCSL '94. Lecture Notes in Computer Science, vol. 933. Springer-Verlag, Berlin. Also, Tech. Rep. 92, Dept. of Informatics, Univ. of Bergen.
25. Lyndon R. C. 1959. Properties preserved under homomorphism. Pac. J. Math. 9. Maibaum T. S. E. 1977. The semantics of nondeterminism. Tech. Rep. CS-77-30, Univ. of Waterloo, Ontario, Canada.
26. Meldal, S. 1989. An abstract axiomatization of pointer types. In Proceedings of the 22nd Annual Hawaii International Conference on System Sciences. IEEE Computer Society Press, Los Alamitos, Calif.
27. Meldal S. 1987. Allocations of objects considered as nondeterministic expressions. Tech. Rep. CSL-TR-87-335, CSL Stanford Univ., Stanford, Calif.
28. Meseguer J. 1992. Conditional rewriting logic as a unified model of concurrency. Lecture Notes in Computer Science, Springer-Verlag, New York. TCS 96, 73–155.
29. Milner R. 1980. Calculi for Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer, Berlin.
30. Mosses P. D. 1989. Unified algebras and institutions. In Proceedings of ‘LICS’89, 4th Annual Symposium on Logic in Computer Science.
31. Mosses P. D. 1989b. Unified algebras and action semantics. In ‘STACS’ 89. Lecture Notes in Computer Science, vol. 349. Springer-Verlag, New York.
32. Nipkow T. 1987. Observing nondeterministic data types. In Recent Trends in Data Type Specification. Lecture Notes in Computer Science, vol. 332. Springer-Verlag, New York. Nipkow T. 1986. Non-deterministic data types: Models and implementations. Acta Informatica 22, 629–661.
33. O'Donnell M. 1977. Computing Systems Described by Equations. Lecture Notes in Computer Science, vol. 58, Springer, Berlin.
34. Picket, H. E. 1967. Homomorphisms and subalgebras of multialgebras. Pac. J. Math. 21, 327–342.
35. Qian X. And Goldberg A. 1993. Referential opacity in nondeterministic data refinement. ACM Lett. Program. Lang. Syst. 2, 1–4, 233–241.
36. Sannella D. And Tarlecki A. 1985. On observational equivalence and algebraic specification. In Proceedings of the Joint Conference on Theory and Practice of Software Development, TAPSOFT. Lecture Notes in Computer Science, vol. 185. Springer, Berlin.
37. Subrahmanyam P. A. 1981. Nondeterminism in abstract data types. In Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 115. Springer, Berlin.
38. Volger H. 1989a. The semantics of disjunctive deductive databases. In ‘CSL’ 89. Lecture Notes in Computer Science, vol. 440. Springer-Verlag, New York.
39. Volger H. 1989. The semantics of disjunctive deductive databases. Tech. Rep. MIP-8931, Fakultat fur Mathematik und Inforrnatik Universitat Passau.
40. Walicki M. 1994. Singular and plural nondeterministic parameters: Multialgebras, power algebras and complete reasoning systems. Tech. Rep. 96, Institutt for Informatikk, Universitetet i Bergen.
41. Walicki M. 1993. Algebraic specifications of nondeterminism. Ph.D. thesis, Dept, of Informatics, Univ. of Bergen.
42. Walicki M. 1992. Calculii for nondeterministic specifications: Three completeness results. Tech. Rep. 75, Institutt for Informatikk, Universitetet i Bergen.
43. Walicki M. And Meldal S. 1994. Multialgebras, power algebras and complete calculi of identities and inclusions. In Recent Trends in Data Type Specifications. Lecture Notes in Computer Science, vol. 906, Springer-Verlag, New York.
44. Walicki M. And Meldal S. 1993. Initiality + nondeterminism = junk. In Proceedings of NIK '93. Tapir, Trondheim, Norway.
45. Winskel G. 1988. An introduction to event structures. In Lecture Notes in Computer Science, vol. 354. Springer-Verlag, New York.
46. Wirsing M. 1990. Algebraic specification. In Handbook of Theoretical Computer Science. Vol. B. The MIT Press, Cambridge, Mass.
47. Wirsing M. 1989. Algebraic specification. Tech. Rep. MIP-8914, Universitat Passau.
48. Wolter U. And Lowe M. 1992. Beyond conditional equations. In CAAP '92. Lecture Notes in Computer Science, vol. 581. Springer-Verlag, New York.