Higher-order equational logic for specification, simulation and testing

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

Volumn 1074, Issue , 1995, Pages 124-143

  Meinke, Karl ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; SPECIFICATION LANGUAGES; SPECIFICATIONS;

COMPUTATIONAL TRACTABILITY; EQUATIONAL LOGIC; HIGHER ORDER EQUATIONS; HIGHER-ORDER; PROOF THEORY; SIMULATION AND TESTING; SPECIFICATION LANGUAGE DESIGN;

COMPUTATION THEORY;

EID: 84947908841     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (27)

1. Bergstra, J.A., Heering, J., Klint, P.: Algebraic specification, Addison Wesley, New York, 1989
2. Bergstra, J.A., Tucker, J.V.: The completeness of the algebraic specification methods for computable data types, Inform, and Control 54, 186-200 (1982)
3. Bergstra, J.A., Tucker, J.V.: Initial and final algebra semantics for data type specifications; two characterisation theorems, SIAM J. Comput., 12, 366-387 (1983)
4. Bergstra, J.A., Tucker, J.V.: Algebraic specifications of computable and semi-computable data types. Theoret. Comput. Sci. 50, 137-181 (1987)
5. Dijkstra, E.W.: A Discipline of Programming, Prentice Hall, Englewood Cliffs, 1976
6. Dugundji, J.: Topology, William C. Brown, Dubuque, 1989.
7. Ehrig, H., Mahr, B.: Fundamentals of algebraic specification I: equations and initial semantics, Berlin, Heidelberg, New York: Springer Verlag 1985
8. Goguen, J.A., Meseguer, J.: Completeness of many-sorted equational logic. Assoc. for Computing Machinery SIGPLAN notices 17, 9-17 (1982)
9. Goguen, J.A., Meseguer, J.: Initiality, induction and computability. In: Nivat, M., Reynolds, J.C. (eds.) Algebraic methods in semantics, pp. 459-541. Cambridge: Cambridge University Press 1985
10. Goguen, J.A., Meseguer, J., Plaisted, D.: Programming with parameterized abstract objects in OBJ, 163-193 in: D. Ferrari, M. Bolognani and J.A. Goguen (eds), Theory and practice of software technology, North Holland, 1983.
11. Gordon, V.S., Bieman, J.: Rapid prototyping: lessons learned, IEEE Software 12, 85-95, (1995)
12. Heering, J., Meinke, K., Möller, B., Nipkow, T., (eds.) HOA '93: an international workshop on higher-order algebra, logic and term rewriting, (Lect. Notes Comput. Sci., vol. 816) Berlin, Heidelberg, New York: Springer Verlag 1994
13. Hinman, P.G.: Recursion-theoretic hierarchies, Berlin, Heidelberg, New York: Springer Verlag 1978
14. Jones, C.B.: Systematic software development using VDM, Prentice Hall, Englewood Cliffs, 1986
15. Kelley, J.L.: General Topology, Springer Verlag, Berlin, 1955
16. Klop, J.W.: Term rewriting, in: Abramsky, S., Gabbay, D., Maibaum, T.S.E., (eds.) Handbook of logic in computer science, Vol II, pp. 1-111. Oxford: Oxford University Press 1993
17. Kosiuczenko, P., Meinke, K.: On the power of higher-order algebraic specification methods, Information and Computation, 124, 85-101, (1996).
18. Meinke, K.: Universal algebra in higher types, Theoretical Computer Science, 100, 385-417, (1992)
19. Meinke, K.: A recursive second-order initial algebra specification of primitive recursion, Acta Informatica, 31, 329-340, (1994)
20. Meinke, K.: A completeness theorem for the expressive power of higher-order algebraic specifications, Journal of Computer and System Sciences, to appear, 1996a.
21. Meinke, K.: Proof theory of higher-order equational logic: normal forms, continuity and term rewriting, technical report, Department of Computer Science, University College of Swansea, 1996b to appear
22. Meinke, K., Tucker, J.V.: Universal algebra, in: Abramsky, S., Gabbay, D., Maibaum, T.S.E., (eds.) Handbook of logic in computer science, pp. 189-411 Oxford: Oxford University Press 1993
23. Möller, B.: Higher-order algebraic specifications. Facultät für Mathematik und Informatik, Technische Universität München, Habilitationsschrift, 1987
24. Spivey, J.M.: The Z notation, Prentice Hall, Englewood Cliffs, 1992
25. Steggles, L.J.: Extensions of Higher-Order Algebra, Case Studies and Fundamental Theory, Ph.D. Thesis, Dept, of Computer Science, University of Wales, Swansea, 1995
26. Normann, D.: Recursion on the countable functionals, Lecture Notes in Mathematics 811, Springer Verlag, Berlin, 1980
27. Wirsing, M.: Algebraic specification. In: van Leeuwen, J. (ed.) Handbook of theoretical computer science, pp. 675-788. Amsterdam: North Holland 1990