4 ms·
Why not just learn Coq or Agda yourself? There are also sorts of introductions for simple type systems that I'm sure you can build off of.
by naasking 10y ago
Why not just learn Coq or Agda yourself? There are also sorts of introductions for simple type systems that I'm sure you can build off of.
- catnaroek 10y agoI have no idea how to implement fresh unification variable generation (my type system is a superset of Damas-Milner, kind of like how the calculus of constructions is a superset of System F-omega) in Coq or Agda. Everywhere I've seen it implemented, it involves mutable state. So, “in principle”, I could fake it using something like the state monad, and plumbing around the collection of unification variables generated so far, but in practice reasoning about this seems like a pain.
- mietek 10y agoYou could take a look at Coquand (2002) “A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions”. https://www.dropbox.com/s/xmj7yv1i1moe0ag/Coquand2002.pdf https://www.dropbox.com/s/xmj7yv1i1moe0ag/Coquand2002.pdf Drop in to #dependent on Freenode IRC, and let’s chat.