agda-attic / agda-frp-jsLinks
ECMAScript back end for Functional Reactive Programming in Agda
☆103Updated 8 years ago
Alternatives and similar repositories for agda-frp-js
Users that are interested in agda-frp-js are comparing it to the libraries listed below
Sorting:
- An implementation of miniKanren in Haskell☆79Updated 12 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 11 months ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Library of categories, with categorical constructions on them☆58Updated 2 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…☆158Updated 4 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- Categories parametrized by morphism equality, in Agda☆152Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- Tutorial for LiquidHaskell☆81Updated last year
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Efficient Haskell effect handlers based on evidence translation.☆85Updated 4 years ago
- A workshop on learning Agda with minimal prerequisites.☆85Updated 9 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 8 years ago
- ☆32Updated 7 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- REST'ful web framework in Agda☆134Updated 15 years ago
- 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
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- ☆138Updated 4 years ago
- Implement monads by specifying instructions and their desired operational semantics.☆84Updated last year