Alternatives and similar repositories for Dissertation:

Users that are interested in Dissertation are comparing it to the libraries listed below

• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆24Updated 4 years ago
• RemuLang / remu-type-system
  type-system, revised unification algorithm and runtime time representations
  ☆14Updated 5 years ago
• Trebor-Huang / agda-linear
  An implementation of a Zeilberger-style linear type theory.
  ☆11Updated 3 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 2 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 4 years ago
• xnning / Row-and-Bounded-via-Disjoint
  Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.
  ☆13Updated 4 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 3 months ago
• nojb / mlpolyr
  MLpolyR
  ☆7Updated 8 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 7 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 3 weeks ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 2 months ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆26Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• whitequark / ocaml-llvm-ng
  A practical LLVM backend for OCaml (will never be finished)
  ☆34Updated 11 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆17Updated 9 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 3 years ago
• MatthewFluet / smelt
  Forging Standard ML (SML) in emacs
  ☆10Updated 2 years ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 5 years ago
• mb64 / prolog
  A simple prolog implementation in Rust
  ☆26Updated 4 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago