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☆36Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last month
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- ☆16Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- Revised Omega-categorical Typechecker☆27Updated last year
- A usable type system for call by push-value☆33Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago