wenkokke / NLQLinks
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
Sorting:
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Learning rigid grammars in Haskell.☆24Updated 7 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Where my everyday research happens☆55Updated 3 months ago
- apkg - package manager for Agda☆38Updated 4 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- The Iowa Agda Library☆49Updated 2 weeks ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A TACtic library for Agda☆49Updated last year
- A continuation-based backtracking logic programming monad☆92Updated 10 months ago
- An implementation of miniKanren in Haskell☆78Updated 12 years ago
- ECMAScript back end for Functional Reactive Programming in Agda☆103Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆32Updated 7 years ago
- Classes for types where we know all the values☆39Updated 9 months ago
- The Prettiest Printer☆35Updated last year
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Functional Linear Algebra with Block Matrices☆11Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago