VictorTaelin / Elementary-Affine-Type-Theory-legacy
Minimal, efficient proof language
☆14Updated 5 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
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Base Formality libraries☆9Updated 6 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago