Another algorithm for bracket abstraction

Journal of Symbolic Logic 44 (2):267-270 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

The limits of abstraction.Kit Fine - 2002 - New York: Oxford University Press. Edited by Matthias Schirn.
Compact bracket abstraction in combinatory logic.Sabine Broda & Luís Damas - 1997 - Journal of Symbolic Logic 62 (3):729-740.
Some improvements to Turner's algorithm for bracket abstraction.M. W. Bunder - 1990 - Journal of Symbolic Logic 55 (2):656-669.
An abstraction algorithm for combinatory logic.S. Kamal Abdali - 1976 - Journal of Symbolic Logic 41 (1):222-224.
Can Machines Think? An Old Question Reformulated.Achim Hoffmann - 2010 - Minds and Machines 20 (2):203-212.

Analytics

Added to PP
2009-01-28

Downloads
216 (#90,147)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Gapping as constituent coordination.Mark J. Steedman - 1990 - Linguistics and Philosophy 13 (2):207 - 263.
NP-Completeness of a Combinator Optimization Problem.M. S. Joy & V. J. Rayward-Smith - 1995 - Notre Dame Journal of Formal Logic 36 (2):319-335.

Add more citations

References found in this work

No references found.

Add more references