jff / TeLLer
TeLLer is a collection of tools that explore the use of linear logic applied to narrative generation and story telling.
☆18Updated 9 years ago
Alternatives and similar repositories for TeLLer:
Users that are interested in TeLLer are comparing it to the libraries listed below
- ☆59Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 13 years ago
- Polynomial semantics of linear logic☆13Updated 6 years ago
- Type theory in type theory☆16Updated 12 years ago
- TODO☆10Updated 9 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆18Updated 4 years ago
- Concurrent and distributed Prolog via join patterns (join calculus)☆11Updated 9 years ago
- A small profunctor library for idris☆17Updated 2 years ago
- FFI-based byte buffers for Idris☆10Updated 5 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Fuzzy Aggregators and Similarity Into a Logic Language☆21Updated 4 months ago
- Braid representations in Haskell☆21Updated last year
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- ☆29Updated 9 years ago
- Category Theory in Agda☆13Updated 7 years ago
- Dependently-typed structures for quantum physics in Idris☆13Updated 9 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- Experimental C++11 backend for Idris☆14Updated 10 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆21Updated 2 years ago
- Experiments with linear types☆14Updated 6 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- software archaeology of reflective towers of interpreters☆15Updated 3 months ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 2 months ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.☆23Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A semantically unified SQL and NoSQL query and update system☆17Updated 6 years ago