2 code implementations • 16 Dec 2020 • Danil Annenkov, Mikkel Milo, Jakob Botsch Nielsen, Bas Spitters
As part of this, we implement an optimisation pass removing unused arguments.
Programming Languages Logic in Computer Science
2 code implementations • 24 Jul 2019 • Danil Annenkov, Jakob Botsch Nielsen, Bas Spitters
We present a new way of embedding functional languages into the Coq proof assistant by using meta-programming.
Programming Languages Logic in Computer Science
2 code implementations • 9 May 2017 • Danil Annenkov, Paolo Capriotti, Nicolai Kraus
Firstly, there are certain results about HoTT which are of meta-theoretic nature, such as the statement that semisimplicial types up to level $n$ can be constructed in HoTT for any externally fixed natural number $n$.
Logic in Computer Science F.4.1
