maxdore / elfeLinks
Interactive Theorem Proving for students
☆20Updated last year
Alternatives and similar repositories for elfe
Users that are interested in elfe are comparing it to the libraries listed below
Sorting:
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Normalization for Gödel's system T using a glueing model construction☆9Updated 3 years ago
- ☆21Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Constructive Galois connections☆32Updated 7 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Type theory in type theory☆16Updated 13 years ago
- Revised Omega-categorical Typechecker☆26Updated 8 months ago
- Organize mathematical thoughts☆20Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- ☆29Updated 3 years ago