0xd34df00d / refinedt
Refinement types + dependent types = ❤️
☆58Updated 2 years ago
Alternatives and similar repositories for refinedt:
Users that are interested in refinedt are comparing it to the libraries listed below
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- A core language and API for dependently typed languages☆91Updated 2 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- high-performance cubical evaluation☆71Updated 4 months ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆97Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Inline Assembly code in ur Haskell!☆43Updated last month
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- FizzBuzz, formally verified, provably correct☆26Updated 2 years ago
- ☆47Updated 5 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Haskell library for type-inference with Hindley-Milner type-system.☆34Updated 10 months ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- A verified compiler for a lazy functional language☆35Updated this week
- ICFP tutorial☆39Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Setoid type theory implementation☆38Updated last year
- ☆39Updated 8 months ago