Joey Eremondi

University of Regina

http://eremondi.com/

Assistant Professor at the University of Regina.

Formerly a Newton International Fellow at the University of Edinburgh with Ohad Kammar, and before that, PhD at UBC with Ron Garcia.

Broadly interested in making it easier to prove software correct with dependent types. Projects include dependent pattern matching, gradual dependent types, and error message generation.

top accounts reputation activity subscriptions

Git: fatal: Pathspec is in submodule

git github version-control git-submodules hakyll asked Jun 29, 2014 at 2:15

stackoverflow.com

77 votes

Dependent types vs refinement types

terminology programming-languages type-theory functional-programming dependent-types asked Feb 17, 2014 at 7:54

cs.stackexchange.com

60 votes

How to run a script, depending on internet connection

networking sshfs asked Feb 20, 2013 at 3:48

askubuntu.com

50 votes

What is the difference between an algorithm, a language and a problem?

algorithms complexity-theory formal-languages terminology reference-question asked Aug 8, 2013 at 6:10

cs.stackexchange.com

42 votes

Batch equivalent of "source" on Windows: how to run a Python script from a virtualenv

python windows scripting batch-file virtualenv asked Jul 21, 2011 at 19:43

stackoverflow.com

39 votes

Why does The EMH Doctor feel emotion, but Data does not?

star-trek star-trek-tng star-trek-voyager star-trek-data star-trek-emh asked May 16, 2016 at 6:09

scifi.stackexchange.com

29 votes

How to view the generated code for derived instances / deriving in Haskell

parsing haskell serialization typeclass deriving asked Aug 30, 2013 at 17:01

stackoverflow.com

28 votes

Boilerplate-free annotation of ASTs in Haskell?

haskell ghc generic-programming template-haskell scrap-your-boilerplate asked Nov 26, 2014 at 19:49

stackoverflow.com

27 votes

What are the strongest known type systems for which inference is decidable?

undecidability type-theory type-inference dependent-types asked Jun 30, 2015 at 5:57

cs.stackexchange.com

26 votes

Advanced techniques for determining complexity lower bounds

cc.complexity-theory reference-request fl.formal-languages time-complexity reductions asked Jul 22, 2013 at 17:23

cstheory.stackexchange.com

Top Answers

244

Why, really, is the Halting Problem so important?

cs.stackexchange.com

If everyone believes P ≠ NP, why is everyone sceptical of proof attempts for P ≠ NP?

cs.stackexchange.com

What is the difference between an algorithm, a language and a problem?

cs.stackexchange.com

Is there anything that MUST be done on a multi-core CPU?

cs.stackexchange.com

Are there programs that can 'translate' source code between any two languages?

cs.stackexchange.com

Proof that dead code cannot be detected by compilers

cs.stackexchange.com

Why do more powerful programming languages tend to have slower implementations?

cs.stackexchange.com

Meaning of: "'If factoring large integers is hard, then breaking RSA is hard,' is unproven"

cs.stackexchange.com

Why is overfitting bad?

cs.stackexchange.com

What famous theorems or results were proven by female mathematicians?

hsm.stackexchange.com

Assuming P = NP, how would one solve the graph coloring problem in polynomial time?

cs.stackexchange.com

What would be the real-world implications of a constructive $P=NP$ proof?

cs.stackexchange.com

How do computers remember where they store things?

cs.stackexchange.com

Why Do Computers Use the Binary Number System (0,1)?

cs.stackexchange.com

Which research languages have a stronger typesystem than Haskell and why?

cs.stackexchange.com

Path from humanities undergrad to math PhD

academia.stackexchange.com

Why is linear programming in P but integer programming NP-hard?

cs.stackexchange.com

Is Pursuing a Part-Time STEM Master's While Doing a Social Science PhD a Good Idea for Industry Jobs?

academia.stackexchange.com

Why are some programming languages Turing complete but lack some abilities of other languages?

cs.stackexchange.com

How to filter out "Nothing" values from Elm Array?

stackoverflow.com

How did the word "production" end up being a synonym with the word "rule" in the context of Computer Science?

cs.stackexchange.com

What is the difference between a scripting language and a normal programming language?

cs.stackexchange.com

How hard would it be to state P vs. NP in a proof assistant?

cs.stackexchange.com

Can a subset of an NP-complete problem be in P?

cs.stackexchange.com

Are there programs that never halt and have no non-termination proof?

cs.stackexchange.com

Do we really need OO languages to manage software complexity?

softwareengineering.stackexchange.com

Why do we have to trade abstraction for speed?

cs.stackexchange.com

Represent a real number without loss of precision

cs.stackexchange.com

Mathematics topics or fields that increase computer programming proficiency?

cs.stackexchange.com

What makes a language "optimized" for a specific task?

cs.stackexchange.com