3 ms·
Very nice work. This kind of embedding (a direct equivalent to "transpiling" for code) is quite common in the formal methods community; for example, Freek Wiedi
by zozbot234 7y ago
Very nice work. This kind of embedding (a direct equivalent to "transpiling" for code) is quite common in the formal methods community; for example, Freek Wiedijk has shown a similar embedding of HOL Light https://www.cs.ru.nl/~freek/notes/index.html https://www.cs.ru.nl/~freek/notes/index.html into Coq.
- xvilka 7y agoThere is also a Dedukti[1][2] project that can load the logic from many different systems, including Coq[3]. [1] https://deducteam.github.io/ https://deducteam.github.io/ [2] https://github.com/Deducteam/ https://github.com/Deducteam/ [3] https://github.com/Deducteam/CoqInE https://github.com/Deducteam/CoqInE
- perthmad 7y agoYou can actually do much better than mere embeddings. Using program translations similar to what Haskell users routinely perform when using the do-notation for monads, you can actually extend your type theory with new reasoning principles. See for instance the parametric exceptional theory [1], which adds well-behaved exceptions and allows to extend Coq with the independence of premises, i.e. (¬A → ∃n:ℕ. P n) → ∃n:ℕ. (¬A → P n). [1] https://hal.inria.fr/hal-01840643/document https://hal.inria.fr/hal-01840643/document