Skip to main content

Research Repository

Advanced Search

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.

Citation

Hutton, G., & Voermans, E. (1992). A Calculational Theory of Pers as Types. Department of Computing Science

Book Type Monograph
Publication Date Jan 1, 1992
Deposit Date Oct 26, 2005
Publicly Available Date Oct 9, 2007
Peer Reviewed Not Peer Reviewed
Public URL http://eprints.nottingham.ac.uk/id/eprint/241
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/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