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)