Joey Eremondi

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

2022

Propositional equality for gradual dependently typed programming.

[BibT_eX]

[DOI]

Ronald Garcia

Éric Tanter

Proc. ACM Program. Lang., 2022

2021

Approximate Normalization and Eager Equality Checking for Gradual Inductive Families.

[BibT_eX]

[DOI]

Ronald Garcia

Éric Tanter

CoRR, 2021

2019

Approximate normalization for gradual dependent types.

[BibT_eX]

[DOI]

Éric Tanter

Ronald Garcia

Proc. ACM Program. Lang., 2019

Insertion operations on deterministic reversal-bounded counter machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

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

[BibT_eX]

[DOI]

Wouter Swierstra

Jurriaan Hage

Open Comput. Sci., 2019

Set Constraints, Pattern Match Analysis, and SMT.

[BibT_eX]

[DOI]

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

2018

On the Density of Context-Free and Counter Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

On the complexity and decidability of some problems involving shuffle.

[BibT_eX]

[DOI]

Inf. Comput., 2018

2017

Deletion operations on deterministic families of automata.

[BibT_eX]

[DOI]

Inf. Comput., 2017

2016

The ASPECTA toolkit: affordable full coverage displays.

[BibT_eX]

[DOI]

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

2013

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

[BibT_eX]

[DOI]