Abstract
Shapely types separate data, represented by lists, from shape, or structure. This separation supports shape polymorphism, where operations are defined for arbitrary shapes, and shapely operations, for which the shape of the result is determined by that of the input, permitting static shape checking. They include both arrays and the usual algebraic types (of trees, graphs, etc.), and are closed under the formation of initial algebras.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C.R. Banger and D.B. Skillicorn. A foundation for theories of arrays. Queen's University, Canada, 1993.
R. Bird and P. Wadler. Introduction to Functional Programming. International Series in Computer Science. Prentice Hall, 1988.
J.R.B. Cockett and T. Fukushima. About charity. University of Calgary preprint, 1992.
A. Carboni, S. Lack, and R.F.C. Walters. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra, 84:145–158, 1993.
J.R.B. Cockett. List-aritmetic distributive categories: locoi. Journal of Pure and Applied Algebra, 66:1–29, 1990.
J. R. B. Cockett and D. Spencer. Strong categorical datatypes. In R. A. G. Seely, editor, International Meeting on Category Theory 1991, Canadian Mathematical Society Proceedings. American Mathematics Society, Montreal, 1992.
C.B. Jay. Matrices, monads and the fast fourier transform. Technical Report UTS-SOCS-93.13, University of Technology, Sydney, 1993.
C.B. Jay. Tail recursion through universal invariants. Theoretical Computer Science, 115:151–189, 1993.
C.B. Jay and J.R.B. Cockett. Shapely types and shape polymorphism: Extended version. Technical Report UTS-SOCS-94-??, University of Technology, Sydney, 1994.
G. Jones. Deriving the fast fourier transform algorithm by calculation. In Functional programming, Glasgow 1989, Springer Workshops in Computing. Springer Verlag, 1990.
E. Manes. Predicate Transformer Semantics, volume 33 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
M. Smith and G. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, 11, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jay, C.B., Cockett, J.R.B. (1994). Shapely types and shape polymorphism. In: Sannella, D. (eds) Programming Languages and Systems — ESOP '94. ESOP 1994. Lecture Notes in Computer Science, vol 788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57880-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-57880-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57880-2
Online ISBN: 978-3-540-48376-2
eBook Packages: Springer Book Archive