Aspects of Universal Algebra in Combinatory Logic

In Erwin Engeler (ed.), The combinatory programme. Boston: Birkhäuser. pp. 31--45 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Algebra of Approximate Computation.Karl Aberer - 1994 - In Erwin Engeler (ed.), The combinatory programme. Boston: Birkhäuser. pp. 77--96.
Partial Combinatory Algebras of Functions.Jaap van Oosten - 2011 - Notre Dame Journal of Formal Logic 52 (4):431-448.
Algebra of proofs.M. E. Szabo - 1978 - New York: sole distributors for the U.S.A. and Canada, Elsevier North-Holland.
A General Form of Relative Recursion.Jaap van Oosten - 2006 - Notre Dame Journal of Formal Logic 47 (3):311-318.
Elements of combinatory logic.Frederic Brenton Fitch - 1974 - New Haven,: Yale University Press.
Types and Consistency.Daniel Otth - 1994 - In Erwin Engeler (ed.), The combinatory programme. Boston: Birkhäuser. pp. 117--136.
Axiomatic Extensions.Trudy Weibel - 1994 - In Erwin Engeler (ed.), The combinatory programme. Boston: Birkhäuser. pp. 14--30.

Analytics

Added to PP
2014-02-01

Downloads
24 (#905,788)

6 months
4 (#1,246,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references