wenkokke/NLQ
A framework for natural language syntax and semantics based on type theory.
Discovered public repositories for wenkokke in the GitHub catalog.
A framework for natural language syntax and semantics based on type theory.
wherein we added Pelican to EOP
Tool to convert literate code between styles or to code.
several algorithms for converting dependency structures into constituency structures.
An AI for a *very distant* cousin of '20 questions'.
a formalisation of the theory of pregoups as described by Lambek in Agda
a linear logic prover based on Naoyuki Tamura's llprover that works under SWI Prolog
wherein I implement several substructural logics in Agda
Implementation of McBride's "First-order unification by structural recursion" in Agda.
Solutions to the problems in the course Bioinformatics Algorithms.
Solutions for problems in Project Euler.
A script which maintains a greyscale copy of a tumblr blog
Proof automation – for Agda, in Agda.
Implementation of untyped and simply typed lambda calculus with support for parsing, printing and evaluation.
A framework for data-flow analysis of a simple imperative programming language.
an implementation of control-flow analysis of a simple functional programming language.
a formalisation of the functional pearl "Enumerating the Rationals" by Gibbons, Lester and Bird in Coq
the "public" api for the semantic annotation pipeline
a simple programming language for semantic annotation of natural language semantics
Pelican is tool for semantic annotation and verification, compliant to the Pipeline 2.0.1 API specifications.
A port of Utrecht University's ParseLib (from Haskell) to Frege, to allow usage of parser combinators with Java.
an Anki 1 plugin for Japanese learning in combination with James Heisig's "Remembering The Kanji"