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
- Specification of the Cedille Core language☆33Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- miniKanren with a first-order representation of the search space☆17Updated last year
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Anders: Cubical Type Checker☆23Updated last year
- classical sequent calculus, embedded in Haskell☆21Updated 3 weeks ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- ☆17Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- A very little language☆16Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A string diagram generator for LaTeX.☆30Updated 2 years ago
- 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
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆12Updated 4 years ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- αProlog☆18Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago