Clowns to the left of me, jokers to the right (pearl) dissecting data structures

ACM SIGPLAN Notices

Volumn 43, Issue 1, 2008, Pages 287-295

  McBride, Conor ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Datatype; Differentiation; Dissection; Division; Generic Programming; Iteration; Polynomial; Stack; Tail Recursion; Traversal; Zipper

Indexed keywords

DATATYPE; DIFFERENTIATION; DISSECTION; DIVISION; GENERIC PROGRAMMING; ITERATION; STACK; TAIL RECURSION; TRAVERSAL; ZIPPER;

DATA STRUCTURES; RECURSIVE FUNCTIONS; SET THEORY;

POLYNOMIALS;

EID: 67650106121     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Containers - constructing strictly positive types. Theoretical Computer Science, 342:3-27, September 2005a. Applied Semantics: Selected Topics.
2. Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor McBride. ∂ for data: derivatives of data structures. Fundamenta Informaticae, 65(1&2):1-28, 2005b.
3. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, and Jan Midt-gaard. A functional correspondence between evaluators and abstract machines. In PPDP, pages 8-19. ACM, 2003.
4. William Aitken and John Reppy. Abstract value constructors. Technical Report TR 92-1290, Cornell University, 1992.
5. Michael Barr and Charles Wells. Toposes, Triples and Theories, chapter 9. Number 278 in Grundlehren der Mathematischen Wissenschaften. Springer, New York, 1984.
6. Richard Bird and Oege de Moor. Algebra of Programming. Prentice Hall, 1997.
7. Richard Bird and Ross Paterson. de Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1):77-92, 1999.
8. Janusz Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, 1964.
9. Jean-Christophe Filliâtre. Backtracking iterators. Technical Report 1428, CNRS-LRI, January 2006.
10. Jeremy Gibbons. Datatype-generic programming. In Roland Backhouse, Jeremy Gibbons, Ralf Hinze, and Johan Jeuring, editors, Spring School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science. Springer-Verlag, 2007. To appear.
11. Thomas Hallgren. Fun with functional dependencies. In Joint Winter Meeting of the Departments of Science and Computer Engineering, Chalmers University of Technology and Goteborg University, Varberg, Sweden., January 2001.
12. Ralf Hinze, Johan Jeuring, and Andres Löh. Type-indexed data types. Science of Computer Programmming, 51:117-151, 2004.
13. Martin Hofmann and Steffen Jost. Static prediction of heap space usage for first-order functional programs. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 185-197. ACM, 2003.
14. Geŕard Huet. The Zipper. Journal of Functional Programming, 7(5):549-554, 1997.
15. Patrik Jansson and Johan Jeuring. PolyP - a polytypic programming language extension. In Proceedings of POPL '97, pages 470-482. ACM, 1997.
16. André Joyal. Foncteurs analytiques et espéces de structures. In Combinatoire énumérative, number 1234 in LNM, pages 126-159. 1986.
17. Conor McBride. The Derivative of a Regular Type is its Type of One-Hole Contexts. Available at http://www.cs.nott.ac.uk/~ctm/diff.pdf, 2001.
18. Conor McBride. Faking It (Simulating Dependent Types in Haskell). Journal of Functional Programming, 12(4 & 5):375-392, 2002. Special Issue on Haskell.
19. Matthias Neubauer, Peter Thiemann, Martin Gasbichler, and Michael Sperber. A Functional Notation for Functional Dependencies. In The 2001 ACM SIGPLAN Haskell Workshop, Firenze, Italy, September 2001.
20. Simon Peyton Jones, Mark Jones, and Erik Meijer. Type classes: an exploration of the design space. In Proceedings of the Haskell Workshop, Amsterdam, The Netherlands, June 1997.
21. Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad hoc. In 16th ACM Symposium on Principles of Programming Languages, pages 60-76. ACM, January 1989.