Alternatives and similar repositories for normalization-bench

Users that are interested in normalization-bench are comparing it to the libraries listed below

• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• frex-project / idris-frex
  ☆51Updated 4 months ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆29Updated this week
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 5 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 10 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 6 months ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆127Updated 10 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 10 months ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆54Updated 5 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆77Updated 8 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆55Updated 6 months ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 2 months ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 7 months ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• faulhornlabs / csip
  ☆24Updated 3 weeks ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 4 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆85Updated 4 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 4 months ago