The Size-Change Principle for Mixed Inductive and Coinductive types
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912577162838016 |
|---|---|
| author | Hyvernat, Pierre |
| author_facet | Hyvernat, Pierre |
| contents | This paper shows how to use Lee, Jones and Ben Amram's size-change principle to check correctness of arbitrary recursive definitions in an ML / Haskell like programming language with inductive and coinductive types. Naively using the size-change principle to check productivity and termination is straightforward but unsound when inductive and coinductive types are nested. We can however adapt the size-change principle to check ``totality'', which corresponds exactly to correctness with respect to the corresponding (co)inductive type. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_05715 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Size-Change Principle for Mixed Inductive and Coinductive types Hyvernat, Pierre Logic in Computer Science This paper shows how to use Lee, Jones and Ben Amram's size-change principle to check correctness of arbitrary recursive definitions in an ML / Haskell like programming language with inductive and coinductive types. Naively using the size-change principle to check productivity and termination is straightforward but unsound when inductive and coinductive types are nested. We can however adapt the size-change principle to check ``totality'', which corresponds exactly to correctness with respect to the corresponding (co)inductive type. |
| title | The Size-Change Principle for Mixed Inductive and Coinductive types |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2407.05715 |