dhil / phd-dissertationLinks
A summary of my activities during the past four years
☆31Updated 3 weeks ago
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
- Demo for dependent types + runtime code generation☆72Updated 10 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A toy dependent typed language.☆36Updated this week
- Anders: Cubical Type Checker☆23Updated 2 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- 🩺 A library for compiler diagnostics☆52Updated last month
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- A work-in-progress core language for Agda, in Agda☆61Updated 3 weeks ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆38Updated this week
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆62Updated last year
- Agda grammar for tree-sitter☆41Updated 4 months 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
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A cost-aware logical framework, embedded in Agda.☆69Updated 2 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- 🦠 Reusable components based on algebraic effects☆51Updated last month
- High level commands to declare a hierarchy based on packed classes☆104Updated 2 weeks ago