Shapely types and shape polymorphism

37Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

References Powered by Scopus

Introduction to extensive and distributive categories

190Citations
N/AReaders
Get full text

List-arithmetic distributive categories: Locoi

23Citations
N/AReaders
Get full text

Tail recursion through universal invariants

4Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Introduction to coalgebra: Towards mathematics of states and observation

112Citations
N/AReaders
Get full text

Symmetric lenses

76Citations
N/AReaders
Get full text

Polynomial functors and polynomial monads

73Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

60%

PhD / Post grad / Masters / Doc 2

40%

Readers' Discipline

Tooltip

Computer Science 5

71%

Mathematics 1

14%

Engineering 1

14%

Save time finding and organizing research with Mendeley

Sign up for free