Skip to main content
SpringerLink
Log in

Pure and Lazy Lambda Mining

An Experience Report

  • Conference paper
  • First Online:
Implementation and Application of Functional Languages (IFL 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8241))

Included in the following conference series:

  • 593 Accesses

Abstract

This paper discusses our entry to the 2012 ICFP Programming Contest, written entirely in Haskell. Our solution uses many features of Haskell: pure immutable data structures, laziness, higher-order functions, concurrency, and exception handling. Each of these features plays an essential part in our overall solution, and we demonstrate how these key elements can be composed together. In this exposition, we stress the importance of how the code was structured in such a way that made safely refactoring and extending the model a relatively easy task, and how Haskell’s strong type system made it possible for our team to remain agile under changing specifications.

Nicolas Wu and José Pedro Magalhães have been funded by EPSRC grant number EP/J010995/1.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The official task description is available at http://icfpcontest2012.wordpress.com/task/. A video presenting the task and announcing the winners can be seen at https://www.youtube.com/watch?v=5TCqUU3-GT0.

  2. 2.

    http://hackage.haskell.org/package/attoparsec

References

  1. Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)

    Article  Google Scholar 

  2. Hinze, R.: Generalizing generalized tries. J. Funct. Program. 10(4), 327–351 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hughes, J.: Why functional programming matters. Comput. J. 32(2), 98–107 (1989)

    Article  Google Scholar 

  4. Peyton Jones, S. (ed.): Haskell 98, Language and Libraries. The Revised Report. Cambridge University Press, Cambridge (2003). Journal of Functional Programming Special Issue 13(1)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oxford, Oxford, UK

    Nicolas Wu & José Pedro Magalhães

  2. Department of Computer Science, Utrecht University, Utrecht, The Netherlands

    Jeroen Bransen & Wouter Swierstra

Authors
  1. Nicolas Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Pedro Magalhães
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeroen Bransen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wouter Swierstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Nicolas Wu , José Pedro Magalhães , Jeroen Bransen or Wouter Swierstra .

Editor information

Editors and Affiliations

  1. University of Oxford, Oxford, United Kingdom

    Ralf Hinze

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, N., Magalhães, J.P., Bransen, J., Swierstra, W. (2013). Pure and Lazy Lambda Mining. In: Hinze, R. (eds) Implementation and Application of Functional Languages. IFL 2012. Lecture Notes in Computer Science(), vol 8241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41582-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41582-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41581-4

  • Online ISBN: 978-3-642-41582-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation