VictorTaelin / absal-ex
Absal ex
☆56Updated last year
Alternatives and similar repositories for absal-ex:
Users that are interested in absal-ex are comparing it to the libraries listed below
- ☆35Updated 6 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- An implementation of the Formality language in JavaScript☆72Updated 5 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- ☆41Updated 7 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated last month
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- Build tool for ATS.☆41Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- Specification of the Formality proof and programming language☆41Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- ☆12Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago