Hostname: page-component-6bf8c574d5-b4m5d Total loading time: 0 Render date: 2025-02-17T23:16:16.248Z Has data issue: false hasContentIssue false
  • English
  • Français

Another algorithm for bracket abstraction

Published online by Cambridge University Press:  12 March 2014

D. A. Turner
D. A. Turner*
Affiliation:
Computer Laboratory, University of Kent, Canterbury, England
Get access Rights & Permissions [Opens in a new window]

Extract

This short article presents an algorithm for bracket abstraction [1] which avoids a combinatorial explosion in the size of the resulting expression when applied repeatedly for abstraction in a series of variables. It differs from a previous solution [2] in introducing only a finite number of additional combinators and in not requiring that all the variables to be abstracted be treated together in a single operation.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 44 , Issue 2 , June 1979 , pp. 267 - 270
Copyright
Copyright © Association for Symbolic Logic 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Curry, H. B. and Feys, R., Combinatory logic, vol. 1, North-Holland, Amsterdam, 1958.Google Scholar
[2]Abdali, S. K., An abstraction algorithm for combinatory logic, this Journal, vol. 41 (1976), pp. 222–224.Google Scholar
[3]Schoenfinkel, M., Über die Bausteine der mathematischen Logik, Mathematische Annalen, vol. 92 (1924), pp. 305–316.CrossRefGoogle Scholar
[4]Turner, D. A., SASL language manual, St. Andrews University, Fife, Scotland, 1976.Google Scholar