sfultong / stand-in-language
a simple total pure functional language, eventually to have powerful static checking and optimization
☆33Updated last month
Alternatives and similar repositories for stand-in-language:
Users that are interested in stand-in-language are comparing it to the libraries listed below
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- ☆47Updated 2 months ago
- Session Types with Priority in Linear Haskell☆25Updated 8 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Anders: Cubical Type Checker☆22Updated last year
- Where my everyday research happens☆52Updated last week
- ICFP tutorial☆39Updated 3 years ago
- ☆16Updated 10 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated 2 months ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 3 months ago
- Agda-style equational reasoning in Haskell☆52Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- A usable type system for call by push-value☆30Updated 5 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 5 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Updated 8 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- SPJ's tutorial on implementing functional languages☆28Updated 5 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year