Initial algebra semantics is enough!

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4583 LNCS, Issue , 2007, Pages 207-222

  Johann, Patricia ^a   Ghani, Neil ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION; RECURSIVE FUNCTIONS;

CONVENTIONAL WISDOM; FOLD COMBINATOR; MODERN FUNCTIONAL PROGRAMMING LANGUAGES;

SEMANTICS;

EID: 38149055038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73228-0_16     Document Type: Conference Paper

References (23)

1. Abel, A., Matthes, R., Uustalu, T.: Iteration schemes for higher-order and nested datatypes. Theoretical Computer Science 333(1-2), 3-66 (2005)
2. Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. Proc. Computer Science Logic, pp. 453-468 (1999)
3. Bayley, I.: Generic Operations on Nested Datatypes. Ph.D. Dissertation, University of Oxford (2001)
4. Bird, R., Meertens, L.: Nested datatypes. Proc. Mathematics of Program Construction, pp. 52-67 (1998)
5. Bird, R., Paterson, R.: de Bruijn notation as a nested datatype. Journal of Functional Programming 9(1), 77-91 (1998)
6. Bird, R., Paterson, R.: Generalised folds for nested datatypes. Formal Aspects of Computing 11(2), 200-222 (1999)
7. Blampied, P.: Structured Recursion for Non-uniform Data-types. Ph.D. Dissertation, University of Nottingham (2000)
8. Fiore, M., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. Proc. Logic in Computer Science, pp. 193-202 (1999)
9. Gill, A.: Cheap Deforestation for Non-strict Functional Languages. Ph.D. Dissertation, Glasgow University (1996)
10. Gill, A., Launchbury, J., Peyton Jones, S.L.: A short cut to deforestation. Proc. Functional Programming Languages and Computer Architecture, pp. 223-232 (1993)
11. Ghani, N., Haman, M., Uustalu, T., Vene, V.: Representing cyclic structures as nested types. Presented at Trends in Functional Programming (2006)
12. Ghani, N., Johann, P., Uustalu, T., Vene, V.: Monadic augment and generalised short cut fusion. Proc. International Conference on Functional Programming, pp. 294-305 (2005)
13. Ghani, N., Uustalu, T., Vene, V.: Build, augment and destroy. Universally. Proc. Asian Symposium on Programming Languages, pp. 327-347 (2003)
14. Hinze, R.: Polytypic functions over nested datatypes. Discrete Mathematics and Theoretical Computer Science 3(4), 193-214 (1999)
15. Hinze, R.: Efficient generalized folds. Proc. Workshop on Generic Programming (2000)
16. Hinze, R.: Functional Pearl: Perfect trees and bit-reversal permutations. Journal of Functional Programming 10(3), 305-317 (2000)
17. Hinze, R.: Manufacturing datatypes. Journal of Functional Programming 11(5), 493-524 (2001)
18. Johann, P.: A generalization of short-cut fusion and its correctness proof. Higherorder and Symbolic Computation 15, 273-300 (2002)
19. MacLaue, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)
20. Martin, C., Gibbons, J., Bayley, I.: Disciplined efficient generalised folds for nested datatypes. Formal Aspects of Computing 16(1), 19-35 (2004)
21. McBride, C., McKinna, J.: View from the left. Journal of Functional Programming 14(1), 69-111 (2004)
22. Pitts, A.: Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10, 1-39 (2000)
23. Takano, A., Meijer, E.: Shortcut deforestation in calculational form. Proc. Functional Programming Languages and Computer Architecture, pp. 306-313 (1995)