When Do Datatypes Commute?

When Do Datatypes Commute? (1997)

Cached

Download Links

[www.cs.nott.ac.uk]

Other Repositories/Bibliography

DBLP

by Paul Hoogendijk , Roland Backhouse

Venue:	Category Theory and Computer Science, 7th International Conference, volume 1290 of LNCS
Citations:	14 - 3 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	When Do Datatypes Commute?	user correction - Legacy Corrections
AUTHOR NAME	Paul Hoogendijk	user correction - Legacy Corrections
AUTHOR AFFIL	; Department of Mathematics and Computing Science,; Eindhoven University of Technology,; The Netherlands.	user correction - Legacy Corrections
AUTHOR ADDR	; P.O. Box 513,; 5600 MB Eindhoven,	user correction - Legacy Corrections
AUTHOR NAME	Roland Backhouse	user correction - Legacy Corrections
ABSTRACT	Polytypic programs are programs that are parameterised by type constructors (like List), unlike polymorphic programs which are parameterised by types (like Int). In this paper we formulate precisely the polytypic programming problem of "commuting " two datatypes. The precise formulation involves a novel notion of higher order polymorphism. We demonstrate via a number of examples the relevance and interest of the problem, and we show that all "regular datatypes" (the sort of datatypes that one can define in a functional programming language) do indeed commute according to our specification. The framework we use is the theory of allegories, a combination of category theory with the point-free relation calculus. 1 Polytypism The ability to abstract is vital to success in computer programming. At the macro level of requirements engineering the successful designer is the one able to abstract from the particular wishes of a few clients a general purpose product that can capture a l...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	Category Theory and Computer Science, 7th International Conference, volume 1290 of LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	242--260	INFERENCE
VOLUME	1290	INFERENCE
CITATIONS	23 found	ParsCit 1.0