kthielen / stlccLinks
Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
☆25Updated 12 years ago
Alternatives and similar repositories for stlcc
Users that are interested in stlcc are comparing it to the libraries listed below
Sorting:
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- ☆29Updated 9 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- ☆22Updated 9 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago