Foundations for structured programming with GADTs

ACM SIGPLAN Notices

Volumn 43, Issue 1, 2008, Pages 297-308

  Johann, Patricia ^a   Ghani, Neil ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Languages; Theory

Indexed keywords

FUNCTIONAL PROGRAMMING; QUERY LANGUAGES; SEMANTICS; STRUCTURED PROGRAMMING;

CUTTING EDGES; EXISTENTIAL QUANTIFICATIONS; INITIAL ALGEBRAS; KAN EXTENSION; SEMANTIC FOUNDATION; STANDARD THEORIES; TECHNICAL IDEAS; THEORY;

ALGEBRA;

EID: 67650178831     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1328897.1328475     Document Type: Article

References (27)

1. E. S. Bainbridge, P. J. Freyd, A. Scedrov and P. J. Scott. Functorial polymorphism. Theoretical Computer Science 70(1) (1990), pp. 35-64.
2. I. Bayley. Generic Operations on Nested Datatypes. Ph.D. Dissertation, Univ. of Oxford, 2001. At http://web.comlab.ox.ac.uk/oucl/research/areas/ap/ papers/bayley-thesis.pdf
3. P. Blampied. Structured Recursion for Non-uniform Data-types. Ph.D. Dissertation, Univ. of Nottingham, 2000. At http://www.cs.nott.ac.uk/Research/ fop/blampied-thesis.pdf
4. Bird, R. and Meertens, L. Nested datatypes. Proc., Mathematics of Program Construction, pp. 52-67, 1998.
5. R. Bird and R. Paterson. de Bruijn notation as a nested datatype. Journal of Functional Programming 9(1) (1998), pp. 77-91.
6. R. Bird and R. Paterson. Generalised folds for nested datatypes. Formal Aspects of Computing 11(2) (1999), pp. 200-222.
7. J. Cheney and R. Hinze. First-class phantom types. At http://www.informatik.uni-bonn.de/~ralf/publications/Phantom.pdf
8. P. Dybjer. Inductive Families. Formal Aspects of Computing 6(4), pp. 440-465, 1994.
9. A. Gill, J. Launchbury, and S. L. Peyton Jones. A short cut to deforestation. Proceedings, Functional Programming Languages and Computer Architecture, pp. 223-232, 1993.
10. N. Ghani, P. Johann, T. Uustalu, and V. Vene. Monadic augment and generalised short cut fusion. Proceedings, International Conference on Functional Programming, pp. 294-305, 2005.
11. N. Ghani, T. Uustalu, and V. Vene. Build, augment and destroy. Universally. Proceedings, Asian Symposium on Programming Languages, pp. 327-347, 2003.
12. P. Johann and N. Ghani. Initial algebra semantics is enough! Proceedings, Typed Lambda Calculus and Applications, pp. 207-222, 2007.
13. P. Johann and N. Ghani. Programming with Nested Types. Submitted, 2007.
14. P. Johann. A generalization of short-cut fusion and its correctness proof. Higher-order and Symbolic Computation 15 (2002), pp. 273-300.
15. MacLane, S. Categories for the Working Mathematician. Springer-Verlag, 1971.
16. C. Martin, J. Gibbons, and I. Bayley. Disciplined efficient generalised folds for nested datatypes. Formal Aspects of Computing 16(1) (2004), pp. 19-35.
17. C. McBride. Epigram: Practical programming with dependent types. Proceedings, 5th International Summer School on Advanced Functional Programming, 2004. At http://www.e-pig.org/downloads/epigram-notes.pdf
18. The Omega Download Page. http://web.cecs.pdx.edu/~sheard/Omega/index.html
19. F. Pfenning and C. Paulin-Mohring. Inductively defined types in the Calculus of Constructions. Proceedings, Mathematical Foundations of Programming Semantics, pp. 209-228, 1990.
20. T. Sheard, J. Hook, and N. Linger. GADTs + extensible kinds = dependent programming. At http://www.cs.pdx.edu/~sheard/papers/GADT+ExtKinds.ps
21. T. Sheard and E. Pasalic. Meta-programming with built-in type equality. Proceedings, Logical Frameworks and Metalanguages, 2004. At http://homepage.mac. com/pasalic/p2/papers/LFM04.pdf
22. M. Sulzmann and M. Wang. A systematic translation of guarded recursive data types to existential types. At http://www.comp.nus.edu.sg/~sulzmann/ research/ms.html
23. M. Sulzmann and M. Wang. Translating generalized algebraic data types to System F. Manuscript, 2005. At http://www.comp. nus.edu.sg/~sulzmann/manuscript/ simple-translate-gadts. ps
24. J. Svenningsson. Shortcut fusion for accumulating parameters & zip-like functions. Proceedings, International Conference on Functional Programming, pp. 124-132, 2002.
25. A. Takano and E. Meijer. Shortcut deforestation in calculational form. Proceedings, Functional Programming Languages and Computer Architecture, pp. 306-313, 1995.
26. H. Xi, C. Chen, and G. Chen. Guarded recursive datatype constructors. Proceedings, Principles of Programming Languages, pp. 224-235, 2003.
27. H. Xi and F. Pfenning. Dependent types in practical programming. Proceedings, Principles of Programming Languages, pp. 214-227, 1999.