Thompson, Simon (1992) Are subsets necessary in Martin-Lof type theory? In: UNSPECIFIED.
|
Download (159Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (128Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
After introducing Martin-Lof's type theory, the paper introduces the rules proposed by various authors for adding subset types to the system, and the justification given for their addition. These justifications are examined, and it is argued that by a combination of lazy evaluation and transformation using the Axiom of Choice that subsets need not be added to the system to make it usable.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Additional information: | Document Type: Proceedings Paper Conference Information: 1991 SUMMER SYMP ON CONSTRUCTIVITY IN COMPUTER SCIENCE |
| Uncontrolled keywords: | constructivity Martin-Lof computational irrelevance subsets |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 07 Aug 2009 22:15 |
| Last Modified: | 18 Jul 2012 08:45 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21078 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
