Automatically exported from code.google.com/p/trellys
☆47Jul 12, 2019Updated 6 years ago
Alternatives and similar repositories for trellys
Users that are interested in trellys are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Alternative Core language for GHC plugins☆39Feb 15, 2016Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Web based opetopic editor☆37Oct 21, 2024Updated last year
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated 3 weeks ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Cohesive type theory☆19Dec 6, 2021Updated 4 years ago
- experiments with pext/pdep and codebruijn syntax☆17Nov 17, 2019Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- (the first half of) an ML compiler☆10Sep 6, 2014Updated 11 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Symbolic logic expressions☆16Jul 1, 2020Updated 5 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- A Brainfuck interpreter written in Agda☆53Aug 9, 2021Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- ☆32Apr 17, 2023Updated 2 years ago
- gallina frontend for CompCert☆19Jul 6, 2019Updated 6 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- playing with hyperfunctions☆16May 2, 2021Updated 4 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Jul 23, 2013Updated 12 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Jan 28, 2016Updated 10 years ago