agda-attic / agda-frp-jsLinks
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
Sorting:
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 5 months ago
- Recursion schemes for Idris☆65Updated 6 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- Js libraries for idris☆49Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- higher order dependently typed logic programing☆173Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…☆156Updated 4 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A simple Idris program to blink the LED on an Arduino☆58Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Implement monads by specifying instructions and their desired operational semantics.☆83Updated last year
- Simplified Observational Type Theory☆83Updated 2 years ago
- A PureScript interpreter in Haskell☆120Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Categories parametrized by morphism equality, in Agda☆150Updated 5 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Haskell library for simple, concise and fast generic operations.☆81Updated last year
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago