A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.
Theoretical Computer Science
Meta user
Network profile
2,232
reputation
9
27

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
29
questions
~9k
people reached
  • University of British Columbia
  • JoeyEremondi
  • eremondi.com
  • Member for 6 years, 8 months
  • 183 profile views
  • Last seen 2 hours ago

Communities (43)

Top network posts

Top tags (45)

Score 4
Posts 5
Posts % 15
Score 2
Posts 20
Score 2
Posts 13
Score 2
Posts 13
Score 2
Posts 4
Score 0
Posts 12
View all tags →

Top posts (33) All Questions Answers | Votes Newest

24 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
12 Are Turing machines still useful as model of computation? Apr 5 '19
11 State of the Art for the Monadic Class? Nov 5 '17
11 Hereditary substitution with a universe hierarchy Nov 22 '18
10 Proof techniques for showing that dependent type checking is decidable Oct 11 '18
10 Intuition Behind Strict Positivity? Apr 2 '19
8 PHOAS with extrinsic typing? Nov 26 '19
View all questions and answers →

Badges (36)

Gold

—

Silver

9

Rarest

Bronze

27

Rarest

View all badges →