Intersection types and higer-order model checking
<p>Higher-order recursion schemes are systems of equations that are used to define finite and infinite labelled trees. Since, as Ong has shown, the trees defined have a decidable monadic second order theory, recursion schemes have drawn the attention of research in program verification, where...
| Những tác giả chính: | , |
|---|---|
| Tác giả khác: | |
| Định dạng: | Luận văn |
| Ngôn ngữ: | English |
| Được phát hành: |
2014
|
| Những chủ đề: |