Alternatives and similar repositories for cs410-advanced-functional-programming

Users that are interested in cs410-advanced-functional-programming are comparing it to the libraries listed below

• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated 3 weeks ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 11 months ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆30Updated last year
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆33Updated 3 weeks ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 11 months ago
• bobatkey / agda-metric-reals
  ☆29Updated 3 years ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 6 months ago
• agda / agda-stdlib-meta
  Meta-programming utilities for Agda.
  ☆19Updated 3 weeks ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆60Updated last month
• frex-project / idris-frex
  ☆48Updated last week
• maxsnew / cubical-categorical-logic
  Extensions to cubical for categorical logic/type theory
  ☆31Updated this week
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated 2 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 5 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆20Updated 3 months ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• Trebor-Huang / combinator-nbe
  Normalization by evaluation of simply typed combinators.
  ☆26Updated 3 years ago
• ConcreteCactus / lcc
  A compiler that translates a form of lambda calculus to C
  ☆12Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆76Updated 3 weeks ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆28Updated 2 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• jespercockx / ataca
  A TACtic library for Agda
  ☆49Updated 11 months ago
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 6 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 6 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆16Updated last week
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 11 months ago
• jespercockx / agda2scheme
  Compiler backend for generating Scheme code
  ☆26Updated last year
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆64Updated last week
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆86Updated last month