effectfully / STLCLinks
Dependently typed Algorithm M and friends
☆25Updated 6 years ago
Alternatives and similar repositories for STLC
Users that are interested in STLC are comparing it to the libraries listed below
Sorting:
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Category theory and algebra☆28Updated 8 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Linear map categories in Agda☆5Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ☆23Updated 7 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago