ayberkt / grammar-inferenceLinks
Learning rigid grammars in Haskell.
☆24Updated 8 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:
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- topos programming☆31Updated 7 years ago
- being the scrapings of my stackoverflow answers☆48Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- Web based opetopic editor☆35Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Agda-style equational reasoning in Haskell☆54Updated 7 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- enumerative property-based testing for Haskell☆52Updated 3 months ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- do-notation for Category and "Arrow without arr"☆62Updated 8 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆43Updated 3 weeks ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- ☆32Updated 7 years ago
- ICFP 2019 preprints/papers☆44Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆126Updated last year
- Thesis☆38Updated 7 years ago
- Source material for "Functional Pearl: Getting a Quick Fix on Comonads"☆48Updated 7 years ago
- Generic random generators☆81Updated 2 years ago
- Haskell tool to generate expressions from types☆101Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago