A realizability interpretation of Church's simple theory of types
- Submitting institution
-
Swansea University / Prifysgol Abertawe
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 21694
- Type
- D - Journal article
- DOI
-
10.1017/s0960129516000104
- Title of journal
- Mathematical Structures in Computer Science
- Article number
- -
- First page
- 1364
- Volume
- 27
- Issue
- 8
- ISSN
- 0960-1295
- Open access status
- Out of scope for open access requirements
- Month of publication
- December
- Year of publication
- 2017
- URL
-
http://dx.doi.org/10.1017/s0960129516000104
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The extraction of formally verified programs from proofs has so far been limited to first- or second-order logic with restricted forms of induction. This paper achieves a breakthrough by extending program extraction to full higher-order logic with unrestricted higher-order predicates as least and greatest fixed points of monotone operators, thus vastly improving previous partial results. Since higher-order logic with fixed points is very prominent in program specification, this opens up a completely new range of possibilities for the computer assisted creation of verified programs. Unlike constructive type theory, our method admits classical reasoning which is crucial for many applications.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -