Alternatives and similar repositories for Dissertation

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

• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆17Updated 5 years ago
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 3 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• deech / ATS-Strange-Loop-Talk
  ☆47Updated 8 years ago
• SimonJF / mbcheck
  Implementation of typechecker from paper "Special Delivery: Programming with Mailbox Types"
  ☆20Updated 3 weeks ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 3 years ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆27Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• lexi-lambda / racket-mvar
  An implementation of Haskell’s MVars in Racket
  ☆30Updated last year
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆76Updated 4 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆41Updated 8 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆104Updated 8 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆65Updated 2 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• pnwamk / sst-tutorial
  ☆18Updated 4 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 4 months ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆50Updated last year
• namin / higher-rank
  Practical type inference for arbitrary-rank types
  ☆11Updated 6 years ago
• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆22Updated 6 months ago
• joom / type.systems
  joke page until I decide what to do with this domain name
  ☆39Updated 7 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last month
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated last year
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆34Updated 5 months ago
• adamrk / llvm-ocaml-tutorial
  The LLVM tutorial using OCaml
  ☆60Updated 5 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated last month
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆74Updated 7 years ago
• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆25Updated 5 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆33Updated 4 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago