Polytypic compact printing and parsing

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

Volumn 1576, Issue , 1999, Pages 273-287

  Jansson, Patrik ^a   Jeuring, Johan ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350520835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49099-X_18     Document Type: Conference Paper

References (17)

1. R. Backhouse, P. Jansson, J. Jeuring, and L. Meertens. Generic programming | an introduction. To appear in AFP'98, LNCS, Springer-Verlag, 1998.
2. R.C. Backhouse, P.J. de Bruin, P. Hoogendijk, G. Malcolm, T.S. Voermans, and J.C.S.P. van der Woude. Relational catamorphisms. In B. Möller, editor, Constructing Programs from Specifications, pages 287-318. North-Holland, 1991.
3. Timothy C. Bell, John G. Cleary, and Ian H. Witten. Text Compression. Prentice Hall, 1990.
4. R.S. Bird and O. de Moor. Algebra of Programming. Prentice-Hall International, 1996.
5. Algorithmic Research B.V. SDR compression products. See http://www.algoresearch.com/, 1998.
6. Robert D. Cameron. Source encoding using syntactic information source models. IEEE Transactions on Information Theory, 34(4):843-850, 1988.
7. J. Halenbeek. Comparing approaches to generic programming. Master's thesis, Department of Computer Science, Utrecht University, 1998. To appear.
8. John Hughes. Generalising monads. Invited talk at MPC'98, 1998. Slides available from http://www.md.chalmers.se/Conf/MPC98/talks/JohnHughes/.
9. P. Jansson and J. Jeuring. PolyP-a polytypic programming language extension. In POPL'97, pages 470-482. ACM Press, 1997.
10. J. Jeuring and P. Jansson. Polytypic programming. In AFP'96, volume 1129 of LNCS, pages 68-114. Springer-Verlag, 1996.
11. L. Meertens. Calculate polytypically! In PLILP'96, volume 1140 of LNCS, pages 1-16. Springer Verlag, 1996.
12. Erik Meijer. Calculating compilers. PhD thesis, Nijmegen University, 1992.
13. Mathematics of Program Construction Group (Eindhoven Technical University). Fixed-point calculus. Information Processing Letters, 53(3):131-136, 1995.
14. Swierstra S.D. and L. Duponcheel. Deterministic, error-correcting combinator parsers. In John Launchbury, Erik Meijer, and Tim Sheard, editors, Advanced Functional Programming, LNCS 1129, pages 184-207. Springer-Verlag, 1996.
15. R.G. Stone. On the choice of grammar and parser for the compact analytical encoding of programs. The Computer Journal, 29(4):307-314, 1986.
16. M. Wallace and C. Runciman. Heap compression and binary I/O in haskell. In 2nd ACM Haskell Workshop, 1997.
17. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343,1977.