ekmett / kansoLinks
just a place to throw some coding experiements while i re-re-re-learn rust
☆15Updated 3 years ago
Alternatives and similar repositories for kanso
Users that are interested in kanso are comparing it to the libraries listed below
Sorting:
- implementation deriving for idris2☆12Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A type checker for the Lean theorem prover☆40Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- type safe, concurrent, pauseless, copying, generational GC. Implementation https://github.com/Avi-D-coder/sundial-gc☆31Updated 5 years ago
- Provides a Refl encoding in Rust☆68Updated 2 years ago
- A TOML parser for Idris 2☆17Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated last month
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Haskell bindings to binaryen.☆14Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Formalization of type theory☆22Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆100Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Quick explanation of eliminating left recursion in Haskell parsers☆54Updated 4 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 9 months ago
- A Result-like type that can collect multiple Errs☆12Updated 5 years ago
- TParsec - Total Parser Combinators in Idris☆96Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A dependently typed programming language, and verification tool☆27Updated 9 years ago