koko-m / GoI-Visualiser
A tool for web browsers that simulates execution of the dynamic GoI abstract machine for the lambda-calculus.
☆12Updated 3 years ago
Alternatives and similar repositories for GoI-Visualiser:
Users that are interested in GoI-Visualiser are comparing it to the libraries listed below
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Dependently Typed Metaprogramming Exercises☆22Updated 7 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆39Updated 2 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆82Updated 4 years ago
- Algebraic Combinatorics in Coq☆38Updated last month
- Specification of the Cedille Core language☆29Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Software Foundations using the Lean Theorem Prover☆24Updated 4 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- MetaML and MetaOCaml bibliography☆86Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 5 months ago
- Web based opetopic editor☆35Updated 4 months ago
- ☆27Updated 9 months ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆52Updated last week
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago
- ☆13Updated 8 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 2 months ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Paper and talk☆50Updated last year
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- A simple dependently typed language based on the Calculus of Constructions.☆16Updated 4 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 4 months ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago