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...
Saved in:
| Published in: | Logical methods in computer science Vol. 21, Issue 3 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
03.09.2025
|
| ISSN: | 1860-5974, 1860-5974 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!