joom / regexp-agda
☆10Updated 5 years ago
Alternatives and similar repositories for regexp-agda:
Users that are interested in regexp-agda are comparing it to the libraries listed below
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated last month
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- ☆17Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- BibTeX database management in Idris☆18Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Experimentation project☆16Updated 10 years ago
- Synthetic Differential Geometry in Agda☆12Updated 10 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆16Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated last month
- Linear map categories in Agda☆5Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago