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...
Главные авторы: | Clairambault, P, Grellois, C, Murawski, A |
---|---|
Формат: | Journal article |
Опубликовано: |
Association for Computing Machinery
2017
|
Схожие документы
-
On the expressivity of linear recursion schemes
по: Clairambault, P, и др.
Опубликовано: (2019) -
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
по: Naoki Kobayashi, и др.
Опубликовано: (2020-10-01) -
Semantics of Higher-Order Recursion Schemes
по: Jiri Adamek, и др.
Опубликовано: (2011-04-01) -
Indexed linear logic and higher-order model checking
по: Charles Grellois, и др.
Опубликовано: (2015-03-01) -
Collapsible Pushdown Automata and Recursion Schemes
по: Murawski, C, и др.
Опубликовано: (2008)