Alternatives and similar repositories for agda-frp-js

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

• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 8 months ago
• copumpkin / categories
  Categories parametrized by morphism equality, in Agda
  ☆152Updated 6 years ago
• jvranish / MiniKanrenT
  An implementation of miniKanren in Haskell
  ☆78Updated 12 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆83Updated 10 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆85Updated 2 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• BekaValentine / SimpleFP-v2
  A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS
  ☆109Updated 8 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆91Updated 7 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• plaidfinch / ComonadSheet
  A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…
  ☆156Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• Gabriella439 / Haskell-Annah-Library
  Distributed programming language that desugars to Morte
  ☆92Updated 3 years ago
• ucsd-progsys / liquidhaskell-tutorial
  Tutorial for LiquidHaskell
  ☆79Updated 11 months ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 6 years ago
• xgrommx / agda-ecosystem
  ☆32Updated 7 years ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆67Updated 2 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• HeinrichApfelmus / operational
  Implement monads by specifying instructions and their desired operational semantics.
  ☆84Updated last year
• larrytheliquid / Lemmachine
  REST'ful web framework in Agda
  ☆134Updated 15 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 5 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆82Updated last year
• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆85Updated 9 years ago
• sjoerdvisscher / data-category
  Library of categories, with categorical constructions on them
  ☆57Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆84Updated 4 years ago