jff / TeLLerLinks
TeLLer is a collection of tools that explore the use of linear logic applied to narrative generation and story telling.
☆18Updated 10 years ago
Alternatives and similar repositories for TeLLer
Users that are interested in TeLLer are comparing it to the libraries listed below
Sorting:
- ☆62Updated 6 years ago
- ☆29Updated 10 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 3 years ago
- Braid representations in Haskell☆21Updated last year
- A string diagram generator for LaTeX.☆30Updated 2 years ago
- Type theory in type theory☆16Updated 13 years ago
- The algebra for formal power series in elements of the Weyl algebra☆18Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Fuzzy Aggregators and Similarity Into a Logic Language☆26Updated last year
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 14 years ago
- Accepted papers for ICFP 2014☆119Updated 9 years ago
- Logic for story telling!☆34Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- Work in progress☆38Updated 4 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- Operad Programming Language in Haskell, by David Darais☆32Updated 11 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"☆16Updated last year
- Morte IDE☆29Updated 7 months ago
- Programming with LVars, by example☆36Updated 10 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 5 months ago
- Formal topology (and some probability) in Coq☆31Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago