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:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 3 months ago
- Observational Type Theory as an Agda library☆55Updated 8 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
- ☆22Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆29Updated 10 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Pure Type Systems for Functional Programming☆11Updated 11 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago