sfultong / stand-in-languageLinks
a simple total pure functional language, eventually to have powerful static checking and optimization
☆33Updated 2 weeks ago
Alternatives and similar repositories for stand-in-language
Users that are interested in stand-in-language are comparing it to the libraries listed below
Sorting:
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Where my everyday research happens☆55Updated last week
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Build tool for ATS.☆42Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ICFP tutorial☆39Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆21Updated last month
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 11 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 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
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year