default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoey Eremondi
Person information
- affiliation: University of Regina, Canada
- affiliation (former): University of British Columbia, Vancouver, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c10]Joseph Eremondi
, Ohad Kammar:
Coverage Semantics for Dependent Pattern Matching. ESOP (1) 2025: 264-291- [i10]Joseph Eremondi, Ohad Kammar:
Coverage Semantics for Dependent Pattern Matching. CoRR abs/2501.18087 (2025) - 2024
- [c9]Joseph Eremondi:
Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments. CPP 2024: 205-217 - 2023
- [i9]Joseph Eremondi:
Strictly Monotone Brouwer Trees for Well-founded Recursion Over Multiple Arguments. CoRR abs/2312.06962 (2023) - 2022
- [j7]Joseph Eremondi, Ronald Garcia, Éric Tanter:
Propositional equality for gradual dependently typed programming. Proc. ACM Program. Lang. 6(ICFP): 165-193 (2022) - [i8]Joseph Eremondi, Ronald Garcia, Éric Tanter:
Propositional Equality for Gradual Dependently Typed Programming. CoRR abs/2205.01241 (2022) - 2021
- [i7]Joseph Eremondi, Ronald Garcia, Éric Tanter:
Approximate Normalization and Eager Equality Checking for Gradual Inductive Families. CoRR abs/2107.04859 (2021)
2010 – 2019
- 2019
- [j6]Joseph Eremondi, Wouter Swierstra, Jurriaan Hage:
A framework for improving error messages in dependently-typed languages. Open Comput. Sci. 9(1): 1-32 (2019) - [j5]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion operations on deterministic reversal-bounded counter machines. J. Comput. Syst. Sci. 104: 244-257 (2019) - [j4]Joseph Eremondi, Éric Tanter, Ronald Garcia:
Approximate normalization for gradual dependent types. Proc. ACM Program. Lang. 3(ICFP): 88:1-88:30 (2019) - [c8]Joseph Eremondi:
Set Constraints, Pattern Match Analysis, and SMT. TFP 2019: 121-141 - [i6]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. CoRR abs/1903.03001 (2019) - [i5]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. CoRR abs/1903.03518 (2019) - [i4]Joseph Eremondi:
Set Constraints, Pattern Match Analysis, and SMT. CoRR abs/1905.09423 (2019) - [i3]Joseph Eremondi, Éric Tanter, Ronald Garcia:
Approximate Normalization for Gradual Dependent Types. CoRR abs/1906.06469 (2019) - 2018
- [j3]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the complexity and decidability of some problems involving shuffle. Inf. Comput. 259(2): 214-224 (2018) - [j2]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. Int. J. Found. Comput. Sci. 29(2): 233-250 (2018) - 2017
- [j1]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion operations on deterministic families of automata. Inf. Comput. 256: 237-252 (2017) - 2016
- [c7]Julian Petford, Miguel A. Nacenta, Carl Gutwin, Joseph Eremondi, Cody Ede:
The ASPECTA toolkit: affordable full coverage displays. PerDis 2016: 87-105 - [i2]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Complexity and Decidability of Some Problems Involving Shuffle. CoRR abs/1606.01199 (2016) - [i1]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. CoRR abs/1607.00931 (2016) - 2015
- [c6]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Complexity and Decidability of Some Problems Involving Shuffle. DCFS 2015: 105-116 - [c5]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. DLT 2015: 228-239 - [c4]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. LATA 2015: 200-211 - [c3]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. TAMC 2015: 388-399 - 2013
- [c2]Joey Eremondi:
The poor man's proof assistant: using prolog to develop formal language theoretic proofs. SPLASH (Companion Volume) 2013: 75-76 - [c1]Joey Eremondi:
The poor man's proof assistant: using prolog to develop formal language theoretic proofs. SPLASH (Companion Volume) 2013: 101-102
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 2025-12-13 21:37 CET 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:
