Linearity in higher-order recursion schemes
Higher-order recursion schemes (HORS) have recently emerged as a promising foundation for higher-order program verification. We examine the impact of enriching HORS with linear types. To that end, we introduce two frameworks that blend non-linear and linear types: a variant of the λY-calculus and an...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
Association for Computing Machinery
2017
|