valis / hoqLinks
A language based on homotopy type theory with an interval
☆83Updated 10 years ago
Alternatives and similar repositories for hoq
Users that are interested in hoq are comparing it to the libraries listed below
Sorting:
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Programming library for Agda☆130Updated last year
- being the materials for Summer 2013's course☆113Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- ☆84Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Where my everyday research happens☆55Updated 3 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- ☆45Updated 6 years ago
- The Software Foundations book, in GHC☆83Updated 9 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Tutorial for LiquidHaskell☆79Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago