Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
☆25Jan 25, 2013Updated 13 years ago
Alternatives and similar repositories for stlcc
Users that are interested in stlcc are comparing it to the libraries listed below
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Jan 14, 2019Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Closure calculus implementation☆12Jun 25, 2019Updated 6 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Feb 21, 2020Updated 6 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- ☆12May 22, 2016Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Jun 22, 2021Updated 4 years ago
- Pure haskell encoding of MLIR for printing, parsing, and mutating MLIR within haskell☆17Oct 30, 2020Updated 5 years ago
- Compositional type checking for a Hindley-Milner type system☆11Mar 28, 2017Updated 8 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Pure Type Systems for Functional Programming☆11Jun 11, 2014Updated 11 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Label dependent dependent session types☆16May 2, 2024Updated last year
- What I wish I knew when learning HoTT☆53Feb 24, 2019Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- Write yourself a typed functional language☆65Oct 11, 2018Updated 7 years ago
- A Self-Interpreter for F-omega☆16Dec 6, 2015Updated 10 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago