lkuper / lvar-semantics

Related projects ⓘ

Alternatives and complementary repositories for lvar-semantics

• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆33Updated 7 years ago
• mcimini / Gradualizer
  Supporting tool for Gradual Typing
  ☆16Updated 4 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• plum-umd / adapton.ocaml
  (Nominal) Adapton in OCaml
  ☆50Updated 8 years ago
• iu-parfunc / lvars
  The LVish Haskell library
  ☆81Updated 2 years ago
• halfaya / BayHac
  ☆11Updated 7 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 8 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 6 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• neel-krishnaswami / adjs
  Higher-order FRP compiler
  ☆14Updated 3 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 5 months ago
• sweirich / hs-inferno
  Generic unification-based type inference library
  ☆25Updated 9 years ago
• ocamllabs / ocaml-effects
  *DEPRECATED: See ocaml-multicore/ocaml-multicore* OCaml effects handlers
  ☆27Updated 8 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 9 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• ct-gradual-typing / Papers
  The Combination of Dynamic and Static Typing from a Categorical Perspective
  ☆10Updated 7 years ago
• lucch / pesca
  pesca: Proof Editor for Sequent Calculus (mirror)
  ☆10Updated 7 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆21Updated 4 years ago
• adrieng / pulsar
  Experimental functional language
  ☆18Updated 2 years ago
• levjj / esverify-theory
  Formalism and proofs for esverify
  ☆20Updated 6 years ago
• google / idris-protobuf
  A partial implementation of Protocol Buffers in Idris
  ☆30Updated 7 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 5 years ago
• idris-hackers / idris-algebra
  This is an attempt at painting as many bikesheds as possible with a typeclass hierarchy for idris reflecting "Algebra"
  ☆18Updated 5 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 5 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆11Updated 5 years ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago