agda-attic / agda-system-ioLinks
Bindings to Haskell's IO monad which respect Agda's semantics
☆24Updated 7 years ago
Alternatives and similar repositories for agda-system-io
Users that are interested in agda-system-io are comparing it to the libraries listed below
Sorting:
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- An implementation of Functional Reactive Programming☆41Updated 10 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- System F in coq.☆19Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- ☆23Updated 2 years ago
- Base library for HoTT in Agda☆38Updated 6 years ago
- Category theory and algebra☆26Updated 9 years ago
- Miller/pattern unification in Agda☆66Updated last month
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 8 months ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago