thautwarm / RSolve
Ask for solutions.
☆19Updated 5 years ago
Alternatives and similar repositories for RSolve:
Users that are interested in RSolve are comparing it to the libraries listed below
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Type inference for 'type level computation one step at a time'☆12Updated 7 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- ☆26Updated 8 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆13Updated 6 years ago
- A naive θ..θ programming language☆27Updated 6 years ago
- A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).☆16Updated last month
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- ☆21Updated 3 years ago
- An implementation of a Zeilberger-style linear type theory.☆11Updated 3 years ago
- Sucessor: https://github.com/thautwarm/Quick-Backend☆24Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 9 months ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- type-system, revised unification algorithm and runtime time representations☆14Updated 5 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 4 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- ☆11Updated 3 years ago
- Stacks project, from a homotopy type theory point-of-view (hPOV)☆14Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago
- The Prettiest Printer☆35Updated last year