agda-attic / agda-frp-js
ECMAScript back end for Functional Reactive Programming in Agda
☆104Updated 7 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
- Library of categories, with categorical constructions on them☆54Updated last year
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated last month
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆45Updated 5 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- ☆29Updated 6 years ago
- An implementation of miniKanren in Haskell☆78Updated 11 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Js libraries for idris☆49Updated 5 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- ☆84Updated 7 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
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Slides and exercises for the Idris course taught at Galois☆50Updated 9 years ago