Skip to main content
SpringerLink
Log in

The Peter Landin prize

  • Published:
Higher-Order and Symbolic Computation

Abstract

The Peter Landin prize honours the best paper presented at each year’s International Symposium on the Implementation and Application of Functional Languages (IFL). It has been awarded every year since 2003, and covers a range of topics including functional operating systems, static analysis for cost information of functional programs, techniques to improve array processing for data locality and parallelism, explicit parallel coordination, supercompilation, and a rational deconstruction of Landin’s SECD machine itself. This article describes the history of the prize, explains why Peter Landin was chosen as nominee, and describes each of the articles that have been awarded the prize to date.

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. Abramsky, S., Sykes, R.: SECD-M: a virtual machine for applicative programming. In: Jouannaud, J.-P. (ed.) Functional Programming Languages and Computer Architecture, Nancy, France, September 1985. Lecture Notes in Computer Science, vol. 201, pp. 81–98. Springer, Berlin (1985)

    Google Scholar 

  2. Berthold, J., Loogen, R.: Parallel coordination made explicit in a functional setting. In: Horváth, Z., Zsók, V., Butterfield, A. (eds.) Implementation and Application of Functional Languages, 18th International Symposium, IFL 2006, Budapest, Hungary, September 4–6, 2006. Lecture Notes in Computer Science, vol. 4449, pp. 73–90. Springer, Berlin (2007). Revised Selected Papers

    Chapter  Google Scholar 

  3. Berthold, J., Dieterle, M., Loogen, R.: Implementing parallel Google map-reduce in Eden. In: Sips, H., Epema, R., Lin, H.-X. (eds.) Proc. Euro-Par 2009: 15th International Euro-Par Conference, Delft, the Netherlands. Lecture Notes in Computer Science, vol. 5704, pp. 990–1002. Springer, Berlin (2009)

    Google Scholar 

  4. Berthold, J., Dieterle, M., Lobachev, O., Loogen, R.: Distributed memory programming on many-cores—a case study using Eden Divide-&-Conquer skeletons. In: Großpitsch, K.-E., Henkersdorf, A., Uhrig, S., Ungerer, T., Hähner, J. (eds.) Proc. ARCS’09—22nd International Conference on Architecture of Computing Systems, March (2009)

  5. Burge, W.H.: Recursive Programming Techniques. Addison-Wesley, New York (1975)

    MATH  Google Scholar 

  6. Danvy, O.: A rational deconstruction of Landin’s SECD machine. In: Grelck, C., Huch, F., Michaelson, G., Trinder, P.W. (eds.) Implementation and Application of Functional Languages, 16th International Workshop, IFL 2004, Lübeck, Germany, September 8–10, 2004. Lecture Notes in Computer Science, vol. 3474, pp. 52–71. Springer, Berlin (2005). Revised Selected Papers

    Chapter  Google Scholar 

  7. Danvy, O., Millikin, K.: A rational deconstruction of Landin’s SECD machine with the J operator. Log. Methods Comput. Sci. 4(12), 1–67 (2008)

    MathSciNet  Google Scholar 

  8. Grelck, C., Scholz, S.-B.: Merging compositions of array skeletons in SAC. Parallel Comput. 32(7), 507–522 (2006)

    Article  Google Scholar 

  9. Grelck, C., Hinckfuß, K., Scholz, S.-B.: With-loop fusion for data locality and parallelism. In: Butterfield, A., Grelck, C., Huch, F. (eds.) Implementation and Application of Functional Languages, 7th International Workshop, IFL 2005, Dublin, Ireland, September 19–21, 2005. Lecture Notes in Computer Science, vol. 4015, pp. 178–195. Springer, Berlin (2006). Revised Selected Papers

    Chapter  Google Scholar 

  10. Hammond, K., Michaelson, G.: Research Directions in Parallel Functional Programming. Springer, Berlin (1999)

    MATH  Google Scholar 

  11. Hinze, R.: Scans and convolutions: a calculational proof of Moessner’s theorem. In: Scholz, S.-B. (ed.) Implementation and Application of Functional Languages, 20th International Symposium, IFL 2008, Hatfield, UK, September 10–12, 2008. Lecture Notes in Computer Science. Springer, Berlin (2009). Revised Selected Papers

    Google Scholar 

  12. Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Proc 1996 ACM Symposium on Principles of Programming Languages—POPL ’96, pp. 410–423. St. Petersburg, FL, January (1996)

  13. Landin, P.: The mechanical evaluation of expressions. Comput. J. 6(4), 308–320 (1964)

    MATH  Google Scholar 

  14. Landin, P.: An abstract machine for designers of computer languages. In: Proceedings of the IFIP Congress 65, pp. 438–439. IFIP (1965)

  15. Landin, P.: The next 700 programming languages. Commun. ACM 9(3), 157–166 (1966)

    Article  MATH  Google Scholar 

  16. Lobachev, O., Berthold, J., Dieterle, M., Loogen, R.: Parallel FFT using Eden skeletons. In: Proc. 10th Intl. Conference on Parallel Computing Technologies (PACT)’09. Lecture Notes in Computer Science, vol. 5698, pp. 990–1002. Springer, Berlin (2009)

    Google Scholar 

  17. Loogen, R., Ortega-Mallén, Y., Peña-Marí, R.: Parallel functional programming in Eden. J. Funct. Program. 15(3), 431–475 (2005)

    Article  MATH  Google Scholar 

  18. Mitchell, N., Runciman, C.: A supercompiler for core Haskell. In: Chitil, O., Horváth, Z., Zsók, V. (eds.) Implementation and Application of Functional Languages, 19th International Symposium, IFL 2007, Freiburg, Germany, September 27–29, 2007. Lecture Notes in Computer Science, vol. 5083, pp. 147–164. Springer, Berlin (2008). Revised Selected Papers

    Chapter  Google Scholar 

  19. Scholz, S.-B.: Single assignment C—efficient support for high-level array operations in a functional setting. J. Funct. Program. 13(6), 1005–1059 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  20. Scholz, S.-B., Herhut, S., Joslin, C.: Architecture paradigms and programming languages for efficient programming of multiple COREs. Apple-Core Deliverable D4.2. http://www.apple-core.info/wp-content/apple-core/2008/01/d42.pdf, May (2009)

  21. Vasconcelos, P.B., Hammond, K.: Inferring cost equations for recursive, polymorphic and higher-order functional programs. In: Trinder, P.W., Michaelson, G., Pena, R. (eds.) Implementation of Functional Languages, 15th International Workshop, IFL 2003, Edinburgh, UK, September 8–11, 2003. Lecture Notes in Computer Science, vol. 3145, pp. 86–101. Springer, Berlin (2004). Revised Papers

    Chapter  Google Scholar 

  22. van Weelden, A., Plasmeijer, R.: Towards a strongly typed functional operating system. In: Arts, T., Pena, R. (eds.) Implementation of Functional Languages, 14th International Workshop, IFL 2002, Madrid, Spain, September 2003. Lecture Notes in Computer Science, vol. 2670, pp. 215–231. Springer, Berlin (2003). Revised Selected Papers

    Chapter  Google Scholar 

  23. Wegner, P.: Programming Languages, Information Structures and Machine Organization. McGraw-Hill, New York (1971)

    Google Scholar 

  24. Al Zain, A.D., Hammond, K., Berthold, J., Trinder, P., Michaelson, G., Aswad, M.: Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures. In: Proc. DAMP ’09: 4th International Workshop on Declarative Aspects of Multicore Programming, Savannah, Georgia, USA, January (2009)

  25. Al Zain, A.D., Trinder, P.W., Hammond, K., Konovalov, A., Linton, S., Berthold, J.: Parallelism without pain: orchestrating computational algebra components into a high-performance parallel system. In: Proc. IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA’08), pp. 99–112. Sydney, Australia, December (2008)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of St. Andrews, St. Andrews, Scotland

    Kevin Hammond

  2. School of Mathematics and Computer Science, Heriot-Watt University, Edinburgh, Scotland

    Greg Michaelson

Authors
  1. Kevin Hammond
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Greg Michaelson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kevin Hammond.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hammond, K., Michaelson, G. The Peter Landin prize. Higher-Order Symb Comput 22, 305–312 (2009). https://doi.org/10.1007/s10990-010-9055-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-010-9055-7

Keywords

Search

Navigation