Skip to main content
SpringerLink
Log in
Book cover

The Beauty of Functional Code pp 250–257Cite as

The Beauty of Declarative Purely Functional Projections

  • Chapter

  • 1174 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8106))

Abstract

The concept of mathematical functions allows to declaratively express knowledge of how to project information to new derived information. The beauty of this approach emerges from the properties of pure functions fitting into a whole system like a piece of a jigsaw puzzle. Projections defining information in terms of other available information can be the building blocks of a system with a complex behaviour, where all details of how this complex behaviour is achieved can be completely separated from dealing with information used in the system. In this essay this is illustrated by examples of how the same projections can be used in two very different contexts.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bohannon, A., Pierce, B.C., Vaughan, J.A.: Relational lenses: a language for updatable views. In: PODS 2006: Proceedings of the Twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 338–347. ACM, New York (2006)

    Chapter  Google Scholar 

  2. Keith Hastings, W.: Monte carlo sampling methods using markov chains and their applications. Biometrika 57(1), 97–109 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hoogle, http://www.haskell.org/hoogle/

  4. Lijnse, B., Jansen, J.M., Nanne, R., Plasmeijer, R.: Capturing the netherlands coast guard’s sar workflow with itasks. In: Mendonca, D., Dugdale, J. (eds.) Proceedings of the 8th International Conference on Information Systems for Crisis Response and Management, ISCRAM 2011, Lisbon, Portugal. ISCRAM Association (May 2011)

    Google Scholar 

  5. Lijnse, B., Jansen, J.M., Plasmeijer, R.: Incidone: A task-oriented incident coordination tool. In: Rothkrantz, L., Ristvej, J., Franco, Z. (eds.) Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management, ISCRAM 2012, Vancouver, Canada (April 2012)

    Google Scholar 

  6. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21, 1087 (1953)

    Article  Google Scholar 

  7. Michels, S., Velikova, M., Hommersom, A., Lucas, P.J.F.: A Probabilistic Logic–based Model for Fusing Attribute Information of Objects Under Surveillance. Technical Report ICIS–R12006, Radboud University Nijmegen (December 2012), https://pms.cs.ru.nl/iris-diglib/src/getContent.php?id=2012-Michels-Fusion

  8. Pfeffer, A.: Figaro: An object-oriented probabilistic programming language. Technical report, Charles River Analytics (2009)

    Google Scholar 

  9. Plasmeijer, R., Lijnse, B., Michels, S., Achten, P., Koopman, P.: Task-Oriented Programming in a Pure Functional Language. In: Proceedings of the 2012 ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2012, , Leuven, Belgium, pp. 195–206. ACM (September 2012)

    Google Scholar 

  10. Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: In 29th ACM POPL, pp. 154–165. ACM Press (2002)

    Google Scholar 

  11. Ripley, B.D.: Stochastic simulation, vol. 316. Wiley (2009)

    Google Scholar 

  12. Wadler, P.: Theorems for free? In: Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, FPCA 1989, pp. 347–359. ACM, New York (1989)

    Chapter  Google Scholar 

  13. Zhang, N., Poole, D.: A simple approach to Bayesian network computations. In: Proceedings of the Tenth Canadian Conference on Artificial Intelligence, pp. 171–178 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands

    Steffen Michels

Authors
  1. Steffen Michels
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computing and Information Sciences (ICIS), Radboud University Nijmegen, Heijendaalseweg 135, 6525 AJ, Nijmegen, The Netherlands

    Peter Achten

  2. Institute for Computing and Information Sciences (ICIS), Radboud University Nijmegen, Heijendaalseweg 135,, 6525 AJ, Nijmegen, The Netherlands

    Pieter Koopman

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Michels, S. (2013). The Beauty of Declarative Purely Functional Projections. In: Achten, P., Koopman, P. (eds) The Beauty of Functional Code. Lecture Notes in Computer Science, vol 8106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40355-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40355-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40354-5

  • Online ISBN: 978-3-642-40355-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation