A Calculational Theory of Pers as Types
Hutton, Graham and Voermans, Ed (1992) A Calculational Theory of Pers as Types. Technical Report: 1992/R1. Department of Computing Science, University of Glasgow.
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.
Repository Staff Only: item control page