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...
| Үндсэн зохиолчид: | , |
|---|---|
| Бусад зохиолчид: | |
| Формат: | Дипломын ажил |
| Хэл сонгох: | English |
| Хэвлэсэн: |
2014
|
| Нөхцлүүд: |