A Calculational Theory of Pers as Types
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...
| Main Authors: | , |
|---|---|
| Format: | Monograph |
| Published: |
Department of Computing Science
1992
|
| Online Access: | https://eprints.nottingham.ac.uk/241/ |
| _version_ | 1848790377518071808 |
|---|---|
| author | Hutton, Graham Voermans, Ed |
| author_facet | Hutton, Graham Voermans, Ed |
| author_sort | Hutton, Graham |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:11:39Z |
| format | Monograph |
| id | nottingham-241 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:39Z |
| publishDate | 1992 |
| publisher | Department of Computing Science |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-2412020-05-04T20:33:48Z https://eprints.nottingham.ac.uk/241/ A Calculational Theory of Pers as Types Hutton, Graham Voermans, Ed 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. Department of Computing Science 1992-01 Monograph NonPeerReviewed Hutton, Graham and Voermans, Ed (1992) A Calculational Theory of Pers as Types. Technical Report: 1992/R1. Department of Computing Science, University of Glasgow. 1992/R1 1992/R1 |
| spellingShingle | Hutton, Graham Voermans, Ed A Calculational Theory of Pers as Types |
| title | A Calculational Theory of Pers as Types |
| title_full | A Calculational Theory of Pers as Types |
| title_fullStr | A Calculational Theory of Pers as Types |
| title_full_unstemmed | A Calculational Theory of Pers as Types |
| title_short | A Calculational Theory of Pers as Types |
| title_sort | calculational theory of pers as types |
| url | https://eprints.nottingham.ac.uk/241/ https://eprints.nottingham.ac.uk/241/ |