wenkokke / NLQ
A framework for natural language syntax and semantics based on type theory.
☆13Updated last year
Alternatives and similar repositories for NLQ:
Users that are interested in NLQ are comparing it to the libraries listed below
- Learning rigid grammars in Haskell.☆24Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆42Updated last year
- Where my everyday research happens☆52Updated this week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A formalization of Constructive Projective Geometry in Agda☆13Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated this week
- A talk☆28Updated 3 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- ☆29Updated 6 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 3 years ago
- Web based opetopic editor☆35Updated 4 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- being the materials for Summer 2013's course☆112Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Agda-style equational reasoning in Haskell☆52Updated 2 months ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆36Updated 2 weeks ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 weeks ago
- ☆24Updated 2 years ago
- GRIN backend for Idris☆51Updated 4 years ago
- Ghosts of Departed Proofs☆60Updated 4 years ago