Swinging types = functions + relations + transition systems

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 93-165

  Padawitz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002544014     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00171-7     Document Type: Article

References (77)

1. Abstract State Machines (aka Gurevich Machines or Evolving Algebras). http://www.eecs.umich.edu/gasm.
2. 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, Los Altos, CA, 1988, pp. 89-148.
3. M.A. Arbib, E.G. Manes, Parametrized data types do not need highly constrained parameters, Inform. and Control 52 (1982) 139-158.
4. E. Astesiano, M. Broy, G. Reggio, Algebraic specification of concurrent systems, in: E. Astesiano, H.-J. Kreowski, B. Krieg-Brückner (Eds.), Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Report, Springer, Berlin, 1999.
5. E. Astesiano, A. Giovini, G. Reggio, Observational structures and their logic, Theoret. Comput. Sci. 96 (1992) 249-283.
6. E. Astesiano, H.-J. Kreowski, B. Krieg-Brückner (Eds.), Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Report, Springer, Berlin, 1999.
7. E. Astesiano, G. Reggio, Algebraic specification of concurrency, Proc. WADT'91, Lecture Notes in Computer Science, vol. 655, Springer, Berlin, 1993, pp. 1-39.
8. E. Astesiano, M. Wirsing, Bisimulation in algebraic specifications, in: H. Ait-Kaci, M. Nivat (Eds.), Resolution of Equations in Algebraic Structures, vol. 1, Academic Press, New York, 1989, pp. 1-31.
9. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990.
10. D.W. Barnes, J.M. Mack, Algebraic Introduction to Mathematical Logic, Springer, Berlin, 1975.
11. J. Barwise, L. Moss, Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, CSLI Publications, Stanford, 1996.
12. J.L. Bell, A.B. Slomson, Models and Ultraproducts: An Introduction, North-Holland, Amsterdam, 1969.
13. J. van Benthem, Exploring Logical Dynamics, CSLI Publications, Stanford, 1996.
14. J. van Benthem, J. Bergstra, Logic of transition systems, J. Logic Language Inform. 3 (1995) 247-283.
15. M. Bidoit, R. Hennicker, Proving the Correctness of Behavioural Implementations, Proc. AMAST '95, Lecture Notes in Computer Science, vol. 936, Springer, Berlin, 1995, pp. 152-168.
16. M. Bidoit, R. Hennicker, M. Wirsing, Behavioural and abstractor specifications, Sci. Comput. Programming 25 (1995) 149-186.
17. M. Bidoit, R. Hennicker, Observer complete definitions are behaviourally coherent, Report, University of Munich, 1999.
18. M. Broy, M. Wirsing, Partial abstract types, Acta inform. 18 (1982) 47-64.
19. The CoFI Task Group on Language Design, CASL: The Common Algebraic Specification Language, 1998, http://www.brics.dk/Projects/CoFI/ Documents/CASL/Summary.
20. A. Corradini, R. Heckel, U. Montanari, From SOS specifications to structured coalgebras: how to make a bisimulation a congruence, Proc. CMCS '99, ENTCS, vol. 19, Elsevier, Amsterdam, 1999.
21. G. Costa, G. Reggio, Specification of abstract dynamic data types: a temporal logic approach, Theoret. Comput. Sci. 173 (1997) 513-554.
22. R. Diaconescu, K. Futatsugi, CafeOBJ Report, AMAST Series in Computing, vol. 6, World Scientific, Singapore, 1998.
23. H. Ehrig, H.-J. Kreowski, B. Mahr, P. Padawitz, Algebraic implementation of abstract data types, Theoret. Comput. Sci. 20 (1982) 209-263.
24. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer, Berlin, 1985.
25. H. Ehrig, F. Orejas, Dynamic abstract data types: an informal proposal, EATCS Bull. 53 (1994) 162-169.
26. P.C. Eklof, Ultraproducts for algebraists, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 105-137.
27. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 995-1072.
28. V. Giarratana, F. Gimona, U. Montanari, Observability concepts in abstract data type specifications, Proc. MFCS '76, Lecture Notes in Computer Science, vol. 45, Springer, Berlin, 1976, pp. 576-587.
29. J.A. Goguen, Stretching first order equational logic: proofs with partiality, subtypes and retracts, UCSD Report, San Diego 1997, www-cse.ucsd.edu/users/goguen/ps/ftp97.ps.gz.
30. J.A. Goguen, R. Diaconescu, Towards an algebraic semantics for the object paradigm, Proc. 9th ADT Workshop, Lecture Notes in Computer Science, vol. 785, Springer, Berlin, 1994, pp. 1-29.
31. J.A. Goguen, R. Diaconescu, An Oxford survey of order sorted algebra, Math. Struct. Comput. Sci. 4 (1994) 363-392.
32. J.A. Goguen, G. Malcolm, A hidden agenda, UCSD Tech. Rep. CS97-538, San Diego, 1997.
33. J.A. Goguen, G. Malcolm, Hidden coinduction: behavioral correctness proofs for objects, Math. Struct. Comput. Sci., to appear.
34. 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, Cambridge, MA, 1987, pp. 417-477.
35. 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, vol. 4, Prentice-Hall, Englewood Cliffs, NJ, 1978, pp. 80-149.
36. A.D. Gordon, A tutorial on co-induction and functional programming, Proc. Functional Programming Glasgow 1994, Springer, Berlin, 1995, pp. 78-95.
37. J.F. Groote, F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (1992) 202-260.
38. J. Guttag, E. Horowitz, D.R. Musser, Abstract data types and software validation, Report ISI/RR-76-48, University of Southern California, 1976.
39. T. Hagino, Codatatypes in ML, J. Symbolic Comput. (1989) 629-650.
40. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137-161.
41. R. Hennicker, M. Bidoit, Observational Logic, Proc. AMAST '98, Lecture Notes in Computer Science, vol. 1548, Springer, Berlin, 1998, pp. 263-277.
42. C.A.R. Hoare, Proof of correctness of data representations, Acta Inform. 1 (1972) 271-281.
43. B. Jacobs, Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs, Proc. TAPSOFT '97, Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, 1997, pp. 787-802.
44. B. Jacobs, J. Rutten, A tutorial on (Co)algebras and (Co)induction, EATCS Bull. 62 (1997) 222-259.
45. J.-P. Jouannaud, H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. Comput. 15 (1986) 1155-1194.
46. S. Kamin, Final data type specifications: a new data type specification method, ACM TOPLAS 5 (1983) 97-123.
47. U. Kühler, C.-P. Wirth, Conditional equational specifications of data types with partial operations for inductive theorem proving, Proc. RTA '97, Lecture Notes in Computer Science, vol. 1232, Springer, Berlin, 1997, pp. 38-52.
48. K.G. Larsen, Proof systems for Hennessy-Milner logic with recursion, Proc. CAAP '88, Lecture Notes in Computer Science, vol. 299, Springer, Berlin, 1988, pp. 215-230.
49. J.-L. Lassez, V.L. Nguyen, E.A. Sonenberg, Fixed point theorems and semantics: a folk tale, Inform. Process. Lett. 14 (1982) 112-116.
50. G. Malcolm, J.A. Goguen, Proving correctness of refinement and implementation, Technical Monograph PRG-114, Oxford University Computing Lab, 1994.
51. J. Meseguer, Membership algebra as a logical framework for equational specification, Proc. WADT '97, Lecture Notes in Computer Science, vol. 1376, Springer, Berlin, 1998, pp. 18-61.
52. J. Meseguer, J.A. Goguen, Initiality, induction and computability, in: M. Nivat, J. Reynolds (Eds.), Algebraic Methods in Semantics, Cambridge University Press, Cambridge, 1985, pp. 459-541.
53. B. Möller, A. Tarlecki, M. Wirsing, Algebraic specifications of reachable higher-order algebras, Proc. 5th ADT Workshop, Lecture Notes in Computer Science, vol. 332, Springer, Berlin, 1988, pp. 154-169.
54. E. Moggi, Notions of computation and monads, Inform, and Comput. 93 (1991) 55-92.
55. H.-J. Ohlbach, Semantic-based translation methods for modal logics, J. Logic Comput. 1 (1991) 691-746.
56. P. Padawitz, Computing in Horn Clause Theories, Springer, Berlin, 1988.
57. P. Padawitz, Deduction and Declarative Programming, Cambridge University Press, Cambridge, 1992.
58. P. Padawitz, Swinging data types: syntax, semantics, and theory, Proc. WADT '95, Lecture Notes in Computer Science, vol. 1130, Springer, Berlin, 1996, pp. 409-435.
59. P. Padawitz, Inductive theorem proving for design specifications, J. Symbolic Comput. 21 (1996) 41-99.
60. P. Padawitz, Towards the one-tiered design of data types and transition systems, Proc. WADT '97, Lecture Notes in Computer Science, vol. 1376, Springer, Berlin, 1998, pp. 365-380.
61. P. Padawitz, Sample swinging types, Report, University of Dortmund, 1998, http://ls5.cs.unidortmund.de/~peter/BehExa.ps.gz
62. P. Padawitz, Theorie der Programmierung, Course Notes, University of Dortmund, 1998, http://ls5.cs.unidortmund.de/~peter/TdP96.ps.gz
63. P. Padawitz, Proof in flat specifications, in: E. Astesiano, H.-J. Kreowski, B. Krieg-Brückner (Eds.), Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Report, Springer, Berlin, 1999.
64. P. Padawitz, Modular swinging types, Report, University of Dortmund, 1999, http://ls5.cs.unidortmund.de/~peter/MST.ps.gz
65. D. Park, Fixpoint induction and proofs of program properties, in: B. Meltzer, D. Michie (Eds.), Machine Intelligence, vol. 5, Elsevier, Amsterdam, 1969, pp. 59-78.
66. G.D. Plotkin, Building-in equational theories, in: B. Meltzer, D. Michie (Eds.), Machine Intelligence, vol. 7, Elsevier, Amsterdam, 1972, pp. 73-90.
67. G.D. Plotkin, An operational semantics for CSP, in: D. Bjørner (Ed.), Proc. IFIP TC-2 Working Conf. Formal Description of Programming Concepts II, North-Holland, Amsterdam, 1983, pp. 199-225.
68. H. Reichel, An approach to object semantics based on terminal coalgebras, Math. Struct. Comput. Sci. 5 (1995) 129-152.
69. G. Roşu, J. Goguen, Hidden congruent deduction, Proc. First-Order Theorem Proving - FTP'98, Vienna, 1998, pp. 213-223.
70. J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Report CS-R9652, CWI, SMC Amsterdam, 1996.
71. D. Sannella, A. Tarlecki, Toward formal development of programs from algebraic specifications: implementations revisited, Acta Inform. 25 (1988) 233-281.
72. M. Stickel, Automated deduction by theory resolution, J. Automat. Reason. 1 (1985) 333-356.
73. C. Stirling, Modal and temporal logics, in: S. Abramsky, et al., (Eds.), Handbook of Logic in Computer Science, Clarendon Press, Oxford, 1992, pp. 477-563.
74. C. Stirling, The joys of bisimulation, Proc. MFCS '98, Lecture Notes in Computer Science, vol. 1450, Springer, Berlin, 1998, pp. 142-151.
75. M. Wand, Final algebra semantics and data type extensions, J. Comput. System Sci. 19 (1979) 27-44.
76. M. Wand, Specifications, models, and implementations of data abstractions, Theoret. Comput. Sci. 20 (1982) 3-32.
77. M. Wirsing, Algebraic specification, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 675-788.