alhassy / next-700-module-systems
PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
☆80Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for next-700-module-systems
- Unification and type inference algorithms☆123Updated 9 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆66Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- An enhanced unification algorithm for Coq☆49Updated 4 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 4 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated 3 weeks ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- The Evolution of a Typechecker☆52Updated 5 years ago
- ☆35Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated last month
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- ICFP 2020 papers. Crowd-sourced☆92Updated 4 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 5 months ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆48Updated 5 months ago