adrieng / pulsar

Related projects ⓘ

Alternatives and complementary repositories for pulsar

• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated last month
• umazalakain / session-types-coq
  Formalising session types in Coq
  ☆17Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 4 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 3 years ago
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated last year
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• keigoi / linocaml
  Monad-based linear types in OCaml, with a few syntax extensions
  ☆37Updated 5 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• yallop / metaocaml-letrec
  flexible 'let rec' generation for MetaOCaml
  ☆26Updated last year
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 3 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆19Updated 2 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 2 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆29Updated 7 years ago
• jonsterling / tt
  secret project
  ☆17Updated 6 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• elpinal / types-1ml
  Type systems written in 1ML
  ☆9Updated 5 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆12Updated 2 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
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 5 years ago
• MatthewFluet / smelt
  Forging Standard ML (SML) in emacs
  ☆10Updated 2 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆20Updated 6 years ago
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆14Updated last year
• 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…
  ☆19Updated 2 years ago
• c-cube / choice
  Choice operator in OCaml, providing a backtracking monad
  ☆24Updated 2 years ago