VictorTaelin / Elementary-Affine-Type-Theory-legacyLinks
Minimal, efficient proof language
☆14Updated 6 years ago
Alternatives and similar repositories for Elementary-Affine-Type-Theory-legacy
Users that are interested in Elementary-Affine-Type-Theory-legacy are comparing it to the libraries listed below
Sorting:
- A nano "theorem prover".☆62Updated 6 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 6 years ago
- Absal ex☆57Updated last year
- Base Formality libraries☆9Updated 6 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Haskell Join-calculus DSL☆24Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- ☆35Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago