maxdore / elfeLinks
Interactive Theorem Proving for students
☆20Updated 2 years ago
Alternatives and similar repositories for elfe
Users that are interested in elfe are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Multimode simple type theory as an Agda library.☆23Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Agda to C compiler☆10Updated 3 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 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 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆21Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month