Alternatives and similar repositories for pthandlers

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

• adrieng / pulsar
  Experimental functional language
  ☆17Updated 3 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 4 years ago
• elpinal / types-1ml
  Type systems written in 1ML
  ☆9Updated 5 years ago
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated 8 months ago
• yallop / metaocaml-letrec
  flexible 'let rec' generation for MetaOCaml
  ☆26Updated last month
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated last year
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• elpinal / focused-modules
  A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
  ☆10Updated 4 years ago
• gdijkstra / hs-to-gallina
  Experimentation project
  ☆16Updated 11 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 4 months ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 3 months ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 4 years ago
• jonsterling / tt
  secret project
  ☆17Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• elpinal / subtyping-agda
  Some rudimentary proofs on subtyping
  ☆11Updated 3 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 6 months ago
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆13Updated last month
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago