On the Power of Higher-Order Algebraic Specification Methods

Information and Computation

Volumn 124, Issue 1, 1996, Pages 85-101

  Kosiuczenko, P ^a   Meinke, K ^b  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007012798     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0007     Document Type: Article

References (20)

1. Bergstra, J. A., and Tucker, J. V. (1982), The completeness of the algebraic specification methods for computable data types, Inform. and Control 54, 186-200.
2. Bergstra, J. A., and Tucker, J. V. (1983), Initial and final algebra semantics for data type specifications: Two characterisation theorems, SIAM J. Comput. 12, 366-387.
3. Bergstra, J. A., and Tucker, J. V. (1987), Algebraic specifications of computable and semicomputable data types, Theoret. Comput. Sci. 50, 137-181.
4. Ehrig, H., and Mahr, B. (1985), "Fundamentals of Algebraic Specification. I. Equations and Initial Semantics," Springer-Verlag, Berlin/ Heidelberg/New York.
5. Goguen, J. A., and Meseguer, J. (1982), Completeness of many-sorted equational logic, in "Association for Computing Machinery SIGPLAN Notices," Vol. 17, pp. 9-17.
6. Goguen, J. A., and Meseguer, J. (1985), Initiality, induction and computability, in "Algebraic Methods in Semantics" (M. Nivat and J. C. Reynolds, Eds.), pp. 459-541, Cambridge Univ. Press.
7. Goguen, J. A., Thatcher, J. W., Wagner, E. G., and Wright, J. B. (1975), Abstract data types as initial algebras and the correctness of data representations, in "Proceedings, Conference on Computer Graphics, Pattern Recognition, and Data Structures," pp. 89-93.
8. Heering, J., Meinke, K., Möller, B., and Nipkow, T., Eds. (1994), "HOA '93: An International Workshop on Higher-Order Algebra, Logic and Term Rewriting," Lecture Notes in Computer Science, Vol. 816, Springer-Verlag, Berlin/Heidelberg/New York.
9. Hinman, P. G. (1978), "Recursion-Theoretic Hierarchies," Springer-Verlag, Berlin/Heidelberg/New York.
10. Malcev, A. I. (1961), Constructive algebras, Russ. Math. Surv. 16, 77-129.
11. Meinke, K. (1992), Universal algebra in higher types, Theoret. Comput. Sci. 100, 385-417.
12. Meinke, K. (1993), Subdirect representation of higher-order algebras, in "Many-Sorted Logic and Its Applications" (K. Meinke and J. V. Tucker, Eds.), Wiley, Chichester.
13. Meinke, K. (1994), A recursive second-order initial algebra specification of primitive recursion, Acta Informat. 31, 329-340.
14. Meinke, K. (1995), "Proof Theory of Higher-Order Equational Logic: Normal Forms, Continuity and Term Rewriting," Technical Report, Department of Computer Science, University College of Swansea, to appear.
15. Meinke, K., and Tucker, J. V. (1993), Universal algebra, in "Handbook of Logic in Computer Science" (S. Abramsky, D. Gabbay, and T. S. E. Maibaum, Eds.), pp. 189-411, Oxford Univ. Press, Oxford.
16. Möller, B. (1987), "Higher-Order Algebraic Specifications," Habilitationsschrift, Fakultät für Mathematik und Informatik, Technische Universität München.
17. Rabin, M. O. (1960), Computable algebra, general theory and the theory of computable fields, Trans. Amer. Math. Soc. 98, 341-360.
18. Rogers, H. (1987), "Theory of Recursive Functions and Effective Computability," Cambridge, MA.
19. Wand, M. (1981), Final algebra semantics and data type extension, J. Comput. System Sci. 19, 27-44.
20. Wirsing, M. (1990), Algebraic specification, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), pp. 675-788, North-Holland, Amsterdam.