A Class of Commuting Relators

A Class of Commuting Relators (1992)

Cached

Download Links

[www.cs.nott.ac.uk]

by Roland Backhouse , Henk Doornbos , Paul Hoogendijk

Venue:	Utrecht University, Dept Computer Science
Citations:	9 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Class of Commuting Relators	user correction - Legacy Corrections
AUTHOR NAME	Roland Backhouse	user correction - Legacy Corrections
AUTHOR NAME	Henk Doornbos	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Mathematics and Computing Science,; Eindhoven University of Technology,	user correction - Legacy Corrections
AUTHOR ADDR	P.O. Box 513,; 5600 MB Eindhoven,	user correction - Legacy Corrections
AUTHOR NAME	Paul Hoogendijk	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Mathematics and Computing Science,; Eindhoven University of Technology,	user correction - Legacy Corrections
AUTHOR ADDR	P.O. Box 513,; 5600 MB Eindhoven,	user correction - Legacy Corrections
ABSTRACT	The zip function is well known to functional programmers. Informally, zip maps two lists of the same length into a single list of pairs whereby ([a 1 ; b 1 ; :::]; [a 2 ; b 2 ; :::]) 7! [(a 1 ; b 1 ); (a 2 ; b 2 ); :::]. Zip is just one of a whole family of functions that commute the order of two data structures. Whilst zip commutes a pair of lists into a list of pairs, it is not difficult to imagine generalising zip to a function that commutes m lists each of length n into n lists each of length m. Indeed, this latter function is also well known under the name matrix transposition. With a little bit more imagination several other members of the family suggest themselves. For example, there is a function that commutes a tree of lists all of the same length into a list of trees all of the same shape. There is also a function that commutes a rose of trees all of the same shape into a tree of roses all of the same shape. This paper considers the construction of such functions. We specif...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Utrecht University, Dept Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
TECH	Technical report, Technische	INFERENCE
CITATIONS	1 found	ParsCit 1.0