Alternatives and similar repositories for Dissertation

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

• RemuLang / remu-type-system
  type-system, revised unification algorithm and runtime time representations
  ☆14Updated 5 years ago
• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆24Updated 4 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
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 4 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 5 months ago
• elpinal / subtyping-agda
  Some rudimentary proofs on subtyping
  ☆11Updated 3 years ago
• RobertHarper / nsml
  SML The Living Language
  ☆11Updated 11 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 4 months ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated 9 months ago
• nojb / mlpolyr
  MLpolyR
  ☆7Updated 8 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• kavon / sml-language-server
  an SML language server that uses SML/NJ's "visible compiler" feature
  ☆25Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• xnning / Row-and-Bounded-via-Disjoint
  Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.
  ☆13Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• Trebor-Huang / agda-linear
  An implementation of a Zeilberger-style linear type theory.
  ☆11Updated 3 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆26Updated 3 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 11 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• keigoi / linocaml
  Monad-based linear types in OCaml, with a few syntax extensions
  ☆37Updated 5 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 6 years ago
• SimonJF / mbcheck
  Implementation of typechecker from paper "Special Delivery: Programming with Mailbox Types"
  ☆15Updated last week