Abstract
We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
