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.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
271Kb

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.

Item Type:Monograph (Technical Report)
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:241
Deposited By:Hutton, Graham
Deposited On:26 Oct 2005
Last Modified:09 Oct 2007 16:50

Repository Staff Only: item control page