SN combinators and partial combinatory algebras

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

Volumn 1379, Issue , 1998, Pages 302-316

  Akama, Yohji ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; RECONFIGURABLE HARDWARE;

ABSTRACT MODELING; COMBINATORS; PARTIAL COMBINATORY ALGEBRAS; SOUNDNESS AND COMPLETENESS; TYPING SYSTEMS;

COMPUTER CIRCUITS;

EID: 34547316301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052378     Document Type: Conference Paper

References (21)

1. Y. Akama. A λ-to-CL translation for strong normalization. In Ph. de Groote and J.R. Hindley, eds., TLCA, Proceedings, vol. 1210 of LNCS, pp. 1-10. 1997.
2. H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, second edition, 1984.
3. M. Beeson. Foundations of Constructive Mathematics. 1984.
4. A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. TCS, 121:71-88, 1993.
5. I. Bethke. On the existence of extensional partial combinatory algebras. JSL, 52(3):819-833, 1987.
6. I. Bethke and J. W. Klop. Collapsing partial combinatory algebras. In G. Dowek et al., eds., HOA, Proceedings, vol. 1074 of LNCS, pp. 57-73. 1996.
7. N. Cağman and J.R. Hindley. Combinatory weak reduction in lambda calculus. Technical report, University of Wales Swansea, Swansea, U.K., 1997.
8. M. Dezani-Ciancagiini and J.R. Hindley. Intersection types for combinatory logic. TCS, 100(2):303-324, 1992.
9. L. Egidi, F. Honsell, and S. Ronchi Della Rocca. Operational, denotational and logical descriptions: A case study. Fundamenta lnformaticae, 16:149-169, 1992.
10. B. Gramlich. Termination and Confluence Properties of Structured Rewrite Systems. PhD thesis, Universität Kaiserslautern, 1996.
11. F. Honsell and S. Ronchi della Rocca. Models for theories of functions strictly depending on all their arguments. Internal report, Department of Computer Science, Turin, Italy, 1984.
12. J. Martin E. Hyland. A syntactic characterization of the equality in some models of the lambda calculus. J. London Math. Soc. (P), 12:361-370, 1976.
13. J.M.E. Hyland and C.-H. L. Ong. Modified realizability toposes and strong normvlization proofs (extended abstract). In M. Böhm and J.F. Groote, eds., TLCA, Proceedings, vol. 664 of LNCS, pp. 179-194. 1993.
14. G. Jacopini. A condition for identifying two elements of whatever model of combinatory logic. In C.BShm, editor, λ-calculus and computer science theory, vol. 37 of LNCS, pp. 213-219. 1975.
15. G. Jacopini and M. Venturini Zilli. Easy terms in the lambda-calculus. Fundamenta Informaticae, 8(2):225-233, 1985.
16. J.W. Klop. Term rewriting systems. In S. Abrainsky et al., editors, Handbook of Logic in Computer Science, volume 2, pages 2-117. Oxford UP, 1992.
17. T. Kurata. Subtype relations yielding filter lambdaomodels. In T. Ida, A. Ohori, and M. Takeichi, eds., Second Fuji International Workshop on Functional and Logic Programming, Proceedings, pp. 210-229. World Scientific, 1997.
18. K. Pino Perez. An extensional partial combinatory algebra based on A-terms. In A. Tarlecki, editor, MFCS, Proceedings, vol. 520 of LNCS, pp. 387-396. 1991.
19. G. Plotkin. Call-by-name, call-by-value, and the A-calculus. TCS, 1:125-159, 1975.
20. S. van Bakel. Complete restrictions of the intersection type discipline. TCS, 102:135-163, 1992.
21. ∞-models of the lambda calulus. SIAM J. Computing, 5:488-521, 1976.