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...
Egile Nagusiak: | Clairambault, P, Grellois, C, Murawski, A |
---|---|
Formatua: | Journal article |
Argitaratua: |
Association for Computing Machinery
2017
|
Antzeko izenburuak
-
On the expressivity of linear recursion schemes
nork: Clairambault, P, et al.
Argitaratua: (2019) -
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
nork: Naoki Kobayashi, et al.
Argitaratua: (2020-10-01) -
Semantics of Higher-Order Recursion Schemes
nork: Jiri Adamek, et al.
Argitaratua: (2011-04-01) -
Indexed linear logic and higher-order model checking
nork: Charles Grellois, et al.
Argitaratua: (2015-03-01) -
Collapsible Pushdown Automata and Recursion Schemes
nork: Murawski, C, et al.
Argitaratua: (2008)