Abstract
We extend the classical notion of solvability to a A-calculus equipped with pattern matching. We prove that solvability can be characterized by means ......
小提示:本篇文献需要登录阅读全文,点击跳转登录