![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Deivid Vale
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Patrick Baillot
, Ugo Dal Lago
, Cynthia Kop
, Deivid Vale
:
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) 2024: 70-91 - [c8]Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale:
Higher-Order Constrained Dependency Pairs for (Universal) Computability. MFCS 2024: 57:1-57:15 - [i7]Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. CoRR abs/2401.12385 (2024) - [i6]Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale:
Higher-Order Constrained Dependency Pairs for (Universal) Computability. CoRR abs/2406.19379 (2024) - 2023
- [c7]Cynthia Kop, Deivid Vale
:
Cost-Size Semantics for Call-By-Value Higher-Order Rewriting. FSCD 2023: 15:1-15:19 - [c6]Niels van der Weide, Deivid Vale
, Cynthia Kop:
Certifying Higher-Order Polynomial Interpretations. ITP 2023: 30:1-30:20 - [i5]Niels van der Weide, Deivid Vale, Cynthia Kop:
Certifying Higher-Order Polynomial Interpretations. CoRR abs/2302.11892 (2023) - [i4]Cynthia Kop, Deivid Vale:
Complexity Analysis for Call-by-Value Higher-Order Rewriting. CoRR abs/2307.13426 (2023) - 2022
- [c5]Liye Guo, Deivid Vale
:
Analyzing Innermost Runtime Complexity Through Tuple Interpretations. LSFA 2022: 34-48 - [i3]Cynthia Kop, Deivid Vale:
Tuple Interpretations and Applications to Higher-Order Runtime Complexity. CoRR abs/2206.15202 (2022) - 2021
- [c4]Mauricio Ayala-Rincón
, Maribel Fernández
, Daniele Nantes-Sobrinho
, Deivid Vale
:
Nominal Equational Problems. FoSSaCS 2021: 22-41 - [c3]Cynthia Kop, Deivid Vale
:
Tuple Interpretations for Higher-Order Complexity. FSCD 2021: 31:1-31:22 - [i2]Deivid Vale, Cynthia Kop:
Tuple Interpretations for Higher-Order Rewriting. CoRR abs/2105.01112 (2021) - [i1]Deivid Vale, Niels van der Weide:
Formalizing Higher-Order Termination in Coq. CoRR abs/2112.05715 (2021) - 2020
- [c2]Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale:
An Investigation into General Nominal Equational Problems (Work in progress). UNIF 2020: 3:1-3:8
2010 – 2019
- 2019
- [c1]Mauricio Ayala-Rincón
, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale
:
On Solving Nominal Disunification Constraints. LSFA 2019: 3-22
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint