Disciplined, efficient, generalised folds for nested datatypes

Formal Aspects of Computing

Volumn 16, Issue 1, 2004, Pages 19-35

  Martin, Clare ^a   Gibbons, Jeremy ^b   Bayley, Ian ^b  

^a OXFORD BROOKES UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Fold; Functor category; Nested datatype; Non regular datatype; Non uniform datatype; Polymor phic recursion; Universal property

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DATA PROCESSING; PARAMETER ESTIMATION; RANDOM PROCESSES; SEMANTICS; THEOREM PROVING; TREES (MATHEMATICS);

FOLDS; FUNCTOR CATEGORY; NESTED DATATYPES; NON-REGULAR DATATYPES; NON-UNIFORM DATATYPES; POLYMORPHIC RECURSION; UNIVERSAL PROPERTY;

LINEAR SYSTEMS;

EID: 13644275658     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-003-0013-6     Document Type: Conference Paper

References (15)

1. [BiM98] Bird R, Meertens L (1998) Nested datatypes. In: LNCS 1422: Mathematics of program construction, Springer, Berlin Heidelberg New York, pp 52-67
2. [BiM97] Bird R, de Moor O (1997) Algebra of programming. Prentice-Hall
3. [BiP99a] Bird R, Paterson R (1999) De Bruijn notation as a nested datatype. J Funct Program 9(1):77-91
4. [BiP99b] Bird R, Paterson R (1999) Generalised folds for nested datatypes. Formal Aspects Comput 11:200-222
5. [GHA01]. Gibbons J, Hutton G, Altenkirch T (2001) When is a function a fold or an unfold? Electronic Notes Theor Comput Sci 44(1)
6. [Hin00] Hinze R (2000) Efficient generalized folds. In: Johan Jeuring (ed) Proceedings of the Second Workshop on Generic Programming, WGP 2000, Ponte de Lima, Portugal, 6 July 2000
7. [Hue75] Huet GP (1975) A unification algorithm for typed λ-calculus. Theor Comput Sci 1:27-57
8. [Jon95] Jones MP (1995) Functional programming with overloading and higher-order polymorphism. In: LNCS 925: First International Spring School on Advanced Functional Programming Techniques, Springer, Berlin Heidelberg New York, pp 97-136
9. [Mac98] Mac Lane S (1998) Categories for the working mathematician, 2nd edn. Springer, Berlin Heidelberg New York
10. [MaG01] Martin CE, Gibbons J (2001) On the semantics of nested datatypes. Inf Processing Lett 80:233-238
11. [MaA86] Manes EG, Arbib MA (1986) Algebraic approaches to program semantics. Texts and Monographs in Computer Science, Springer, Berlin Heidelberg New York
12. [Mee87] Meertens LGLT (1987) First steps towards the theory of rose trees. Draft report, CWI, Amsterdam
13. [Oka98] Okasaki C (1998) Purely functional data structures. Cambridge University Press
14. [Pey03] Peyton Jones S (ed) (2003) Haskell 98 language and libraries: the revised report. Cambridge University Press
15. [UuV99] Uustalu T, Vene V (1999) Mendler-style inductive types, categorically. Nord J Comput 6(3):343-361