PterosDiacos / lambekseqLinks
Semantic graph parser based on Categorial grammars
☆15Updated 4 months ago
Alternatives and similar repositories for lambekseq
Users that are interested in lambekseq are comparing it to the libraries listed below
Sorting:
- A library for non-deterministically parsing natural language expressions into a structured form.☆18Updated 2 years ago
- Lecture notes on intensional semantics by Kai von Fintel and Irene Heim☆46Updated last year
- A program for generating LaTeX TikZ code for string diagrams.☆19Updated 4 years ago
- Yoneda lemma in every known language☆17Updated 2 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- TPTP linear logic version☆15Updated 9 months ago
- Haskell library for representing and manipulating Symbolic Regression Tree☆15Updated 3 weeks ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- a library for experimental linear lambda calculus☆20Updated 2 years ago
- A categorical semantics library in Agda.☆16Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Meta-programming utilities for Agda.☆20Updated 3 months ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- A framework for natural language syntax and semantics based on type theory.☆13Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- machine fusion☆16Updated 7 years ago
- A Henkin-style completeness proof for the modal logic S5☆17Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- ☆13Updated 2 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- ☆12Updated 5 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- I/O utilities and datasets for algebraic-graphs☆14Updated 3 years ago
- Compile time CAS(Computer Algebra System) for Haskell☆18Updated 5 years ago