ayberkt / grammar-inferenceLinks
Learning rigid grammars in Haskell.
☆24Updated 7 years ago
Alternatives and similar repositories for grammar-inference
Users that are interested in grammar-inference are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Web based opetopic editor☆35Updated 7 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- http://www.cse.chalmers.se/edu/course/afp/☆16Updated 9 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- An experimental intermediate language for GHC☆36Updated 7 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"☆16Updated last year
- ☆45Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Generic random generators☆81Updated 2 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- ☆30Updated 7 years ago