david-christiansen / pudding-old

Related projects ⓘ

Alternatives and complementary repositories for pudding-old

• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆32Updated 7 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated 8 months ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆30Updated 7 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 8 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆62Updated 10 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 9 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 9 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated 9 months ago
• halfaya / BayHac
  ☆11Updated 7 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated 11 months ago
• mietek / research
  Work in progress
  ☆34Updated 4 months ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 6 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆18Updated 6 years ago
• frelindb / agsyHOL
  ☆22Updated 8 years ago
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆19Updated 9 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆47Updated 7 years ago
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 5 years ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 8 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆11Updated 5 years ago
• mietek / formal-logic
  TODO
  ☆23Updated 9 years ago