Proof theory of higher-order equations: Conservativity, normal forms and term rewriting

Journal of Computer and System Sciences

Volumn 67, Issue 1, 2003, Pages 127-173

  Meinke, K ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS; SYNTACTICS; THEOREM PROVING; TOPOLOGY;

COMPUTATION PROBLEMS;

COMPUTER SCIENCE;

EID: 0042520903     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00048-5     Document Type: Article

References (28)

1. G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Philos, Soc. 31 (1935) 433-454.
2. A. Church, A formulation of the simple theory of types, J. Symbolic Logic 5 (1940) 56-68.
3. R. Di Cosmo, Isomorphisms of Types: From Lambda Calculus to Information Retrieval and Language Design, Birkhauser, Basel, 1995.
4. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, North-Holland, Amsterdam, 1990.
5. J. Dugundji, Topology, Allyn and Bacon Inc., Boston. 1966.
6. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer, Berlin, 1985.
7. S. Feferman, Theories of finite type related to mathematical practice, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977.
8. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, in: Cambridge Tracts in Theoretical Computer Science, Vol. 7, Cambridge University Press, Cambridge, 1989.
9. J.A. Goguen, J. Meseguer, Completeness of many-sorted equational logic, Assoc. Comput. Mach. SIGPLAN Notices 17 (1982) 9-17.
10. L. Henkin, Completeness in the theory of types, J. Symbolic Logic 2 (1950) 81-91.
11. J.R. Hindley, J.P. Seldin, Introduction to Combinators and Lambda Calculus, Cambridge University Press, Cambridge, 1986.
12. J.L. Kelley, General Topology, Van Nostrand, Princeton, 1955.
13. J.W. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. II, Oxford University Press, Oxford, 1993, pp. 1-111.
14. P. Kosiuczenko, K. Meinke, On the power of higher-order algebraic specifications, Inform. and Comput. 124 (1) (1995) 85-101.
15. J. Lambek, P.J. Scott, Introduction to Higher Order Categorical Logic, Cambridge University Press, Cambridge, 1986.
16. P. Le Chenadec, Canonical Forms in Finitely Presented Algebras, Wiley, New York, 1986.
17. K. Meinke, Universal algebra in higher types, Theoret. Comput. Sci. 100 (1992) 385-417.
18. K. Meinke, A recursive second-order initial algebra specification of primitive recursion, Acta Inform. 31 (1994) 329-340.
19. K. Meinke, A completeness theorem for the expressive power of higher-order algebraic specifications, J. Comput. Systems Sci. 54 (1997) 502-519.
20. K. Meinke, L.J. Steggles, Correctness of dataflow and systolic algorithms using algebras of streams, Acta Inform. 38 (2001) 45-88.
21. K. Meinke, J.V. Tucker, Universal algebra, in: S. Abramsky, D. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1992, pp. 189-412.
22. B. Möller, A. Tarlecki, M. Wirsing, Algebraic specifications of reachable higher-order algebras, in: D. Sanella, A. Tarlecki (Eds.), Recent Trends in Data Type Specification, Lecture Notes in Computer Science, Vol. 332, Springer, Berlin, 1988, pp. 154-169.
23. D. Normann, Recursion on the Countable Functionals, in: Lecture Notes in Mathematics, Vol. 811, Springer, Berlin, 1980.
24. B. Russel, Mathematical logic as based on the theory of types, Amer. J. Math. 30 (1908) 222-262.
25. L.J. Steggles, Extensions of higher-order algebra: fundamental theory and case studies, Ph.D. Thesis, Dept. of Computer Science, University of Wales, Swansea, 1995.
26. D. Sanella, A. Tarlecki, On observational equivalence and algebraic specification, J. Comput. Systems Sci. 34 (1987) 150-187.
27. W. Taylor, Equational logic, Houston J. Math. (1979) 1-83. also in: G. Grätzer, Universal Algebra, 2nd Edition, Springer, Berlin, 1979.
28. W. Taylor, Equational logic, Houston J. Math. (1979) 1-83. also in: G. Grätzer, Universal Algebra, 2nd Edition, Springer, Berlin, 1979.