briancavalier

//-------------------------------------------------------------
//
// Hypothesis:
//
// Promises/A is a Monad
//
// To be a Monad, it must provide at least:
// - A unit (aka return or mreturn) operation that creates a corresponding
//   monadic value from a non-monadic value.
// - A bind operation that applies a function to a monadic value

domenic

This article has been given a more permanent home on my blog. Also, since it was first written, the development of the Promises/A+ specification has made the original emphasis on Promises/A seem somewhat outdated.

You're Missing the Point of Promises

Promises are a software abstraction that makes working with asynchronous operations much more pleasant. In the most basic definition, your code will move from continuation-passing style:

getTweetsFor("domenic", function (err, results) {
 // the rest of your code goes here.

rgs

Falsehoods programmers believe about prices

1. You can store a price in a floating point variable.
2. All currencies are subdivided in 1/100th units (like US dollar/cents, euro/eurocents etc.).
3. All currencies are subdivided in decimal units (like dinar/fils)
4. All currencies currently in circulation are subdivided in decimal units. (to exclude shillings, pennies) (counter-example: MGA)
5. All currencies are subdivided. (counter-examples: KRW, COP, JPY... Or subdivisions can be deprecated.)
6. Prices can't have more precision than the smaller sub-unit of the currency. (e.g. gas prices)
7. For any currency you can have a price of 1. (ZWL)
8. Every country has its own currency. (EUR is the best example, but also Franc CFA, etc.)

staltz

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

lukesteensen

defmodule Transducers do
  def map(f) do
    fn(step) ->
      fn(x, result) ->
        step.(f.(x), result)
      end
    end
  end

  def filter(pred) do

magnobiet

Acessibilidade

Referências

• Acesso Digital
• Acessibilidade Legal
• Satisfazendo os requisitos básicos de acessibilidade (HTML)
• Projetando a acessibilidade com o HTML5

Manuais

• DESENVOLVENDO SITES ACESSÍVEIS - Manual do Desenvolvedor

mrkaspa

var trampoline = function (f) {
    while (f && f instanceof Function) {
        f = f.apply(f.context, f.args);
    }
    return f;
}

var thunk = function (fn) {
    return function () {
        var args = Array.prototype.slice.apply(arguments);

tel

/* eslint-disable new-cap */

/**
 * Lens types.
 * ===========
 *
 * a * b = {fst: a, snd: b}
 * a + b = {index: Boolean, value: a | b}
 *
 * Iso   s t a b = forall (~>) . Profunctor (~>) => (a ~> b) -> (s ~> t)

TheBB

Emacs packages, features, files, layers, extensions, auto-loading, require, provide, use-package… All these terms getting you confused? Let’s clear up a few things.

Files

Emacs files contains code that can be evaluated. When evaluated, the functions, macros and modes defined in that file become available to the current Emacs session. Henceforth, this will be termed as loading a file.

One major problem is to ensure that all the correct files are loaded, and in the

DmitrySoshnikov

/**
 * LL(1) parser. Building parsing table, part 1: First and Follow sets.
 *
 * NOTICE: see full implementation in the Syntax tool, here:
 * https://github.com/DmitrySoshnikov/syntax/blob/master/src/sets-generator.js
 *
 * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com>
 * MIT Style License
 *
 * An LL(1)-parser is a top-down, fast predictive non-recursive parser,