aionescu / oplangLinks
Stack-based esoteric programming language
☆18Updated 4 months ago
Alternatives and similar repositories for oplang
Users that are interested in oplang are comparing it to the libraries listed below
Sorting:
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Haskell implementation of interaction net-based lambda evaluation☆20Updated 8 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 7 months ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆30Updated last year
- Zippers for cofree types☆12Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Yoneda lemma in every known language☆17Updated 2 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last year
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆57Updated last week
- ☆39Updated 9 months ago
- ☆12Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Teeny Type Theory☆26Updated 2 years ago