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...
Main Authors: | Clairambault, P, Grellois, C, Murawski, A |
---|---|
פורמט: | Journal article |
יצא לאור: |
Association for Computing Machinery
2017
|
פריטים דומים
-
On the expressivity of linear recursion schemes
מאת: Clairambault, P, et al.
יצא לאור: (2019) -
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
מאת: Naoki Kobayashi, et al.
יצא לאור: (2020-10-01) -
Semantics of Higher-Order Recursion Schemes
מאת: Jiri Adamek, et al.
יצא לאור: (2011-04-01) -
Indexed linear logic and higher-order model checking
מאת: Charles Grellois, et al.
יצא לאור: (2015-03-01) -
Collapsible Pushdown Automata and Recursion Schemes
מאת: Murawski, C, et al.
יצא לאור: (2008)