effectfully / STLCLinks
Dependently typed Algorithm M and friends
☆26Updated 7 years ago
Alternatives and similar repositories for STLC
Users that are interested in STLC are comparing it to the libraries listed below
Sorting:
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- System F implemented in Haskell☆24Updated 13 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Derivation of Optimized Definitions Based on Specs☆14Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Mtac in Agda☆29Updated 4 years ago
- ☆23Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Category theory and algebra☆26Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 6 years ago