Theoretical Computer Science
Profile Activity
Meta user
Network profile
2,387
reputation
11
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.

6
answers
30
questions
~11k
people reached
  • University of British Columbia
  • JoeyEremondi
  • eremondi.com
  • Member for 7 years, 11 months
  • 230 profile views
  • Last seen Apr 17 at 6:30

Communities (43)

Top network posts

Top tags (47)

Score 4
Posts 5
Posts % 14
Score 2
Posts 21
Score 2
Posts 14
Score 2
Posts 13
Score 0
Posts 13
Score 0
Posts 11
View all tags →

Top posts (36)

All Questions Answers
Votes Newest
25 Advanced techniques for determining complexity lower bounds Jul 22 '13
19 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
13 Are Turing machines still useful as model of computation? Apr 5 '19
12 Is there a book/survey-paper outlining language class hierarchies, closure properties, etc May 28 '13
11 State of the Art for the Monadic Class? Nov 5 '17
11 Proof techniques for showing that dependent type checking is decidable Oct 11 '18
11 Hereditary substitution with a universe hierarchy Nov 22 '18
11 Intuition Behind Strict Positivity? Apr 2 '19
8 PHOAS with extrinsic typing? Nov 26 '19
View all questions and answers →

Badges (38)

Gold

—

Silver

11

Rarest

Bronze

27

Rarest

View all badges →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.