Intuitionistic fixed point logic
- Submitting institution
-
Swansea University / Prifysgol Abertawe
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 55847
- Type
- D - Journal article
- DOI
-
10.1016/j.apal.2020.102903
- Title of journal
- Annals of Pure and Applied Logic
- Article number
- -
- First page
- 102903
- Volume
- 172
- Issue
- 3
- ISSN
- 0168-0072
- Open access status
- Exception within 3 months of publication
- Month of publication
- October
- Year of publication
- 2020
- URL
-
-
- 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 logical system IFP introduced in this paper supports program extraction from proofs, unifying theoretical and practical advantages: Based on first-order logic and powerful inductive and coinductive definitions, IFP permits classical abstract mathematics but has an executable Haskell-like target programming language that handles finite and infinite data. Program extraction is fully verified and highly optimised, thus extracted programs are correct and free of junk. A case study in exact real number computation (carried out in the system Prawf, https://prawftree.wordpress.com/) underpins IFP's effectiveness and demonstrates that the approach scales and yields excellent results.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -