martinring / cobraLinks
Proof and Code Presentation Framework
☆22Updated 6 years ago
Alternatives and similar repositories for cobra
Users that are interested in cobra are comparing it to the libraries listed below
Sorting:
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- A http client for Idris based on libcurl☆10Updated 9 years ago
- Research middleware compiler from System F-based languages to Java with the Imperative Functional Object encoding☆46Updated 9 years ago
- second-order abstract syntax☆31Updated 4 years ago
- An embedded DSL for creating, composing, and using probability measures.☆42Updated 6 years ago
- ☆31Updated 11 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Web based opetopic editor☆35Updated 11 months ago
- ☆12Updated 6 years ago
- My Agda experiments☆12Updated 6 years ago
- a little category theory in Idris☆10Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Code for the submitted TyDe '16 extended abstract and C∘mp∘se '17 talk "`choose` Your Own Derivative"☆19Updated 8 years ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- ☆23Updated 10 years ago
- A small bifunctor library for idris☆21Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 4 months ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection☆67Updated 4 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- Ring solver for Idris☆20Updated 6 years ago
- TODO☆23Updated 10 years ago