Towards the one-tiered design of data types and transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1376, Issue , 1998, Pages 365-380

  Padawitz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957885304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64299-4_45     Document Type: Conference Paper

References (35)

1. M.A.. Arbib, E.G. Manes, Parametrized Data Types Do Not Need Highly Constrained Parameters, Information and Control 52 (1982) 139-158
2. K.R. Apt, Logic Programming, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 493-574
3. K.R. Apt, H.A. Blair, A. Walker, Towards a Theory of Declarative Knowledge, in: J. Minker, ed., Deductive Databases and Logic Programming, Morgan Kaufmann (1988) 89-148
4. E. Astesiano, M. Wirsing, Bisimulation in Algebraic Specifications, in: H. Ait-Kaci, M. Nivat, eds., Resolution of Equations in Algebraic Structures 1, Academic Press (1989) 1-31
5. M. Bidoit, R. Hennicker, M. Wirsing, Behavioural and Abstractor Specifications, Science of Computer Programming 25 (1995) 149-186
6. M. Broy, M. Wirsing, Partial Abstract Types, Acta Informatica 18 (1982) 47-64
7. G. Costa, G. Reggio, Specification of Abstract Dynamic Data Types: A Temporal Logic Approach, Theoretical Computer Science 173 (1997) 513-554
8. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer 1985
9. H. Ehrig, F. Orejas, Dynamic Abstract Data Types: An Informal Proposal, EATCS Bulletin 53 (June 1994) 162-169
10. V. Giarratana, F. Gimona, U. Montanari, Observability Concepts in Abstract Data 76 Type Specifications, Proc. MFCS ’76, Springer LNCS 45 (1976) 576-587
11. J.A. Goguen, R. Diaconescu, Towards an Algebraic Semantics for the Object Paradigm, Proc. 9th ADT Workshop, Springer LNCS 785 (1994) 1-29
12. J.A. Goguen, J. Meseguer, Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics, in: B. Shriver, P. Wegner, eds., Research Directions in Object-Oriented Programming, MIT Press (1987) 417-477
13. J.A. Goguen, G. Malcolm, A Hidden Agenda, UCSD Technical Report CS97-538, 1997, http:/ /www-cse.ucsd.edu/users/goguen/ps/ha.ps.gz
14. J.A. Goguen, J.W. Thatcher, E.G. Wagner, An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, in: R. Yeh, ed., Current Trends in Programming Methodology 4, Prentice-Hall (1978) 80-149
15. A.D. Gordon, A Tutorial on Co-induction and Functional Programming, Proc. Functional Programming Glasgow 1994, Springer (1995) 78-95
16. J.F. Groote, F. Vaandrager, Structured Operational Semantics and Bisimulation as a Congruence, Information and Computation 100 (1992) 202-260
17. R. Hennicker, Context Induction: A Proof Principle for Behavioural Abstractionss Formal Aspects of Computing (1991) 326-345
18. B. Jacobs, J. Rutten, A Tutorial on (Co)Algebras and (Co)Induction, EATCS Bulletin 62 (June 1997) 222-259
19. J.-P. Jouannaud, H. Kirchner, Completion of a Set of Rules Modulo a Set of Equations, SIAM J. Computing 15 (1986) 1155-1194
20. S. Kamin, Final Data Type Specifications: A New Data Type Specification Method, ACM TOPLAS 5 (1983) 97-123
21. K.G. Larsen, Proof Systems for Hennessy-Milner Logic with Recursion, Proc. CAAP’88, Springer LNCS 299 (1988) 215-230
22. B. Möller, A. Tarlecki, M. Wirsing, Algebraic Specifications of Reachable Higher- Order Algebras, Proc. 5th ADT Workshop, Springer LNCS 332 (1988) 154-169
23. P. Padawitz, Computing in Horn Clause Theories, Springer 1988
24. P. Padawitz, Deduction and Declarative Programming, Cambridge University Press 1992
25. P. Padawitz, Swinging Data Types: Syntax, Semantics, and Theory, Proc. WADT’95, Springer LNCS 1130 (1996) 409-435
26. P. Padawitz, Proof in Flat Specifications, In: E. Astesiano, H.-J. Kreowski, B. Krieg-Brfickner, eds., IFIP WG 1.3 State-of-the-Art Report, Algebraic Foundations of System Specification, Springer, to appear, http://ls5.cs.uni-dort mund.de/~peter/Deduct.ps.gz
27. P. Padawitz, Towards the One-Tiered Design of Data Types and Transition Systems, full version of this paper, FB Informatik, University of Dortmund 1997, http://ls5.cs.uni-dortmund.de/~peter/Rome.ps.gz
28. G.D. Plotkin, Building-in Equational Theories, In: B. Meltzer, D. Michie, eds., Machine Intelligence 7, Elsevier (1972) 73-90
29. G.D. Plotkin, An Operational Semantics for CSP, in: D. Bjgi-ner, ed., Proc. IFIP TC-2 Working Conf. Formal Description of Programming Concepts II, North- Holland (1983) 199-225
30. H. Reichel, An Approach to Object Semantics based on Terminal Coalgebras, Math. Structures in Comp. Sci. 5 (1995) 129-152
31. J.J.M.M. Rutten, Universal Coalgebra: A Theory of Systems, Report CS-R9652, CWI, SMC Amsterdam 1996
32. M. Stickel, Automated Deduction by Theory Resolution, J. Automated Reasoning 1 (1985) 333-356
33. C. Stirling, Modal and Temporal Logics, in: S. Abramsky et al., eds., Handbook of Logic in Computer Science, Clarendon Press (1992) 477-563
34. M. Wand, Final Algebra Semantics and Data Type Extensions, 3. Computer and System Sciences 19 (1979) 27-44
35. M. Wirsing, Algebraic Specification, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 675-788