@inproceedings{c97acd57ba8641f28fd123ed58fdfeee,
title = "Beyond fun: Order and membership in polytypic imperative programming",
abstract = "We argue that the category of transformers of monotonic predicates on posers is superior to the category of transformers on powersets, as the basis for a calculus of higher order imperative programming. We show by an example polytypic program derivation that such transformers (and the underlying categories of order-compatible relations and monotonic functions) model a calculus quite similar to the more familiar calculus of functional programs and relations. The derived program uses as a data type an exponent of transformers; unlike function-space, this transformer-space is adequate for semantics of higher order imperative programs.",
author = "Naumann, \{David A.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 4th International Conference on Mathematics of Program Construction, MPC 1998 ; Conference date: 15-06-1998 Through 17-06-1998",
year = "1998",
doi = "10.1007/bfb0054296",
language = "English",
isbn = "3540645918",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "286--314",
editor = "Johan Jeuring",
booktitle = "Mathematics of Program Construction - 4th International Conference, MPC 1998, Proceedings",
}