Skip to main content
Springer Nature Link
Log in

Clocks for Functional Programs

  • Chapter
The Beauty of Functional Code

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

  • 1222 Accesses

Abstract

Of the current authors the oldest one remembers with fondness numerous meetings with Rinus from the ancient times of the European Basic Research Actions and from personal tutorials in Nijmegen about λ-terms, term graphs and processes on the one hand, and the practice of functional programming in the Clean environment on the other hand.

The research has been partially funded by the Netherlands Organization for Scientific Research (NWO) under grant numbers 612.000.934, 639.021.020, and 612.001.002.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ariola, Z.M., Klop, J.W.: Equational Term Graph Rewriting. Technical Report IR-391, Vrije Universiteit Amsterdam (1995), ftp://ftp.cs.vu.nl/pub/papers/theory/IR-391.ps.Z

  2. Barendregt, H.P.: The Lambda Calculus. Its Syntax and Semantics, revised edition. Studies in Logic and The Foundations of Mathematics, vol. 103. North-Holland (1984)

    Google Scholar 

  3. Barendregt, H.P., Dekkers, W., Statman, R.: Lambda Calculus with Types. Perspectives in Logic. Cambridge University Press (2013)

    Google Scholar 

  4. Bercovici, I.: Unsolvable Terms in Typed Lambda Calculus with Fix-Point Operators. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 16–22. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  5. Bethke, I., Klop, J.W., de Vrijer, R.C.: Descendants and Origins in Term Rewriting. Information and Computation 159(1-2), 59–124 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)

    Google Scholar 

  7. Coquand, C., Coquand, T.: On the Definition of Reduction for Infinite Terms. Comptes Rendus de l’Académie des Sciences. Série I 323(5), 553–558 (1996)

    MathSciNet  MATH  Google Scholar 

  8. de Mast, P., Jansen, J.-M., Bruin, D., Fokker, J., Koopman, P., Smetsers, S., van Eekelen, M., Plasmeijer, R.: Functional Programming in Clean

    Google Scholar 

  9. Endrullis, J., Grabmayer, C., Klop, J.W., van Oostrom, V.: On Equal μ-Terms. Theoretical Computer Science 412(28), 3175–3202 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Endrullis, J., Hansen, H.H., Hendriks, D., Polonsky, A., Silva, A.: A Coinductive Treatment of Infinitary Term Rewriting (submitted, 2013)

    Google Scholar 

  11. Endrullis, J., Hendriks, D., Klop, J.W.: Modular Construction of Fixed Point Combinators and Clocked Böhm Trees. In: Proc. Symp. on Logic in Computer Science (LICS 2010), pp. 111–119 (2010)

    Google Scholar 

  12. Endrullis, J., Hendriks, D., Klop, J.W.: Highlights in Infinitary Rewriting and Lambda Calculus. Theoretical Computer Science 464, 48–71 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Endrullis, J., Hendriks, D., Klop, J.W., Polonsky, A.: Discriminating Lambda-Terms using Clocked Böhm Trees. Logical Methods in Computer Science (in print, 2012)

    Google Scholar 

  14. Endrullis, J., Hendriks, D., Klop, J.W., Polonsky, A.: Clocked Lambda Calculus. Mathematical Structures in Computer Science (accepted for publication, 2013)

    Google Scholar 

  15. Endrullis, J., Polonsky, A.: Infinitary Rewriting Coinductively. In: Proc. Types for Proofs and Programs (TYPES 2012). LIPIcs, vol. 19, pp. 16–27. Schloss Dagstuhl (2013)

    Google Scholar 

  16. Hindley, J.R., Seldin, J.P.: Lambda-Calculus and Combinators. Cambridge University Press (2008)

    Google Scholar 

  17. Hutton, G.: Programming in Haskell. Cambridge University Press (2007)

    Google Scholar 

  18. Intrigila, B.: Non-Existent Statman’s Double Fixed Point Combinator Does Not Exist, Indeed. Information and Computation 137(1), 35–40 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Klop, J.W., de Vrijer, R.C.: Infinitary Normalization. In: We Will Show Them: Essays in Honour of Dov Gabbay, vol. 2, pp. 169–192. College Publ. (2005), Techn. report: http://www.cwi.nl/ftp/CWIreports/SEN/SEN-R0516.pdf

  20. Ketema, J., Simonsen, J.G.: Infinitary Combinatory Reduction Systems: Confluence. Logical Methods in Computer Science 5(4), 1–29 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Naoi, T., Inagaki, Y.: Algebraic Semantics and Complexity of Term Rewriting Systems. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 311–325. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  22. Platek, R.A.: Foundations of Recursion Theory. University Microfilms (1984)

    Google Scholar 

  23. Plotkin, G.D.: Lcf considered as a programming language. Theor. Comput. Sci. 5(3), 223–255 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  24. Smullyan, R.: To Mock a Mockingbird, and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic. Alfred A. Knopf, New York (1985)

    Google Scholar 

  25. Statman, R.: On The Lambda Y Calculus. In: Proc. Symp. on Logic in Computer Science (LICS 2002), pp. 159–166. IEEE (2002)

    Google Scholar 

  26. Terese. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, VU University Amsterdam, The Netherlands

    Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop & Andrew Polonsky

  2. Centrum Wiskunde & Informatica (CWI), The Netherlands

    Jan Willem Klop

  3. Radboud Universiteit Nijmegen, The Netherlands

    Andrew Polonsky

Authors
  1. Jörg Endrullis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitri Hendriks
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Willem Klop
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andrew Polonsky
    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

Endrullis, J., Hendriks, D., Klop, J.W., Polonsky, A. (2013). Clocks for Functional Programs. 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_8

Download citation

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

  • 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