Joey Eremondi

According to our database, Joey Eremondi authored at least 13 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Coverage Semantics for Dependent Pattern Matching.

Joseph Eremondi, Ohad Kammar

Proceedings of the Programming Languages and Systems, 2025

2024

Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments.

Joseph Eremondi

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

2022

Propositional equality for gradual dependently typed programming.

Joseph Eremondi, Ronald Garcia, Éric Tanter

Proc. ACM Program. Lang., 2022

2021

Approximate Normalization and Eager Equality Checking for Gradual Inductive Families.

Joseph Eremondi, Ronald Garcia, Éric Tanter

CoRR, 2021

2019

Approximate normalization for gradual dependent types.

Joseph Eremondi, Éric Tanter, Ronald Garcia

Proc. ACM Program. Lang., 2019

A framework for improving error messages in dependently-typed languages.

Joseph Eremondi, Wouter Swierstra, Jurriaan Hage

Open Comput. Sci., 2019

Set Constraints, Pattern Match Analysis, and SMT.

Joseph Eremondi

Proceedings of the Trends in Functional Programming - 20th International Symposium, 2019

2016

The ASPECTA toolkit: affordable full coverage displays.

Julian Petford, Miguel A. Nacenta, Carl Gutwin, Joseph Eremondi, Cody Ede

Proceedings of the 5th ACM International Symposium on Pervasive Displays, 2016

2015

Deletion Operations on Deterministic Families of Automata.

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan

Proceedings of the Theory and Applications of Models of Computation, 2015

Insertion Operations on Deterministic Reversal-Bounded Counter Machines.

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan

Proceedings of the Language and Automata Theory and Applications, 2015

On the Density of Context-Free and Counter Languages.

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

On the Complexity and Decidability of Some Problems Involving Shuffle.

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2013

The poor man's proof assistant: using prolog to develop formal language theoretic proofs.

Joey Eremondi

Proceedings of the SPLASH'13, 2013