kthielen / stlccLinks
Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
☆25Updated 13 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
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- ☆21Updated 9 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Idris, but it's C☆24Updated 7 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 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.☆23Updated 9 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Type theory in type theory☆16Updated 13 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A Self-Interpreter for F-omega☆16Updated 10 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- LL(1) parser generator verified in Coq☆48Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year