International Conference on Mathematics of Program Construction

MPC 2000: Mathematics of Program Construction pp 28-44

The Zip Calculus

  • Mark Tullsen
Conference paper

DOI: 10.1007/10722010_3

Volume 1837 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Tullsen M. (2000) The Zip Calculus. In: Backhouse R., Oliveira J.N. (eds) Mathematics of Program Construction. MPC 2000. Lecture Notes in Computer Science, vol 1837. Springer, Berlin, Heidelberg


Many have recognized the need for genericity in programming and program transformation. Genericity over data types has been achieved with polymorphism. Genericity over type constructors, often called polytypism, is an area of active research. This paper proposes that another kind of genericity is needed: genericity over the length of tuples. Untyped languages allow for such genericity but typed languages do not (except for languages allowing dependent types). The contribution of this paper is to present the “zip calculus,” a typed lambda calculus that provides genericity over the length of tuples and yet does not require the full generality of dependent types.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Mark Tullsen
    • 1
  1. 1.Department of Computer ScienceYale UniversityNew Haven