gallais / agdarsec
Total Parser Combinators in Agda
☆126Updated last year
Alternatives and similar repositories for agdarsec:
Users that are interested in agdarsec are comparing it to the libraries listed below
- Compiling Agda code to readable Haskell☆182Updated last week
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- Programming library for Agda☆126Updated 6 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Language Server for Agda☆106Updated 3 months ago
- SPLV20 course notes☆108Updated 2 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆99Updated 2 years ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated last week
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Benchmarks for capture-avoiding substitution☆113Updated last month
- being an operating system for typechecking processes☆125Updated last year
- 😎TT☆225Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- A core language and API for dependently typed languages☆90Updated last month
- A small implementation of higher-order unification☆186Updated 7 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Fast parsing from bytestrings☆156Updated 2 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year