Skip to main content
SpringerLink
Log in

Functional programming and combinatory algebras

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

This research has been supported by grants of Ministero della Pubblica Istruzione, Italia and of "Projet stimulation" CEE.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdali, S.K., An abstraction algorithm for combinatory logic, JSL 41, 1976

    Google Scholar 

  2. Backus, J., Can programming be liberated from von Neumann style? A functional style and its algebra of programs, ACM Comm., 1978, vol.21, no.8, pp.613–641

    Google Scholar 

  3. Barendregt, H.P., The type free lambda-calculus, in "Handbook of Mathematical Logic", Barwise (ed.), North Holland, 1981

    Google Scholar 

  4. Barendregt, H.P., The lambda calculus, North Holland, 1981

    Google Scholar 

  5. Böhm, C. and Berarducci, A., Automatic synthesis of typed A-programs on term algebras, TCS 39 (1985), pp.135–154

    Google Scholar 

  6. Böhm, C. and Dezani-Ciancaglini, M., Combinatorial problems, combinator equations and normal forms, in: Lœckx (ed.) Progr, "Automata,Languages and Programming 2thColloquium", LNCS 14, 1974, pp. 185–199

    Google Scholar 

  7. Böhm, C. and Dezani-Ciancaglini, M., λ-terms as total or partial functions on normal forms, in "λ-Calculus and computer science theory", Böhm (ed.), LNCS 37, Springer, 1975, pp.96–121

    Google Scholar 

  8. Böhm, C., Combinatory foundation of functional programming, in "1982 ACM Symposium on Lisp and functional programming", 1982,Pittsburgh,Pen., pp. 29–36

    Google Scholar 

  9. Church, A., The calculi of lambda-conversion, Princeton Univ. Press, 1941

    Google Scholar 

  10. Coppo, M. and Dezani-Ciancaglini, M., Tree and λ-terms in "Les Arbres an Algebre et Programmation" G.Jacobs (ed.), Debock, 1977, pp.91–120

    Google Scholar 

  11. Coppo, M., A completeness theorem for recursively defined types, in "Automata,Languages and Programming 12th colloquium", LNCS 194, 1985, pp.120–128

    Google Scholar 

  12. Johnsson, T., Efficient compilation of lazy evaluation, in "Proceedings of the SIGPLAN '84 symposium on compiler construction", Montreal, 1984, pp.58–69

    Google Scholar 

  13. McCarthy, J., Recursive functions of symbolic expressions and their computation by machine, Comm.ACM 1960, vol.3, no. 4, pp184–195

    Google Scholar 

  14. Parsons, C, Hierarchies of primitive recursive functions, Zeits.f.Math.Logik und Grundlage d.Math, vol.14, 1968, pp.357–376

    Google Scholar 

  15. Schönfinkel, M., Über die Bausteine der matematischen logik, Math. Annalen 92, 1924, pp.305–316

    Google Scholar 

  16. Turner, D.A., Miranda: A non strict language with polymorphic types, in "Proceedings 1985 conference on functional programming languages and computer architecture", Nancy, 1985, pp.1–16

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Istituto "G. Castelnuovo", Università degli Studi di Roma "La Sapienza", P.le Aldo Moro 5, I-00185, Roma

    Corrado Böhm

Authors
  1. Corrado Böhm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Böhm, C. (1988). Functional programming and combinatory algebras. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017128

Download citation

  • DOI: https://doi.org/10.1007/BFb0017128

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation