thsutton / chaLinks
A port of miniprl to Haskell with co-/inductive types bolted on the side.
☆22Updated 9 years ago
Alternatives and similar repositories for cha
Users that are interested in cha are comparing it to the libraries listed below
Sorting:
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Updated 8 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- System F in coq.☆19Updated 10 years ago
- ☆14Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- second-order abstract syntax☆31Updated 4 years ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- ☆20Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Diploma work (if this is still here contact me if you need details)☆13Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Haskell Type Level Example Programs☆28Updated 7 years ago