Sintrastes / MontagueView external linksLinks
A library for non-deterministically parsing natural language expressions into a structured form.
☆18Feb 3, 2023Updated 3 years ago
Alternatives and similar repositories for Montague
Users that are interested in Montague are comparing it to the libraries listed below
Sorting:
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Mar 29, 2023Updated 2 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A compiler for the Dana programming language☆11Apr 25, 2021Updated 4 years ago
- Indexed Functors for GHC 7.6☆22Aug 20, 2019Updated 6 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆12Dec 2, 2025Updated 2 months ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Dec 19, 2023Updated 2 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10May 31, 2022Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Another attempt for visualizing proofs☆12Nov 19, 2024Updated last year
- ☆12Sep 22, 2020Updated 5 years ago
- Type inference for ML-like languages. A port to F# of "Algorithm W Step by Step" by Martin Grabmüller.☆11Sep 17, 2014Updated 11 years ago
- new generation language☆20Aug 2, 2013Updated 12 years ago
- Semantic graph parser based on Categorial grammars☆16Jun 29, 2025Updated 7 months ago
- concise functionless functional esolang☆14Jan 18, 2026Updated 3 weeks ago
- Compile time CAS(Computer Algebra System) for Haskell☆18Dec 16, 2025Updated last month
- OCaml library to transform an Llvm control flow graph in an SMT formula.☆13Apr 20, 2018Updated 7 years ago
- The official interpreter for the Jeopardy language☆16Dec 6, 2022Updated 3 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- Erlang BEAM emulator in Haskell☆48Jun 14, 2014Updated 11 years ago
- An interpreter for a minimal but Turing-complete stack based 'concatenative' language.☆19Feb 2, 2014Updated 12 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated last year
- "oh god there are like a million different kinds of analyses, quickly remind me what this one means?"☆19Dec 23, 2020Updated 5 years ago
- Official repository for the REX virtual machine☆12Mar 9, 2016Updated 9 years ago
- A meta-circular interpreter of a subset of Scheme☆16Apr 12, 2020Updated 5 years ago
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 10 months ago
- A Henkin-style completeness proof for the modal logic S5☆17Jun 20, 2021Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 3 years ago
- Classical Logic in Haskell☆24Nov 19, 2025Updated 2 months ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated 2 weeks ago
- A parsing library that compiles grammars to combinators using elimination of left recursion☆27Dec 22, 2025Updated last month
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Oct 28, 2019Updated 6 years ago
- Truth-table generator for classical propositional logic☆26May 10, 2021Updated 4 years ago
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- Embedded C code generation DSL for Haskell.☆29Mar 25, 2019Updated 6 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Apr 8, 2018Updated 7 years ago
- A very short and simple implementation of (bottom-up) Datalog in JS☆31Mar 23, 2013Updated 12 years ago