Sintrastes / MontagueLinks
A library for non-deterministically parsing natural language expressions into a structured form.
☆18Updated 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 web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 9 months ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- ☆12Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- A categorical semantics library in Agda.☆16Updated 6 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 4 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Interpreter for the reversible functional language rFun☆38Updated 7 years ago
- TPTP linear logic version☆15Updated 11 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Parsers and (eventually) Idris code generator for WebIDL documents☆15Updated 11 months ago
- Interactive holes for Lean 4☆22Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- ☆17Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year