Journal article 626 views 140 downloads
Intuitionistic fixed point logic
Annals of Pure and Applied Logic, Volume: 172, Issue: 3, Start page: 102903
Swansea University Author: Ulrich Berger
-
PDF | Accepted Manuscript
Distributed under the terms of a Creative Commons Attribution, Non-Commercial, NoDerivatives (CC-BY-NC-ND) Licence.
Download (571.91KB)
DOI (Published version): 10.1016/j.apal.2020.102903
Abstract
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 strictly positive inductive and coinductive definitions, IFP support abstract axiomatic mathematics with a large amount of c...
Published in: | Annals of Pure and Applied Logic |
---|---|
ISSN: | 0168-0072 |
Published: |
Elsevier BV
2021
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa55847 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2020-12-30T14:00:52Z |
---|---|
last_indexed |
2021-01-29T04:20:35Z |
id |
cronfa55847 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2021-01-28T16:08:23.1833346</datestamp><bib-version>v2</bib-version><id>55847</id><entry>2020-12-07</entry><title>Intuitionistic fixed point logic</title><swanseaauthors><author><sid>61199ae25042a5e629c5398c4a40a4f5</sid><ORCID>0000-0002-7677-3582</ORCID><firstname>Ulrich</firstname><surname>Berger</surname><name>Ulrich Berger</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2020-12-07</date><deptcode>SCS</deptcode><abstract>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 strictly positive inductive and coinductive definitions, IFP support abstract axiomatic mathematics with a large amount of classical logic. The Haskell-like target programming language has a denotational and an operational semantics which are linked through a computational adequacy theorem that extends to infinite data. Program extraction is fully verified and highly optimised, thus extracted programs are guaranteed to be correct and free of junk. A case study in exact real number computation underpins IFP's effectiveness.</abstract><type>Journal Article</type><journal>Annals of Pure and Applied Logic</journal><volume>172</volume><journalNumber>3</journalNumber><paginationStart>102903</paginationStart><paginationEnd/><publisher>Elsevier BV</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0168-0072</issnPrint><issnElectronic/><keywords>Proof theory, realizability, program extraction , induction , coinduction , exact real number computation</keywords><publishedDay>1</publishedDay><publishedMonth>3</publishedMonth><publishedYear>2021</publishedYear><publishedDate>2021-03-01</publishedDate><doi>10.1016/j.apal.2020.102903</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2021-01-28T16:08:23.1833346</lastEdited><Created>2020-12-07T13:55:25.7737826</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Ulrich</firstname><surname>Berger</surname><orcid>0000-0002-7677-3582</orcid><order>1</order></author><author><firstname>Hideki</firstname><surname>Tsuiki</surname><order>2</order></author></authors><documents><document><filename>55847__18963__173ee186f9b34a89a7170fed3e1516c8.pdf</filename><originalFilename>main.pdf</originalFilename><uploaded>2021-01-05T10:58:28.3121082</uploaded><type>Output</type><contentLength>585632</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2021-10-09T00:00:00.0000000</embargoDate><documentNotes>Distributed under the terms of a Creative Commons Attribution, Non-Commercial, NoDerivatives (CC-BY-NC-ND) Licence.</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>https://creativecommons.org/licenses/by-nc-nd/4.0/</licence></document></documents><OutputDurs/></rfc1807> |
spelling |
2021-01-28T16:08:23.1833346 v2 55847 2020-12-07 Intuitionistic fixed point logic 61199ae25042a5e629c5398c4a40a4f5 0000-0002-7677-3582 Ulrich Berger Ulrich Berger true false 2020-12-07 SCS 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 strictly positive inductive and coinductive definitions, IFP support abstract axiomatic mathematics with a large amount of classical logic. The Haskell-like target programming language has a denotational and an operational semantics which are linked through a computational adequacy theorem that extends to infinite data. Program extraction is fully verified and highly optimised, thus extracted programs are guaranteed to be correct and free of junk. A case study in exact real number computation underpins IFP's effectiveness. Journal Article Annals of Pure and Applied Logic 172 3 102903 Elsevier BV 0168-0072 Proof theory, realizability, program extraction , induction , coinduction , exact real number computation 1 3 2021 2021-03-01 10.1016/j.apal.2020.102903 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2021-01-28T16:08:23.1833346 2020-12-07T13:55:25.7737826 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Ulrich Berger 0000-0002-7677-3582 1 Hideki Tsuiki 2 55847__18963__173ee186f9b34a89a7170fed3e1516c8.pdf main.pdf 2021-01-05T10:58:28.3121082 Output 585632 application/pdf Accepted Manuscript true 2021-10-09T00:00:00.0000000 Distributed under the terms of a Creative Commons Attribution, Non-Commercial, NoDerivatives (CC-BY-NC-ND) Licence. true eng https://creativecommons.org/licenses/by-nc-nd/4.0/ |
title |
Intuitionistic fixed point logic |
spellingShingle |
Intuitionistic fixed point logic Ulrich Berger |
title_short |
Intuitionistic fixed point logic |
title_full |
Intuitionistic fixed point logic |
title_fullStr |
Intuitionistic fixed point logic |
title_full_unstemmed |
Intuitionistic fixed point logic |
title_sort |
Intuitionistic fixed point logic |
author_id_str_mv |
61199ae25042a5e629c5398c4a40a4f5 |
author_id_fullname_str_mv |
61199ae25042a5e629c5398c4a40a4f5_***_Ulrich Berger |
author |
Ulrich Berger |
author2 |
Ulrich Berger Hideki Tsuiki |
format |
Journal article |
container_title |
Annals of Pure and Applied Logic |
container_volume |
172 |
container_issue |
3 |
container_start_page |
102903 |
publishDate |
2021 |
institution |
Swansea University |
issn |
0168-0072 |
doi_str_mv |
10.1016/j.apal.2020.102903 |
publisher |
Elsevier BV |
college_str |
Faculty of Science and Engineering |
hierarchytype |
|
hierarchy_top_id |
facultyofscienceandengineering |
hierarchy_top_title |
Faculty of Science and Engineering |
hierarchy_parent_id |
facultyofscienceandengineering |
hierarchy_parent_title |
Faculty of Science and Engineering |
department_str |
School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science |
document_store_str |
1 |
active_str |
0 |
description |
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 strictly positive inductive and coinductive definitions, IFP support abstract axiomatic mathematics with a large amount of classical logic. The Haskell-like target programming language has a denotational and an operational semantics which are linked through a computational adequacy theorem that extends to infinite data. Program extraction is fully verified and highly optimised, thus extracted programs are guaranteed to be correct and free of junk. A case study in exact real number computation underpins IFP's effectiveness. |
published_date |
2021-03-01T04:10:21Z |
_version_ |
1763753718290841600 |
score |
11.016235 |