Sintrastes / MontagueLinks
A library for non-deterministically parsing natural language expressions into a structured form.
☆17Updated 2 years ago
Alternatives and similar repositories for Montague
Users that are interested in Montague are comparing it to the libraries listed below
Sorting:
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago
- αProlog☆18Updated 2 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- ☆14Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- TPTP linear logic version☆14Updated 7 months 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
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Prolog-Style Meta-Interpreters in miniKanren☆33Updated 5 months ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- ☆17Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- Yoneda lemma in every known language☆17Updated 2 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A simple λProlog interpreter☆20Updated 3 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago