maxdore / elfe
Interactive Theorem Proving for students
☆20Updated last year
Related projects ⓘ
Alternatives and complementary repositories for elfe
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Multimode simple type theory as an Agda library.☆22Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆13Updated this week
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Experiments with Realizability in Univalent Type Theory☆17Updated last month
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆21Updated 7 years ago
- ☆17Updated 2 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- ☆28Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- my phd thesis☆26Updated 3 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 5 months ago
- ☆21Updated 3 years ago
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- Agda to C compiler☆10Updated last year