sfultong / stand-in-languageLinks
a simple total pure functional language, eventually to have powerful static checking and optimization
☆33Updated 3 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:
- A usable type system for call by push-value☆33Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Efficient parser combinators for Haskell☆39Updated 3 weeks ago
- ☆18Updated 4 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- the dynabook but for haskell☆23Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 4 months ago
- SPJ's tutorial on implementing functional languages☆29Updated 5 years ago
- Reification of data structures using observable sharing☆29Updated 7 months ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 5 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- A library for doing generic programming in Agda☆31Updated 4 years ago