dhil / phd-dissertationLinks
A summary of my activities during the past four years
☆31Updated last month
Alternatives and similar repositories for phd-dissertation
Users that are interested in phd-dissertation are comparing it to the libraries listed below
Sorting:
- A verified compiler for a lazy functional language☆37Updated this week
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- Fωμ type checker and compiler☆56Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- ☆37Updated last year
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆47Updated 3 years ago
- MetaML and MetaOCaml bibliography☆99Updated last year
- Unification and type inference algorithms☆127Updated 10 years ago
- A toy dependent typed language.☆36Updated last week
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- 🩺 A library for compiler diagnostics☆52Updated 2 months ago
- Basics of the dependently-typed functional language Agda ^_^☆41Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆64Updated last year
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- being an operating system for typechecking processes☆130Updated 4 months ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 3 years ago