xaviervia

const c = directCell( x => console.log('a'))

c(1, 1) // nothing
c(1, 0) // 'a'

effect( next => cell( state => ).pipe(cell(x => y)) void ))

const a = Arrow( id )

a.product(a).product(a)([1, [2, 3]])

xaviervia

• Open https://astexplorer.net/
• Set it to JavaScript if it's not
• Set it to babylon6
• Paste the source.js code in the top left pane
• In the "Transform" menu on the top select babel6
• Copy the transform.js code in the bottom left page

xaviervia

import { createType } from './type'
import type {Data, Type, TypeChecker} from './type'

type IncT = Type<'Inc', number>
type DecT = Type<'Dec', number>
type ResetT = Type<'Reset', number>
type WhatT = Type<'What', number>
const IncAction: Data<IncT, number> = createType('Inc')
const DecAction: Data<DecT, number> = createType('Dec')
const ResetAction: Data<ResetT, number> = createType('Reset')

xaviervia

const createType = name => {
  const of = x => Object.freeze({
    '@@type': name,
    fold: f => f(x),
    map: f => of(f(x)),
    inspect: () => `${name}(${x})`
  })
  
  return {of}
}

xaviervia

withUncontrolledProp({
  prop: 'checked',
  defaultProp: 'autoChecked',
  handlers: {
    onClick: (previousProps) => !previousProps.checked
  }
})(CustomCheckbox)

xaviervia

class CustomCheckbox extends Component {
  constructor () {
    super()
    
    this.state = {
      checked: false
    }
  }
  
  componentWillMount () {

xaviervia

function CustomCheckbox ({ onClick, checked }) {
  return <div onClick={onClick}>
    {checked ? 'Checked' : 'Not checked'}
  </div>
}

xaviervia

const Cell = f => {
  const _c = Arrow((x, [h, t]) => {
    const fx = f(x)

    cond(
      [() => fx === h, Left([h, t])]]
      [true, Right([fx, t])]]
    )
  })

xaviervia

# Assumes that:
# - You are on the master branch
# - Your dist npm task puts things into the dist/ folder
gh-pages:
	-git checkout -b gh-pages
	git checkout gh-pages
	git merge master
	npm run dist
	cp dist/* .
	git add . && git commit -m "♻️ 📄"

xaviervia

• "Laws" test suite: run flowtyped functions to verify that a "monoid" (for example) really follows the laws for its empty and concat operations.