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
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- A work-in-progress core language for Agda, in Agda☆58Updated 2 weeks ago
- A TACtic library for Agda☆50Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Learning rigid grammars in Haskell.☆24Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- ☆32Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆43Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Work in progress☆38Updated 4 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- An implementation of miniKanren in Haskell☆78Updated 12 years ago
- The Iowa Agda Library☆49Updated last month
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago