bitonic / hakyll-agdaLinks
Hakyll support for Agda literate files
☆19Updated 4 years ago
Alternatives and similar repositories for hakyll-agda
Users that are interested in hakyll-agda are comparing it to the libraries listed below
Sorting:
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- ☆23Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…☆27Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Reification of data structures using observable sharing☆30Updated last year
- Agda-style equational reasoning in Haskell☆54Updated this week
- playing with hyperfunctions☆16Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Dependently typed elimination functions using singletons☆28Updated last week
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated last year
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated 2 weeks ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 9 months ago
- Classes for types where we know all the values☆39Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago