Swinging data types: Syntax, semantics, and theory

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

Volumn 1130, Issue , 1996, Pages 410-435

  Padawitz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; LOGIC PROGRAMMING; SEMANTICS; SPECIFICATIONS;

CANONICAL MODELING; HIERARCHICAL APPROACH; INDUCTION PRINCIPLES; INDUCTIVE THEOREM PROVING; INITIAL STRUCTURES; PARTIAL FUNCTIONS; STRUCTURAL EQUALITY; SWINGING DATA TYPES;

ABSTRACT DATA TYPES;

EID: 84958600974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61629-2_56     Document Type: Conference Paper

References (54)

1. S. Abramsky, C.-H. Luke Ong, Full Abstraction in the Lazy ƛ-Calculus, Information and Computation 105 (1993) 159-267
2. K.R. Apt, Logic Programming, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 493-574
3. J.CM. Baeten, W.P. Weijland, Process Algebra Cambridge University Press 1990
4. M. Barr, Terminal Coalgebras in Well-founded Set Theory, Theoretical Computer Science 114 (1993) 299-315
5. J.A. Bergstra, J.V. Tucker, Top-down Design and the Algebra of Communicating Processes, Science of Computer Programming 5 (1985) 171-199
6. M. Bidoit, R. Hennicker, Behavioural Theories and the Proof of Behavioural Properties, Report LIENS-95-5, DMI, LIENS Paris 1995
7. M. Bidoit, R. Hennicker, M. Wirsing, Behavioural and Abstractor Specifications, Science of Computer Programming 25 (1995) 149-186
8. R. Bird, Ph. Wadler, Introduction to Functional Programming, Prentice Hall 1988
9. S.L. Bloom, Varieties of Ordered Algebras, J. Computer and System Sciences 13 (1976) 200-212
10. Y. Chen, M.J. O'Donnell, Infinite Terms and Infinite Rewritings, Proc. CTRS '90, Springer LNCS 516 (1990) 115-126
11. R. Cockett, T. Fukushima, About Charity, Report, University of Calgary 1992
12. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer 1985
13. H. Ehrig, F. Parisi-Presicce, P. Boehm, C. Riekhoff, C. Dimitrovici, M. Grosse-Rhode, Combining Data Type and Recursive Process Specifications Using Projection Algebras, Theoretical Computer Science 71 (1990) 347-380
14. V. Giarratana, F. Gimona, U. Montanari, Observability Concepts in Abstract Data Type Specifications, Proc. MFCS '76, Springer LNCS 45 (1976) 576-587
15. J.A. Goguen, R. Diaconescu, Towards an Algebraic Semantics for the Object Paradigm, Proc. 9th ADT Workshop, Springer LNCS 785 (1994) 1-29
16. J.A. Goguen, J. Meseguer, Eqlog: Equality, Types, and Generic Modules for Logic Programming, in: D. DeGroot, G. Lindstrom, Logic Programming: Functions, Relations, and Equations, Prentice-Hall (1986) 295-363
17. 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
18. J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright, Initial Algebra Semantics and Continuous Algebras, J. ACM 24 (1977) 68-95
19. A.D. Gordon, A Tutorial on Co-induction and Functional Programming, Proc. Functional Programming Glasgow 1994, Springer (1995) 78-95
20. J.V. Guttag, J.J. Horning, Larch: Languages and Tools for Formal Specification, Springer 1993
21. T. Hagino, Codatatypes in ML, J. Symbolic Computation 8 (1989) 629-650
22. R. Hennicker, Context Induction: A Proof Principle for Behavioural Abstractions, Formal Aspects of Computing (1991) 326-345
23. S. Holldobler, Foundations of Equational Logic Programming, Springer (1989)
24. J. Jaffar, J.-L. Lassez, M.J. Maher, A Theory of Complete Logic Programs with Equality, J. Logic Programming 3 (1984) 211-223
25. J. Jaffar, J.-L. Lassez, Constraint Logic Programming, Proc. POPL '87 (1987) 111-119
26. J.-P. Jouannaud, H. Kirchner, Completion of a Set of Rules Modulo a Set of Equations, SIAM J. Computing 15 (1986) 1155-1194
27. S. Kamin, Final Data Type Specifications: A New Data Type Specification Method, ACM TOPLAS 5 (1983) 97-123
28. J.-L. Lassez, V.L. Nguyen, E.A. Sonenberg, Fixed Point Theorems and Semantics: A Folk Tale, Information Processing Letters 14 (1982) 112-116
29. D.J. Lehmann, M.B. Smyth, Algebraic Specification of Data Types: A Synthetic Approach, Mathematical Systems Theory 14 (1981) 97-139
30. M.R. Levy, T.S.E. Maibaum, Continuous Data Types, SIAM J. Computing 11 (1982) 201-216
31. J. Loeckx, K. Sieber, The Foundations of Program Verification, 2nd ed., Teubner 1987
32. Z. Manna, Mathematical Theory of Computation, McGraw-Hill 1974
33. J. Meseguer, J.A. Goguen, Initiality, Induction and Computability, in: M. Nivat, J. Reynolds, eds., Algebraic Methods in Semantics, Cambridge University Press (1985) 459-541
34. R. Milner, Communication and Concurrency, Prentice-Hall (1989)
35. B. Moller, On the Algebraic Specification of Infinite Objects: Ordered and Continuous Models of Algebraic Types, Acta Informatica 22 (1984) 537-578
36. J.H. Morris, Another Recursion Induction Principle, Communications ACM 14 (1971) 351-354
37. P. Nivela, F. Orejas, Initial Behaviour Semantics for Algebraic Specifications, Proc. 5th ADT Workshop, Springer LNCS 332 (1988) 184-207
38. M. Nivat, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Mathematica 15 (1975) 255-281
39. P. Padawitz, Equational Data Type Specifications and Recursive Program Schemes, Proc. Formal Description of Programming Concepts II, North-Holland (1983) 305-328
40. P. Padawitz, Computing in Horn Clause Theories, Springer 1988
41. P. Padawitz, Deduction and Declarative Programming, Cambridge University Press 1992
42. P. Padawitz, Expander: A System for Testing and Verifying Functional-Logic Programs, Report No. 522/1994, FB Informatik, Universitat Dortmund 1994
43. P. Padawitz, Inductive Theorem Proving for Design Specifications, Report No. 533/1994, FB Informatik, Universitat Dortmund 1994, to appear in J. Symbolic Computation
44. P. Padawitz, Swinging Data Types: The Dielectic between Actions and Constructors, Report FB Informatik, Universitat Dortmund 1995, available from http://ls5-www.informatik.uni-dortmund.de/user/peter
45. H. Reichel, An Approach to Object Semantics based on Terminal Coalgebras, Report, Fakultat Informatik, TU Dresden 1994
46. R. Reiter, On Closed World Data Bases, Proc. Logic and Data Bases, Plenum Press (1978)
47. J. Rutten, A Structural Coinduction Theorem, Proc. MFPS '93, Springer LNCS 802 (1993) 83-102
48. D. Sannella, A. Tarlecki, On Observational Equivalence and Algebraic Specification, J. Computer and System Sciences 34 (1987) 150-178
49. D. Scott, Outline of a Mathematical Theory of Computation, Proc. Information Sciences and Systems, Princeton (1970) 169-176
50. M. Stickel, Automated Deduction by Theory Resolution, J. Automated Reasoning 1 (1985) 333-356
51. A. Tarlecki, M. Wirsing, Continuous Abstract Data Types, Fundamenta Infor-maticae 9 (1986) 95-126
52. M. Wand, Final Algebra Semantics and Data Type Extensions, J. Computer and System Sciences 19 (1979) 27-44
53. M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy, On Hierarchies of Abstract Data Types, Acta Informatica 20 (1983) 1-33
54. M. Wirsing, Algebraic Specification, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 675-788