4y8 / esoo
Like the Programming Languages Zoo but with esoteric languages.
☆25Updated 4 years ago
Alternatives and similar repositories for esoo:
Users that are interested in esoo are comparing it to the libraries listed below
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- Experimental functional language☆17Updated 2 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- A mini language for logic programming☆24Updated 4 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- A type-safe, stack-based functional programming language☆16Updated 2 months ago
- OCaml code for Compiler Construction course at University of Cambridge☆41Updated 4 years ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 2 years ago
- A simple parser combinator library for Ocaml☆30Updated 3 years ago
- Some rudimentary proofs on subtyping☆11Updated 3 years ago
- A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines☆36Updated 5 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- A Literate Programming Tool inspired by NoWeb, implemented in OCaml☆35Updated 6 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 3 months ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- language verification, construction, and analysis☆20Updated 3 years ago
- Samples and solutions from Chris Okasaki's "Purely Functional Data Structures", written in OCaml.☆12Updated 3 years ago
- Type systems written in 1ML☆9Updated 5 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Brainfuck formalized in Coq☆26Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- The Stream and Genlex libraries for use with Camlp4 and Camlp5☆16Updated 3 months ago
- A small CLI to launch notifications at a given time☆13Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago