gergoerdi / syntactic-stlc
Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
☆13Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for syntactic-stlc
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 4 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- Bring fusion to everyone☆13Updated 4 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆11Updated 3 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A package re-exporting the verified subset of containers☆20Updated 6 years ago
- Expands type synonyms in Template Haskell ASTs☆11Updated 7 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Haskell implementation of interaction net-based lambda evaluation☆16Updated 8 years ago
- Folds for recursive types with GHC Generics☆26Updated 4 years ago
- ScopeT and ScopeH☆13Updated 3 months ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆11Updated 6 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 5 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago