Polytypic programming with ease (Extended abstract)

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

Volumn 1722, Issue , 1999, Pages 21-36

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER CIRCUITS; FORESTRY; LOGIC PROGRAMMING; SEMANTICS;

DATA TYPE; EXTENDED ABSTRACTS; INFINITE TREES; INITIAL ALGEBRAS; LEVEL OF ABSTRACTION; NESTED DATATYPES; POLYTYPIC FUNCTIONS; POLYTYPIC PROGRAMMING;

FUNCTIONAL PROGRAMMING;

EID: 84957647250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_2     Document Type: Conference Paper

References (22)

1. M. Abadi, L. Cardelli, B. Pierce, and D. Rémy. Dynamic typing in polymorphic languages. J. Functional Programming, 5(1):111-130, January 1995. 27
2. Richard Bird. Introduction to Functional Programming using Haskell. Prentice Hall Europe, London, 2nd edition, 1998. 22
3. Richard Bird, Oege de Moor, and Paul Hoogendijk. Generic functional programming with types and relations. J. Functional Programming, 6(1):1-28, Jan. 1996. 33
4. Richard Bird and Lambert Meertens. Nested datatypes. In J. Jeuring, editor, Fourth International Conference on Mathematics of Program Construction, MPC’98, LNCS 1422, pages 52-67. Springer-Verlag, June 1998. 22
5. Bruno Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25 (2):95-169, March 1983. 26, 27
6. Ralf Hinze. Generalizing generalized tries. J. Functional Programming, 1999. Accepted for publication. 21, 34
7. Ralf Hinze. Polytypic functions over nested datatypes. Discrete Mathematics and Theoretical Computer Science, 1999. Accepted for publication. 32
8. Ralf Hinze. Polytypic programming with ease. Technical Report IAI-TR-99-2, Institut für Informatik III, Universität Bonn, February 1999. 26, 34
9. P. Jansson and J. Jeuring. Polytypic compact printing and parsing. In S. Doaitse Swierstra, editor, Proceedings European Symposium on Programming, ESOP’99, LNCS 1576, pages 273-287. Springer-Verlag, 1999. 21
10. Patrik Jansson and Johan Jeuring. PolyP—a polytypic programming language extension. In 24th Symposium on Principles of Programming Languages, POPL’97, pages 470-482. ACM-Press, January 1997. 26, 32
11. Patrik Jansson and Johan Jeuring. Functional Pearl: Polytypic unification. J. Functional Programming, 8(5):527-536, September 1998. 33
12. Patrik Jansson and Johan Jeuring. PolyLib—A library of polytypic functions. In Roland Backhouse and Tim Sheard, editors, Informal Proceedings Workshop on Generic Programming, WGP’98. Department of Computing Science, Chalmers University of Technology and Goäteborg University, http://wsinwp01.win.tue.nl:1234/WGPProceedings/index.html, June 1998. 31, 33
13. Mark P. Jones. Functional programming with overloading and higher-order polymorphism. In First International Spring School on Advanced Functional Programming Techniques, LNCS 925, pages 97-136. Springer-Verlag, 1995. 30, 34
14. M.P. Jones and J.C. Peterson. Hugs 98 User Manual, May 1999. Available from http://www.haskell.org/hugs. 30
15. Nancy Jean McCracken. The typechecking of programs with implicit type structure. In Gilles Kahn, David B. MacQueen, and Gordon D. Plotkin, editors, Semantics of Data Types, LNCS 173, pages 301-315. Springer-Verlag, 1984. 30
16. Lambert Meertens. Calculate polytypically! In H. Kuchen and S.D. Swierstra, editors, 8th International Symposium on Programming Languages: Implementations, Logics, and Programs, PLILP’96, LNCS 1140, pages 1-16. Springer-Verlag, September 1996. 31, 31, 34
17. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In 5th Conference on Functional Programming Languages and Computer Architecture, FPCA’91, LNCS 523, pages 124-144. Springer-Verlag, 1991. 33
18. Erik Meijer and Graham Hutton. Bananas in space: Extending fold and unfold to exponential types. In 7th Conference on Functional Programming Languages and Computer Architecture, FPCA 95, pages 324-333. ACM-Press, June 1995. 34
19. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998. 27
20. Simon Peyton Jones. Explicit quantification in Haskell, 1998. Available from research.microsoft.com/Users/simonpj/Haskell/quantification.html. 30
21. Simon Peyton Jones and John Hughes, editors. Haskell 98 — A Non-strict, Purely Functional Language. http://www.haskell.org/onlinereport/. February 1999. 22
22. Zhe Yang. Encoding types in ML-like languages. SIGPLAN Notices, 34(1):289-300, January 1999. 27