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
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- ☆16Updated 3 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago