atennapel / coc-os
"operating system" based on the calculus of constructions
☆18Updated 2 years ago
Alternatives and similar repositories for coc-os
Users that are interested in coc-os are comparing it to the libraries listed below
Sorting:
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- being an experiment with potato power☆23Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Linear map categories in Agda☆5Updated 2 years ago
- ☆16Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- ☆17Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago