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
- IO using sized types and copatterns☆36Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Mtac in Agda☆29Updated 4 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
- System F implemented in Haskell☆24Updated 13 years ago
- Category theory and algebra☆26Updated 9 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☆24Updated 5 years ago
- ☆23Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Base library for HoTT in Agda☆38Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- ☆16Updated 4 years ago