An algebraic generalization of Frege structures - Binding algebras

Theoretical Computer Science

Volumn 211, Issue 1-2, 1999, Pages 189-232

  Sun, Yong ^a  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

(Admissible) equational logic; Admissible completeness; Binding algebras; Binding equations; Birkhoff's method; Frege structures

Indexed keywords

EID: 0012439858     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00170-9     Document Type: Article

References (32)

1. P. Aczel, Frege structure and notations of propositions, truth and set, The Kleene Symp., North-Holland, Amsterdam, 1980, pp. 31-59.
2. H.P. Barendregt, The Lambda Calculus: its Syntax and Semantics, (revised ed.), North-Holland, Amsterdam, 1984.
3. M.J. Beeson, Foundations of constructive mathematics, Ergebnisse der Mathematik und ihrer Grenzgebiete 3, Folge Band 6, Springer, Berlin, 1985.
4. G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Philos. Soc. 31 (1935) 433-454.
5. S. Burris, H.P. Sankappanavar, A Course in Universal Algebra, Graduate Text in Mathematics, Springer, Berlin, 1981.
6. P.M. Cohn, Universal Algebra, Harper and Row, New York, 1980.
7. P. Dybjer, Category-theoretic logics and algebras of programs, Ph.D. Thesis, Department of Computer Science, Chalmers University of Technology at Göteborg, 1983.
8. H. Ehrig, B. Mahr, Fundamental of Algebraic Specilication 1: Equations and Initial Semantics, vol. 6, EATCS Monograph on Theoretical Computer Science, Springer, Berlin, 1985.
9. R.C. Flagg, J. Myhill, An extension of Frege Structures, in: D.W. Kueker, E.G.K. Lopez-Escobar, C.H. Smith (Eds.), Mathematical Logic and Theoretical Computer Science, Lecture Notes in Pure and Applied Math., vol. 106, Marcel Dekker, New York, 1987, pp. 197-217.
10. J.Y. Girard, System F of variable types, Theoret. Comput. Sci. 45 (1986) 159-192.
11. J.A. Goguen, J. Meseguer, Completeness of many-sorted equational logic, Houston J. Math., 1985; also in report No. 15, CSLI, Stanford University, 1984.
12. G. Grätzer, Universal Algebra, 2nd ed., Springer, Berlin, 1979.
13. T. Jech, Set Theory, Academic Press, New York, 1978.
14. F. Kamareddine, Set theory and nominalisation, Part I, J. Logic Comput. 2(5) (1992) 579-604.
15. F. Kamareddine, Set theory and nominalisation, Part II, J. Logic Comput. 2(6) (1992) 687-707.
16. A. Kanamori, M. Magidor, The evolution of large cardinal axioms in set theory, in: Higher Set Theory, Lecture Notes in Math., vol. 669, Springer, Berlin, 1978, pp. 99-275.
17. A.S. Kechris, Y.N. Moschovakis, Recursion in higher types, in: Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 681-737.
18. T.S.E. Maibaum, C.J. Lucena, Higher order data types, Internat. J. Comput. Inform. Sci. 9 (1980) 31-53.
19. K. Meinke, Universal algebra in higher types, Theoret. Comput. Sci., 100 (1992) 385-417.
20. K. Meinke, A recursive second order initial algebra specification of primitive recursion, Acta Inform. 31 (1994) 329-340.
21. B. Möller, Algebraic specifications with higher-order operators, in: L.G.L.T. Meertens (Ed.), Proc. IFIP TC2 Working Conf. on Program Specification and Transformation, North-Holland, Amsterdam, 1987.
22. K. Parsaye-Ghomi, Higher-order abstract data types. Ph.D. Thesis, Department of Computer Science, University of California at Los Angeles, 1981.
23. G.D. Plotkin, Lambda-definability in the full type hierachy, in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980.
24. G. Plotkin, An illative theory of relations, in: R. Cooper, K. Mukai, J. Perry (Eds.), Situation Theory and its Application, vol. 1, Lecture Notes 22, CSLI. Stanford University, 1990.
25. A. Poigné, On specifications, theories and models with higher types, Inform. Control 68 (1986) 1-46.
26. D. Scott, Data types as lattices, SIAM J. Comput. (1976) 522-587.
27. R. Statman, Logical relation and the typed lambda calculus, Inform. and Control 1985.
28. Y. Sun, Equational logics, in: Proc. Internat. Workshop on Static Analysis of Equational, Functional and Logic Programs, Bigre No.74, Bordeaux, France, 9-11 October 1991, pp. 44-52.
29. Y. Sun, A framework for binding operators, Ph.D. Thesis, CST-91-92 (also published as ECS-LFCS-92-207), Department of Computer Science, University of Edinburgh, 1992.
30. Y. Sun, Axiomatization of calculus of constructions, Proc. Summer Symp. on Constructivity in Computer Science, San Antonio, TX, USA, June 1991; also appears in Lecture Notes in Computer Science, vol. 613, Springer, Berlin, 1992, pp. 108-130.
31. Y. Sun, Axiomatization of calculus of constructions, Proc. Summer Symp. on Constructivity in Computer Science, San Antonio, TX, USA, June 1991; also appears in Lecture Notes in Computer Science, vol. 613, Springer, Berlin, 1992, pp. 108-130.
32. G. Takeuti, W.M. Zaring, Introduction to Axiomatic Set Theory, Graduate Text in Mathematics, vol. 1, Springer, Berlin, 1971.