There and back again: arrows for invertible programming

There and back again: arrows for invertible programming (2006)

Cached

Download Links

[www.cs.ru.nl]
[www.cs.ru.nl]
[www.cs.ru.nl]

Other Repositories/Bibliography

DBLP

by Artem Alimarine , Sjaak Smetsers , Arjen Weelden , Marko Eekelen , Rinus Plasmeijer

Venue:	In Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Citations:	5 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	There and back again: arrows for invertible programming	INFERENCE
AUTHOR NAME	Artem Alimarine	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute for Computing and Information Sciences,; Radboud University Nijmegen,	SVM HeaderParse 0.2
AUTHOR ADDR	Toernooiveld 1, 6525 ED Nijmegen, The Netherlands.	SVM HeaderParse 0.2
AUTHOR NAME	Sjaak Smetsers	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute for Computing and Information Sciences,; Radboud University Nijmegen,	SVM HeaderParse 0.2
AUTHOR ADDR	Toernooiveld 1, 6525 ED Nijmegen, The Netherlands.	SVM HeaderParse 0.2
AUTHOR NAME	Arjen Weelden	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute for Computing and Information Sciences,; Radboud University Nijmegen,	SVM HeaderParse 0.2
AUTHOR ADDR	Toernooiveld 1, 6525 ED Nijmegen, The Netherlands.	SVM HeaderParse 0.2
AUTHOR NAME	Marko Eekelen	SVM HeaderParse 0.2
AUTHOR NAME	Rinus Plasmeijer	SVM HeaderParse 0.2
AUTHOR AFFIL	Algorithms	SVM HeaderParse 0.2
ABSTRACT	Invertible programming occurs in the area of data conversion where it is required that the conversion in one direction is the inverse of the other. For that purpose, we introduce bidirectional arrows (biarrows). The bi-arrow class is an extension of Haskell’s arrow class with an extra combinator that changes the direction of computation. The advantage of the use of bi-arrows for invertible programming is the preservation of invertibility properties using the biarrow combinators. Programming with bi-arrows in a polytypic or generic way exploits this the most. Besides bidirectional polytypic examples, including invertible serialization, we give the definition of a monadic bi-arrow transformer, which we use to construct a bidirectional parser/pretty printer.	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	In Proceedings of the 2005 ACM SIGPLAN workshop on Haskell	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	86--97	INFERENCE
CITATIONS	21 found	ParsCit 1.0