Theoretical Computer Science
Meta user
Network profile
993
reputation
6
26

jmite

I am Joey Eremondi, a PhD Student at the University of British Columbia.

I do research in Programming Languages and Theory of Computation, particularly with dependent types. My Masters Thesis was on improving error messages for higher order unification. I've also co-authored a few papers on reversal-bounded counter automata.

I have an M.Sc in Computing Science from Utrecht University, a B.Sc. Honours in Computer Science, and a B.Sc. 4-year in Mathematics, both from the University of Saskatchewan.

4
answers
23
questions
~7k
people reached

Communities (41)

Top network posts

Top tags (40)

Score 4
Posts 4
Posts % 15
Score 2
Posts 18
Score 2
Posts 13
Score 2
Posts 13
Score 2
Posts 4
Score 0
Posts 8
View all tags →

Top posts (27) All Questions Answers | Votes Newest

23 Advanced techniques for determining complexity lower bounds Jul 22 '13
18 What notable automaton models have polynomially-decidable containment? Jun 16 '14
16 Are there variants of visibly pushdown automata that allow pushing of words onto the stack? Jul 18 '13
12 Is there a book/survey-paper outlining language class hierarchies, closure properties, etc May 28 '13
11 Are Turing machines still useful as model of computation? Apr 5
10 State of the Art for the Monadic Class? Nov 5 '17
10 Proof techniques for showing that dependent type checking is decidable Oct 11 '18
10 Hereditary substitution with a universe hierarchy Nov 22 '18
9 Intuition Behind Strict Positivity? Apr 2
7 Avoiding Cycles with Unification and Subtyping Mar 26 '18
View all questions and answers →

Badges (32)

Gold

—

Silver

6

Rarest

Bronze

26

Rarest

View all badges →