Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
# | Year | Title | Type | |||||
---|---|---|---|---|---|---|---|---|
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
8 |
| |||||||
1 |
| |||||||
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
5 |
| |||||||
2002 | The undecidability of the first-order theories of one step rewriting in linear canonical systems In: Information and Computation [175], 182-213 | Journal Article | ||||||
2002 | $\forall\exists^5$-equational theory of context unification is undecidable In: Theoretical Computer Science [275], 463-479 | Journal Article | ||||||
1998 | $\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606 | Proceedings Article | ||||||
1995 | Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73 | Proceedings Article | ||||||
1995 | Structural decidable extensions of bounded quantification In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175 | Proceedings Article | ||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
6 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
3 |
|