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.

Full text not available from this repository.

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)
RIS ID: https://nottingham-repository.worktribe.com/output/1024975
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 1992/R1
Depositing User: Hutton, Graham
Date Deposited: 26 Oct 2005
Last Modified: 04 May 2020 20:33
URI: http://eprints.nottingham.ac.uk/id/eprint/241

Actions (Archive Staff Only)

Edit View Edit View