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:
- Learning rigid grammars in Haskell.☆24Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A work-in-progress core language for Agda, in Agda☆61Updated 2 weeks ago
- Categorical logic from a categorical point of view☆81Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A TACtic library for Agda☆50Updated last year
- Where my everyday research happens☆55Updated 3 weeks ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Haskell library for doing category theory with a central role for profunctors☆24Updated last week
- The Prettiest Printer☆35Updated last year
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Web based opetopic editor☆36Updated last year
- ☆32Updated 7 years ago
- Libraries and tools for rendering math to images using real LaTeX, from Haskell, Pandoc and Hakyll☆57Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Translation of, and commentary on, Joyal's classic paper "Une théorie combinatoire des séries formelles" (A combinatorial theory of forma…☆30Updated last year
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- An implementation of miniKanren in Haskell☆79Updated 12 years ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆44Updated 5 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago