Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Spider Spinning for Dummies

  • Chapter
Advanced Functional Programming (AFP 2008)

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

Included in the following conference series:

  • 806 Accesses

Abstract

Spider spinning is a snappy name for the problem of listing the ideals of a totally acyclic poset in such a way that each ideal is computed from its predecessor in constant time. Such an algorithm is said to be loopless. Our aim in these lectures is to show how to calculate a loopless algorithm for spider spinning. The calculation makes use of the fundamental laws of functional programming and the real purpose of the exercise is to show these laws in action.

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

Access this chapter

Log in via an institution

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. Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. ACM 20, 500–513 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  2. Filliâtre, J.-C., Pottier, F.: Producing all ideals of a forest, functionally. Journal of Functional Programming 13(5), 945–956 (2003)

    Article  MATH  Google Scholar 

  3. Koda, Y., Ruskey, R.: A Gray code for the ideals of a forest poset. Journal of Algorithms 15, 324–340 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Knuth, D.E.: SPIDERS: (2001), http://www-cs-faculty.stanford.edu/~knuth/programs.html

  5. Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicles 2,3,4. Addison-Wesley, Reading (2005)

    MATH  Google Scholar 

  6. Knuth, D.E., Ruskey, F.: Efficient Coroutine Generation of Constrained Gray Sequences (aka Deconstructing Coroutines). In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol. 2635, pp. 183–208. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Okasaki, C.: Simple and efficient purely functional queues and deques. Journal of Functional Programming 5(4), 583–592 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK

    Richard S. Bird

Authors
  1. Richard S. Bird
    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, Radboud University Nijmegen, Heijendaalseweg 135, 6525, Nijmegen, AJ, The Netherlands

    Pieter Koopman  & Rinus Plasmeijer  & 

  2. Department of Information and Computing Sciences, Utrecht Universiy, Padualaan 14, 3584, Utrecht, CH, The Netherlands

    Doaitse Swierstra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bird, R.S. (2009). Spider Spinning for Dummies. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds) Advanced Functional Programming. AFP 2008. Lecture Notes in Computer Science, vol 5832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04652-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04652-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04651-3

  • Online ISBN: 978-3-642-04652-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation