thautwarm / RSolveLinks
Ask for solutions.
☆19Updated 6 years ago
Alternatives and similar repositories for RSolve
Users that are interested in RSolve are comparing it to the libraries listed below
Sorting:
- A naive θ..θ programming language☆27Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- ☆26Updated 8 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Updated 7 years ago
- Merged into ian repo: https://github.com/seagreen/ian#llvm-in-haskell☆17Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week
- An equational theorem prover based on Knuth-Bendix completion☆56Updated last week
- Toy typechecker for Insanely Dependent Types☆82Updated 2 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Sucessor: https://github.com/thautwarm/Quick-Backend☆24Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- MetaML and MetaOCaml bibliography☆94Updated 11 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 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
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago