| // joining of 2 arrows | |
| (>>>) :: arr a b -> arr b c -> arr a c | |
| (>>>) | |
| a -- (f) --> b -- (g) --> c | |
| // works on pairs | |
| // f: a -> b | |
| // g: a -> c |
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE | |
| Version 2, December 2004 | |
| Copyright (C) 2011 Tom Robinson <http://tlrobinson.net/> | |
| Everyone is permitted to copy and distribute verbatim or modified | |
| copies of this license document, and changing it is allowed as long | |
| as the name is changed. | |
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE |
The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.
Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:
githubUsers
.filter(user => user.followers > 1000)
Looking into the Haskell/JS hybrid Roy, and one of the proposed features are lenses. They are basically sugar over attribute getters and setters, and look like this:
set .x 3 {x: 1, y: 2} == {x: 3, y: 2}
get .name {title: "Mr.", name: "Bob"} == "Bob"
This is much like Python's getattr and setattr, except that these are static (no
| // the first hack needed to support mutable refs in Roy is allowing in place edits | |
| // to JS arrays | |
| let aSet (arr:[#a]) (idx:Number) (v:#a) :[#a] = | |
| Array.prototype.splice.call arr idx 1 v | |
| arr | |
| // wrapper type is currently a structural type rather than an ADT because I couldn't | |
| // get ADTs to have an Array as a field | |
| type Ref = {_val: [#a]} |
| (def-alias Monad | |
| (TFn [[m :kind (TFn [[x :variance :covariant]] Any)]] | |
| '{:m-bind (All [x y] | |
| [(m x) [x -> (m y)] -> (m y)]) | |
| :m-result (All [x] | |
| [x -> (m x)]) | |
| :m-zero Undefined | |
| :m-plus Undefined})) | |
| (ann maybe-m (Monad |
| Moved to https://github.com/tonymorris/type-class |
| -- Inspired by http://www2.tcs.ifi.lmu.de/~abel/popl13.pdf | |
| [codata| | |
| codata Stream a where | |
| head :: Stream a -> a | |
| tail :: Stream a -> Stream a | |
| |] | |
| fib :: Stream Nat | |
| [copattern| |
| module Telescope where | |
| open import Function | |
| open import Data.Unit | |
| open import Data.Product | |
| open import Data.Nat | |
| open import Data.Vec | |
| infixr 6 _∷_ |
| Require Import Utf8. | |
| Inductive subtype (a b : Set) : Set := | |
| | ST : (a -> b) -> subtype a b. | |
| Infix ":>" := subtype (at level 50). | |
| Definition st {x y} f := ST x y f. | |
| Definition unpack {a b : Set} (st : a :> b) := |
