annenkov / two-levelLinks
Two-Level Type Theory
☆28Updated 5 years ago
Alternatives and similar repositories for two-level
Users that are interested in two-level are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Generation of abstract binding trees☆27Updated last week
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- MetaML and MetaOCaml bibliography☆93Updated 10 months ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- ☆21Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated 2 weeks ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- An extended typed Lambda Calculus☆21Updated last year
- ☆26Updated 8 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago