Totality for Mixed Inductive and Coinductive Types
This paper introduces an ML / Haskell like programming language with nested inductive and coinductive algebraic datatypes called \chariot. Functions are defined by arbitrary recursive definitions and can thus lead to non-termination and other ``bad'' behavior. \chariot comes with a totalit...
Uložené v:
| Vydané v: | Logical methods in computer science Ročník 21, Issue 3 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
03.09.2025
|
| ISSN: | 1860-5974, 1860-5974 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper introduces an ML / Haskell like programming language with nested inductive and coinductive algebraic datatypes called \chariot. Functions are defined by arbitrary recursive definitions and can thus lead to non-termination and other ``bad'' behavior. \chariot comes with a totality checker that tags possibly ill-behaved definitions. Such a totality checker is mandatory in the context of proof assistants based on type theory like Agda. Proving correctness of this checker is far from trivial and relies on - an interpretation of types as parity games, - an interpretation of correct values as winning strategies for those games, - the Lee, Jones and Ben Amram's size-change principle, used to check that the strategies induced by recursive definitions are winning. This paper develops the first two points, the last step being the subject of an upcoming paper. A prototype has been implemented and can be used to experiment with the resulting totality checker, giving a practical argument in favor of this principle. |
|---|---|
| AbstractList | This paper introduces an ML / Haskell like programming language with nested inductive and coinductive algebraic datatypes called \chariot. Functions are defined by arbitrary recursive definitions and can thus lead to non-termination and other ``bad'' behavior. \chariot comes with a totality checker that tags possibly ill-behaved definitions. Such a totality checker is mandatory in the context of proof assistants based on type theory like Agda. Proving correctness of this checker is far from trivial and relies on - an interpretation of types as parity games, - an interpretation of correct values as winning strategies for those games, - the Lee, Jones and Ben Amram's size-change principle, used to check that the strategies induced by recursive definitions are winning. This paper develops the first two points, the last step being the subject of an upcoming paper. A prototype has been implemented and can be used to experiment with the resulting totality checker, giving a practical argument in favor of this principle. |
| Author | Hyvernat, Pierre |
| Author_xml | – sequence: 1 givenname: Pierre surname: Hyvernat fullname: Hyvernat, Pierre |
| BookMark | eNpNj01Lw0AURQepYK39A66y1EV03pvMlzsJVgsVN3E9jG9mINImJRPF_Huting3957NhXPKZl3fRcbOgV9VCq253u4olwgX4gbsJXKUR2wORvFSWl3N_u0Ttsz5lX9FCDCo5gybfvTbdpyK1A_FY_sRQ7HuwhuN7XssfBeKum__uJn2MZ-x4-S3OS5_e8GeV3dN_VBunu7X9e2mJNA4loYqow1JUMFSsiRRWSCuLfAQbBWF1i9amxgsABc6ecQkKuJGKskFebFg-PNLQ5_zEJPbD-3OD5MD7r7F3UHcITjhwLqDuPgE5w9NGw |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.46298/lmcs-21(3:19)2025 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | 10_46298_lmcs_21_3_19_2025 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c172t-8c4878c516d9cf9c52691c07910dd94e377b778ed911037fa22f34c0856503ca3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001574411100008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Sat Nov 29 07:34:46 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c172t-8c4878c516d9cf9c52691c07910dd94e377b778ed911037fa22f34c0856503ca3 |
| OpenAccessLink | https://lmcs.episciences.org/16449/pdf |
| ParticipantIDs | crossref_primary_10_46298_lmcs_21_3_19_2025 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-09-03 |
| PublicationDateYYYYMMDD | 2025-09-03 |
| PublicationDate_xml | – month: 09 year: 2025 text: 2025-09-03 day: 03 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2025 |
| SSID | ssj0000331826 |
| Score | 2.3486557 |
| Snippet | This paper introduces an ML / Haskell like programming language with nested inductive and coinductive algebraic datatypes called \chariot. Functions are... |
| SourceID | crossref |
| SourceType | Index Database |
| Title | Totality for Mixed Inductive and Coinductive Types |
| Volume | 21, Issue 3 |
| WOSCitedRecordID | wos001574411100008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PS91AEF5a66EX7Q-Ltlb2UKHlsZjsJNldbyItPVTxYMFbeNkf8MDmie8pz4t_uzObfTEtCnroZUmWMCT5lplvhtn9GPsClWpcZUpROmNEMZZeaMgLoX0ZwKFDHGchik2o42N9dmZOktD2LMoJqLbVi4W5-K9Q4xyCTVtnnwF3bxQn8BpBxxFhx_FpwE_nHbemBsKjycJTvy-d6ko9QlQmP5xO-ntKQ2dDgvorucJOWTo2y9ok_DBK0bJfCTfXsZgYiShG19RGm0oIsow9UjDwerrKBGUWXVB4YC65SplHz0UrYgQPOeCikoZ2FZz_sTNBT2ugMyHMLolidTuc_z7z-p9Y1HcIYm4SbdVkqZZ5DXVuarLxkr2SqjTUvnd0e19PywAoVaL8evnm3R6paGYvvdBX2M_NNzIz4CEDQnH6hq2lTIAfdAi-ZS98-46tL1U2eHK675lcAsoRUB4B5T2gHAHlA0B5BHSD_f7x_fTwp0hKF8IigZwLbTFv1LbMK2dsMJZk33ObKeRyzpnCg1KNUto7DE0ZqDCWMkBhkS4jwQY7hg9spZ22fpNxCSEPWRF8ME3RNK5RuvTRLTscNWyx0fK764vuQJP68Z_98VlPf2Kv75fXNluZX175z2zVXs8ns8udWO7YiajdAdzwQVo |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Totality+for+Mixed+Inductive+and+Coinductive+Types&rft.jtitle=Logical+methods+in+computer+science&rft.au=Hyvernat%2C+Pierre&rft.date=2025-09-03&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=21%2C+Issue+3&rft_id=info:doi/10.46298%2Flmcs-21%283%3A19%292025&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_21_3_19_2025 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |