Alternatives and similar repositories for agda-frp-js

Users that are interested in agda-frp-js are comparing it to the libraries listed below

• jvranish / MiniKanrenT
  An implementation of miniKanren in Haskell
  ☆78Updated 12 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆122Updated 4 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 10 months ago
• rbarreiro / idrisjs
  Js libraries for idris
  ☆49Updated 5 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆82Updated 2 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆171Updated 6 years ago
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 5 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆80Updated last year
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• sjoerdvisscher / data-category
  Library of categories, with categorical constructions on them
  ☆57Updated last year
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆82Updated 8 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated last year
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated last year
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆82Updated 3 years ago
• BekaValentine / SimpleFP-v2
  A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS
  ☆109Updated 8 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆108Updated 2 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago