ziman / ttstarLinks
Dependently typed core calculus with erasure
☆19Updated 4 years ago
Alternatives and similar repositories for ttstar
Users that are interested in ttstar are comparing it to the libraries listed below
Sorting:
- A prototypical dependently typed languages with sized types and variances☆115Updated last week
- ☆26Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- ICFP tutorial☆39Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- ☆40Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A series of implementations of a simple functional programming language.☆30Updated 10 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Diploma work (if this is still here contact me if you need details)☆13Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Unification and type inference algorithms☆127Updated 10 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Command-like expressions for real infinite-precision calculations☆55Updated 5 months ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 3 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 6 years ago