rfindler / 395-2013Links
☆14Updated 6 years ago
Alternatives and similar repositories for 395-2013
Users that are interested in 395-2013 are comparing it to the libraries listed below
Sorting:
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Algebraic Combinatorics in Coq☆38Updated 4 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- A proof of Abel-Ruffini theorem.☆29Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 10 months ago
- ☆11Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated this week
- ☆21Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- ☆22Updated 9 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Mtac in Agda☆28Updated 4 years ago
- Coq library on rewriting theory and termination☆36Updated 3 months ago