Skip to main content
SpringerLink
Log in

A Variadic Extension of Curry's Fixed-Point Combinator

  • Published:
Higher-Order and Symbolic Computation

Abstract

We present a systematic construction of a variadic, applicative-order, multiple fixed-point combinator in Scheme. The resulting Scheme procedure is a variadic extension of the n-ary version of Curry's fixed-point combinator. It can be used to create mutually-recursive procedures, and expand letrec-expressions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abelson, H., Jay Sussman, G., and Sussman, J. Structure and Interpretation of Computer Programs. The MIT Press, McGraw-Hill Book Company, Second edition, 1996.

  2. Barendregt, H.P. The Lambda Calculus, Its Syntax and Semantics. North-Holland, 1984.

  3. Barendregt, H.P. Functional programming and the λ-calculus. In Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.), chapter 7. MIT Press, Cambridge, Massachusetts, 1990, pp. 323–363.

  4. Bekič, H. Programming Languages and Their Definition. Number 177 in Lecture Notes in Computer Science. Springer-Verlag, 1984.

  5. Curry, H.B., Feys, R., and Craig, W. Combinatory Logic, volume I. North-Holland Publishing Company, 1958.

  6. Dyadic Systems, Limited. Dyalog APL. http://www.dyadic.com/.

  7. Friedman, D.P. and Felleisen, M. The Little LISPer. Science Research Associates, Inc., 1986.

  8. Goldberg, M. A variadic extension of Curry's fixed-point combinator. In Proceedings of the 2002 ACM SIGPLAN Workshop on Scheme and Functional Programming, O. Shivers (Ed.), October 2002, pp. 69–78.

  9. Iverson, K.E. A Programming Language. John Wiley & Sons, Inc., 1962.

  10. Kohlbecker, E.M. and Wand, M. Macro-by-example: Deriving syntactic transformations from their specifications. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987, pp. 77–84.

  11. Landin, P.J. The mechanical evaluation of expressions. Computer Journal, 6 (1964), 308–320.

    MATH  Google Scholar 

  12. Péter, R. Recursive Functions. Academic Press, 1967.

  13. Queinnec, C. LISP In Small Pieces. Cambridge University Press, 1996.

  14. Turing, A. The p-functions in λ-k-conversion. Journal of Symbolic Logic (1937) p. 164.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben Gurion University, Beer Sheva, 84105, Israel

    Mayer Goldberg

Authors
  1. Mayer Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mayer Goldberg.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goldberg, M. A Variadic Extension of Curry's Fixed-Point Combinator. Higher-Order Symb Comput 18, 371–388 (2005). https://doi.org/10.1007/s10990-005-4881-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-005-4881-8

Keywords

Search

Navigation