Beyond fun: Order and membership in polytypic imperative programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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.

Original languageEnglish
Title of host publicationMathematics of Program Construction - 4th International Conference, MPC 1998, Proceedings
EditorsJohan Jeuring
Pages286-314
Number of pages29
DOIs
StatePublished - 1998
Event4th International Conference on Mathematics of Program Construction, MPC 1998 - Marstrand, Sweden
Duration: 15 Jun 199817 Jun 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1422
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Mathematics of Program Construction, MPC 1998
Country/TerritorySweden
CityMarstrand
Period15/06/9817/06/98

Fingerprint

Dive into the research topics of 'Beyond fun: Order and membership in polytypic imperative programming'. Together they form a unique fingerprint.

Cite this