default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdsko de Vries
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Edsko de Vries:
falsify: Internal Shrinking Reimagined for Haskell. Haskell 2023: 97-109- 2022
- [j5]James Koppel
, Zheng Guo, Edsko de Vries, Armando Solar-Lezama, Nadia Polikarpova:
Searching entangled program spaces. Proc. ACM Program. Lang. 6(ICFP): 23-51 (2022) - [i2]James Koppel, Zheng Guo, Edsko de Vries, Armando Solar-Lezama, Nadia Polikarpova:
Searching Entangled Program Spaces. CoRR abs/2206.07828 (2022)
2010 – 2019
- 2017
- [i1]Edsko de Vries, Vasileios Koutavas:
Locally Nameless Permutation Types. CoRR abs/1710.08444 (2017) - 2014
- [j4]Adrian Francalanza, Edsko de Vries, Matthew Hennessy:
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency. Log. Methods Comput. Sci. 10(2) (2014) - [j3]Edsko de Vries, Adrian Francalanza, Matthew Hennessy:
Uniqueness typing for resource management in message-passing concurrency. J. Log. Comput. 24(3): 531-556 (2014) - [c11]Edsko de Vries, Andres Löh:
True sums of products. WGP@ICFP 2014: 83-94 - 2013
- [c10]Edsko de Vries:
Modelling Unique and Affine Typing Using Polymorphism. The Beauty of Functional Code 2013: 181-192 - 2012
- [j2]Paul Biggar, Edsko de Vries, David Gregg:
A practical solution for achieving language compatibility in scripting language compilers. Sci. Comput. Program. 77(9): 971-989 (2012) - 2011
- [c9]Edsko de Vries, Vasileios Koutavas:
Reverse Hoare Logic. SEFM 2011: 155-171 - 2010
- [j1]Wendy Verbruggen, Edsko de Vries, Arthur Hughes:
Formal polytypic programs and proofs. J. Funct. Program. 20(3-4): 213-269 (2010) - [c8]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Liveness of Communicating Transactions (Extended Abstract). APLAS 2010: 392-407 - [c7]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Communicating Transactions - (Extended Abstract). CONCUR 2010: 569-583
2000 – 2009
- 2009
- [b1]Edsko de Vries:
Making uniqueness typing less unique. Trinity College Dublin, Ireland, 2009 - [c6]Wendy Verbruggen, Edsko de Vries, Arthur Hughes:
Polytypic properties and proofs in Coq. WGP@ICFP 2009: 1-12 - [c5]Paul Biggar, Edsko de Vries, David Gregg:
A practical solution for scripting language compilers. SAC 2009: 1916-1923 - [c4]Edsko de Vries, Adrian Francalanza, Matthew Hennessy:
Uniqueness Typing for Resource Management in Message-Passing Concurrency. LINEARITY 2009: 26-37 - 2008
- [c3]Wendy Verbruggen, Edsko de Vries, Arthur Hughes:
Polytypic programming in COQ. ICFP-WGP 2008: 49-60 - 2007
- [c2]Edsko de Vries, Rinus Plasmeijer, David M. Abrahamson:
Uniqueness Typing Simplified. IFL 2007: 201-218 - 2006
- [c1]Edsko de Vries, Rinus Plasmeijer, David M. Abrahamson:
Uniqueness Typing Redefined. IFL 2006: 181-198
Coauthor Index
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-06-17 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
