jin / subtyping
An implementation of structural subtyping of records and functions
☆13Updated 6 years ago
Alternatives and similar repositories for subtyping:
Users that are interested in subtyping are comparing it to the libraries listed below
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated last month
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- ☆22Updated 8 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- Deep embedding of imperative programs with code generation☆23Updated 2 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- MLpolyR☆7Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- ☆29Updated 6 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A step-by-step MicroKanren evaluator☆29Updated 8 years ago
- TODO☆23Updated 9 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago