Alternatives and similar repositories for pl-lt-rules

Users that are interested in pl-lt-rules are comparing it to the libraries listed below

• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 5 months ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆30Updated 11 months ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 4 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• 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
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 5 months ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated this week
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆33Updated 5 months ago
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆36Updated 4 months ago
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆22Updated 8 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 3 months ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆22Updated last year
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆31Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• Lysxia / coq-simple-io
  IO for Gallina
  ☆33Updated last month
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆58Updated 2 weeks ago