Deivid Vale
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Higher-order constrained dependency pairs for (universal) computability | 2026-05-12 | Paper |
| A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations Logical Methods in Computer Science | 2026-02-13 | Paper |
| A nominal approach to equational problems in languages with binders ACM Transactions on Computational Logic | 2026-01-07 | Paper |
| Certifying higher-order polynomial interpretations | 2024-11-26 | Paper |
| On basic feasible functionals and the interpretation method | 2024-10-30 | Paper |
| Cost-size semantics for call-by-value higher-order rewriting | 2024-10-21 | Paper |
| Analyzing Innermost Runtime Complexity Through Tuple Interpretations Electronic Proceedings in Theoretical Computer Science | 2024-02-28 | Paper |
| Tuple Interpretations for Higher-Order Complexity. (available as arXiv preprint) | 2023-06-23 | Paper |
| Nominal equational problems | 2021-10-18 | Paper |
| On solving nominal disunification constraints | 2021-01-19 | Paper |
Research outcomes over time
This page was built for person: Deivid Vale
