Research Repository

See what's under the surface

A Calculational Theory of Pers as Types

Hutton, Graham; Voermans, Ed

Authors

Ed Voermans

Abstract

In the calculational approach to programming, programs are derived from specifications by algebraic reasoning. This report presents a calculational programming framework based upon the notion of binary relations as programs, and partial equivalence relations (pers) as types. Working with relations as programs generalises the functional paradigm, admiting non-determinism and the use of relation converse. Working with pers as types permits a natural treatment of types that are subject to laws and restrictions.

Book Type Monograph
Publication Date Jan 1, 1992
Peer Reviewed Not Peer Reviewed
Institution Citation Hutton, G., & Voermans, E. (1992). A Calculational Theory of Pers as Types. Department of Computing Science
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf

Files

pers.pdf (278 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf




You might also like


Downloadable Citations