Collapsing partial combinatory algebras

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

Volumn 1074, Issue , 1995, Pages 57-73

  Bethke, Inge ^a,b   Klop, Jan Willem ^a,c  

^a CWI   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

GENERAL THEORY; PARTIAL COMBINATORY ALGEBRAS; RECURSION THEORY;

COMPUTATION THEORY;

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

References (25)

1. A. Asperti and A. Ciabattoni. Effective applicative structures. In Proceedings of the 6th biennial conference on Category Theory in Computer Science (CTCS’95), volume 953 of Lecture Notes in Computer Science, pages 81-95. 1995.
2. H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, revised edition, 1984. (Second printing 1985).
3. J. Baeten and B. Boerboom. ω can be anything it should not be. Indagationes Mathematicae, 41:111-120, 1979.
4. M.J. Beeson. Foundations of Constructive Mathematics, volume 6 of Ergebnisse der Mathematik und ihrer Grenzgebiete, 3.Folge. Springer-Verlag, 1985.
5. I. Bethke. On the existence of extensional partial combinatory algebras. Journal of Symbolic Logic, 52 (3):819-833, 1987.
6. I. Bethke. Finite type structures within combinatory algebras. Annals of Pure and Applied Logic, 55:101-123, 1991.
7. A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. Theoretical Computer Science, 121:71-88, 1993.
8. P. Burmeister. Partial algebras - survey of a unifying approach towards a two-valued model theory for partial algebras. Algebra Universalis, 15:306-358, 1982.
9. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Formal Methods and Semantics, Handbook of Theoretical Computer Science, Volume B, chapter 6, pages 243-320. MIT Press, 1990.
10. E. Engeler. Algebras and combinators. Algebra Universalis, 13:389-392, 1981.
11. G. Grätzer. Universal algebra. Second edition. Springer-Verlag, 1979.
12. J.R. Hindley and J.P. Seldin. Introduction to Combinators and λ-calculus, volume 1 of London Mathematical Society Student Texts. Cambridge University Press, 1986.
13. G. Jacopini. A condition for identifying two elements of whatever model of combinatory logic. In C. Böhm, editor, λ-Calculus and Computer Science Theory, volume 37 of Lecture Notes in Computer Science, pages 213-219. Springer-Verlag, 1975.
14. G. Jacopini and M. Venturini Zilh. Easy terms in the lambda-calculus. Fundamenta Informaticae, VIII(2):225-233, 1985.
15. J.W. Klop. Extending partial combinatory algebras. Bulletin of the European Association for Theoretical Computer Science, 16:472-482, 1982.
16. J.W. Klop. Term rewriting systems. In D. Gabbay S. Abramsky and T. Maibaum, editors, Handbook of Logic in Computer Science, Volume II. Oxford University Press, 1992.
17. K. Meinke. A survey of higher-order algebra. Technical Report U.U.D.M. 1995:39, ISSN 1101-3591, University of Uppsala, 1995.
18. J.C. Mitchell. Introduction to Programming Language Theory. Forthcoming.
19. G.D. Plotkin. A set-theoretical definition of application. Technical Report Memorandum MIP-R-95, School of Artificial Intelligence, University of Edinburgh, 1972.
20. D.S. Scott. Data types as lattices. SIAM J. Comput., 5:522-587, 1976.
21. T. Streicher. Semantics of type theory: correctness, completeness and independence results. Birkhäuser Verlag, 1991.
22. H.R. Strong. Algebraically generalized recursive function theory. IBM J. Research and Development, 12:465-475, 1968.
23. Open problems; Swansea λ-calculus meeting; 21 September 1979. Bulletin of the European Association for Theoretical Computer Science, 10:136-140, 1980.
24. A.S. Troelstra and D. van Daien. Constructivism in Mathematics. An Introduction. Volume II, volume 123 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1988.
25. E. Wagner. Uniformly reflexive structures. Trans. American Math. Society, 144:1-41, 1969.