effectfully / STLCLinks
Dependently typed Algorithm M and friends
☆25Updated 7 years ago
Alternatives and similar repositories for STLC
Users that are interested in STLC are comparing it to the libraries listed below
Sorting:
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Category theory and algebra☆27Updated 9 years ago
- Mtac in Agda☆28Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- My master thesis about generic programming and ornaments☆16Updated 9 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- being an experiment with potato power☆23Updated 5 years ago
- The proof of undecidability of halting problem, using the model -- WHILE language.☆21Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Experiments with effect systems☆12Updated 9 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago