Deivid Vale

Orcid: 0000-0003-1350-3478

According to our database1, Deivid Vale authored at least 13 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Higher-Order Constrained Dependency Pairs for (Universal) Computability.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On Basic Feasible Functionals and the Interpretation Method.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Complexity Analysis for Call-by-Value Higher-Order Rewriting.
CoRR, 2023

Certifying Higher-Order Polynomial Interpretations.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Cost-Size Semantics for Call-By-Value Higher-Order Rewriting.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Analyzing Innermost Runtime Complexity Through Tuple Interpretations.
Proceedings of the Proceedings 17th International Workshop on Logical and Semantic Frameworks with Applications, 2022

Tuple Interpretations and Applications to Higher-Order Runtime Complexity.
CoRR, 2022

2021
Formalizing Higher-Order Termination in Coq.
CoRR, 2021

Tuple Interpretations for Higher-Order Rewriting.
CoRR, 2021

Tuple Interpretations for Higher-Order Complexity.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Nominal Equational Problems.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
An Investigation into General Nominal Equational Problems (Work in progress).
Proceedings of the 34th International Workshop on Unification, 2020

2019
On Solving Nominal Disunification Constraints.
Proceedings of the 14th Workshop on Logical and Semantic Frameworks with Applications, 2019


  Loading...