atennapel / coc-osLinks
"operating system" based on the calculus of constructions
☆18Updated 3 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:
- IO using sized types and copatterns☆35Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experimental normalisation via scheme☆12Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Compiler backend for generating Scheme code☆26Updated last year