0xd34df00d / refinedtLinks
Refinement types + dependent types = ❤️
☆59Updated 3 years ago
Alternatives and similar repositories for refinedt
Users that are interested in refinedt are comparing it to the libraries listed below
Sorting:
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆81Updated 4 years ago
- A toy dependent typed language.☆31Updated last week
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Inigo: A Package Manager for Idris2☆63Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A core language and API for dependently typed languages☆97Updated 5 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Fωμ type checker and compiler☆54Updated 2 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 5 months ago
- Setoid type theory implementation☆38Updated last year
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 weeks ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 6 months ago
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆113Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year