Skip to main content
SpringerLink
Log in

Editorial

  • Editorial Board
  • Published:
Higher-Order and Symbolic Computation

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

References

  1. Burstall, R.M. and Darlington, J. Some transformations for developing recursive programs. In Proceedings of the International Conference on Reliable Software, Los Angeles, USA, 1975, pp. 465–472.

  2. Walker, S.A. and Strong, H.R. Characterization of flowchartable recursions. In Proceedings 4th Annual ACM Symposium on Theory of Computing, Denver, CO, USA, 1972.

Download references

Author information

Authors and Affiliations

  1. BRICS, University of Aarhus, Denmark

    Olivier Danvy

  2. University of Copenhagen, Denmark

    Fritz Henglein

  3. Brandeis University, Massachusetts, USA

    Harry Mairson

  4. Università di Roma Tor Vergata, Italy

    Alberto Pettorossi

Authors
  1. Olivier Danvy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fritz Henglein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Harry Mairson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alberto Pettorossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Danvy, O., Henglein, F., Mairson, H. et al. Editorial. Higher-Order and Symbolic Computation 16, 5–6 (2003). https://doi.org/10.1023/A:1023059701827

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023059701827

Search

Navigation