kthielen / stlcc
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
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- ☆29Updated 9 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 4 months ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- ☆22Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Type theory in type theory☆16Updated 13 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- ☆21Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆15Updated 6 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- SC Mini is a "minimal" positive supercompiler☆47Updated 4 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 6 years ago
- Base Formality libraries☆9Updated 6 years ago
- A minimalist implementation of type theory, suitable for experimentation☆15Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 9 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 6 years ago