The zip calculus

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

Volumn 1837, Issue , 2000, Pages 28-44

  Tullsen, Mark ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS);

DATA TYPE; DEPENDENT TYPES; GENERICITY; POLYTYPISM; PROGRAM TRANSFORMATIONS; TYPED LAMBDA CALCULUS;

CALCULATIONS;

EID: 84976508572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722010_3     Document Type: Conference Paper

References (19)

1. Lennart Augustsson. Cayenne — a language with dependent types. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP’98), volume 34(1) of ACM SIGPLAN Notices, pages 239-250. ACM, June 1999.
2. H. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science. Oxford University Press, Oxford, 1992.
3. Richard Bird and Oege de Moor. Algebra of Programming. Prentice Hall, 1997.
4. Benedict R. Gaster and Mark P. Jones. A polymorphic type system for extensible records and variants. Technical report NOTTCS-TR-96-3, University of Nottingham, Languages and Programming Group, Department of Computer Science, Nottingham NG7 2RD, UK, November 1996.
5. Paul Ferenc Hoogendijk. A Generic Theory of Datatypes. PhD thesis, Dept. of Math. and Computing Science, Eindhoven Univ. of Technology, 1997.
6. P. Hudak, S. P. Jones, and P. Wadler. Report on the programming language Haskell. SIGPLAN Notices, 27(5), May 1992.
7. Gérard Huet and Bernard Lang. Proving and applying program transformations expressed with second order patterns. Acta Informatica, 11: 31-55, 1978.
8. P. Jansson and J. Jeuring. PolyP - a polytypic programming language extension. In POPL’97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470-482. ACM Press, 1997.
9. C. B. Jay, G. Bellè, and E. Moggi. Functorial ML. Journal of Functional Programming, 8(6): 573-619, 1998.
10. G. R. Malcolm. Data structures and program transformation. Science of Computer Programming, 14: 255-279, 1990.
11. Grant Malcolm. Algebraic Data Types and Program Transformation. PhD thesis, University of Groningen, 1990.
12. L. Meertens. Algorithmics - towards programming as a mathematical activity. In J. W. de Bakker, E. M. Hazewinkel, and J. K. Lenstra, editors, Proceedings of the CWI Symposium on Mathematics and Computer Science, pages 289-334. North-Holland, 1986. CWI Monographs, volume 1.
13. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In John Hughes, editor, Functional Programming Languages and Computer Architecture, pages 124-144. Springer Verlag, June 1991. LNCS 523.
14. Atsushi Ohori. A polymorphic record calculus and its compilation. ACM Transactions on Programming Languages and Systems, 17(6): 844-895, November 1995.
15. Simon Peyton Jones and Erik Meijer. Henk: a typed intermediate language. In Proc. 1997 ACM SIGPLAN Workshop on Types in Compilation (TIC’97), Amsterdam, The Netherlands, June 1997.
16. Mark Tullsen. First class patterns. In E. Pontelli and V. Santos Costa, editors, Second International Workshop on Practical Aspects of Declarative Languages (PADL’00), volume 1753 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, January 2000.
17. L. S. Van Benthem Jutting, J. McKinna, and R. Pollack. Checking algorithms for pure type systems. Lecture Notes in Computer Science, 806: 19-61, 1994.
18. P. Wadler. Theorems for free! In Functional Programming Languages and Computer Architecture. Springer Verlag, 1989.
19. M. Wand. Complete type inference for simple objects. In Proc. IEEE Symp. On Logic in Computer Science, pages 37-44, 1987. Corrigendum in Proc. IEEE Symp. on Logic in Computer Science, page 132, 1988.