sfultong / stand-in-languageLinks
a simple total pure functional language, eventually to have powerful static checking and optimization
☆33Updated 3 months 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 5 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- ICFP tutorial☆39Updated 4 years ago
- Where my everyday research happens☆55Updated 3 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 weeks ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- Build tool for ATS.☆42Updated 3 years ago