Alternatives and similar repositories for fintel-heim-intensional-notes

Users that are interested in fintel-heim-intensional-notes are comparing it to the libraries listed below

• vvulpes0 / Language-Toolkit-2
  A set of tools for analyzing languages via logic and automata
  ☆23Updated 2 months ago
• wenkokke / NLQ
  A framework for natural language syntax and semantics based on type theory.
  ☆13Updated last year
• rawlins / lambda-notebook
  Lambda Notebook: Formal Semantics in Jupyter
  ☆28Updated this week
• schar / TDParse
  Type-driven syntactic and semantic effectful parsing for NL
  ☆15Updated 5 months ago
• semprag / biblatex-unified
  An opinionated biblatex implementation of the Unified Stylesheet for Linguistics Journals
  ☆43Updated 9 months ago
• dylnb / esslli2015-monads
  materials for ESSLLI 2015 course: Monads and Natural Language
  ☆26Updated 10 years ago
• formalabstracts / CNL-CIC
  A controlled natural language for calculus of inductive constructions, based on Forthel.
  ☆14Updated 4 years ago
• epstabler / mgtdb
  MG top-down beam parsing
  ☆13Updated 7 years ago
• nyusemantics / LambdaCalculatorPublic
  ☆17Updated 3 years ago
• Naproche-SAD / Naproche-SAD
  ☆21Updated 4 years ago
• PterosDiacos / lambekseq
  Semantic graph parser based on Categorial grammars
  ☆15Updated 4 months ago
• jonsterling / ocaml-forester
  Mirror of ocaml-forester
  ☆45Updated last year
• alhassy / org-agda-mode
  An Emacs mode for working with Agda code in an Org-mode like fashion, more or less.
  ☆19Updated 3 years ago
• KenyC / Exh
  Computes innocently excludable and includable sets of alternatives
  ☆11Updated 4 years ago
• liamoc / latex-formulae
  Libraries and tools for rendering math to images using real LaTeX, from Haskell, Pandoc and Hakyll
  ☆57Updated 6 years ago
• ayberkt / grammar-inference
  Learning rigid grammars in Haskell.
  ☆24Updated 7 years ago
• leanprover / lean3-mode
  Emacs mode for Lean
  ☆68Updated 2 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 4 years ago
• iwilare / church-rosser
  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
• andrew-bedford / coqatoo
  Generates natural language versions of Coq proofs
  ☆51Updated 7 years ago
• GrammaticalFramework / gf-contrib
  Community contributions to the Grammatical Framework
  ☆62Updated last year
• byorgey / series-formelles
  Translation of, and commentary on, Joyal's classic paper "Une théorie combinatoire des séries formelles" (A combinatorial theory of forma…
  ☆30Updated last year
• awodey / CatLogNotes
  Categorical Logic Notes
  ☆80Updated 3 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆104Updated 3 years ago
• theoremprover-museum / theoremprover-museum.github.io
  ☆56Updated 6 months ago
• GrammaticalFramework / gf-core
  Grammatical Framework core: compiler, shell & runtimes
  ☆142Updated 2 weeks ago
• jonsterling / forest
  My mathematical Zettelkasten, created using forester. Moved to sourcehut.
  ☆87Updated 5 months ago
• GrammaticalFramework / gf-rgl
  Grammatical Framework's Resource Grammar Library (RGL)
  ☆59Updated 3 weeks ago
• ualib / agda-algebras
  The Agda Universal Algebra Library (html docs available at the url below)
  ☆37Updated 10 months ago
• iblech / internal-methods
  Notes on how to use the internal language of toposes in algebraic geometry
  ☆60Updated last month