arendsee / lsystemsLinks
L-system generators and visualizers
☆32Updated 4 years ago
Alternatives and similar repositories for lsystems
Users that are interested in lsystems are comparing it to the libraries listed below
Sorting:
- Some tools for provability logic☆37Updated 7 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- Kempe is a compiled stack-based language☆58Updated last year
- A browser Pong game, taking advantage of Idris's ability to compile to javascript.☆18Updated 11 years ago
- A simple Prolog interpreter☆42Updated 3 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated 3 weeks ago
- 👁️ Isometric 3D Graphing / Rendering module for Haskell☆15Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- MIRROR of https://codeberg.org/catseye/Mascarpone : You are lost in a twisty maze of meta-circular interpreters, all alike.☆23Updated 2 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- Typing Haskell in Haskell☆15Updated 15 years ago
- Classical Logic in Haskell☆24Updated last month
- Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.☆23Updated 7 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 9 months ago
- A programming language that deduces code from tests☆30Updated 7 years ago
- A simple and educational compiler for the SASL programming language☆23Updated 7 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated 2 weeks ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 4 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago