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:
- ☆29Updated 10 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- ☆21Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago