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.
CITATION STYLE
Jay, C. B., & Cockett, J. R. B. (1994). Shapely types and shape polymorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 788 LNCS, pp. 302–316). Springer Verlag. https://doi.org/10.1007/3-540-57880-3_20
Mendeley helps you to discover research relevant for your work.