fernandocastor

Nos vários anos desde que comecei a lecionar uma disciplina sobre Software Livre no CIn-UFPE, tenho encorajado alunos a contribuírem com uma linha do tempo do Software Livre e de Código Aberto. Várias contribuições foram feitas (lista completa de contribuintes aqui), a maioria interessante. Entretanto, acho que poderia ser melhorada e muito através da adição de algumas entradas e remoção de outras, em particular aquelas que falam sobre projetos que, apesar de interessantes, não tiveram um grande impacto (ex., Wireshark). Por isso resolvi colocar essa linha do tempo aqui. Modificações são muito bem-vindas.

1886-09 Foi assinada a Convenção de Berna, um acordo internacional que visava proteger o direito autoral de obras literárias e artísticas estrangeiras, que mais tarde veio a englobar também os softwares.

1925-01 Walter Gifford, o

bishboria

These links no longer work. Springer have pulled the free plug.

Graduate texts in mathematics

duplicates = multiple editions

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

jadeallenx

tl;dr You should watch this.

It's interesting to me that a significant number of talks in this year's Strange Loop conference referenced a 1966 paper by Peter Landin called (somewhat tongue in cheek) "The Next 700 Programming Languages". In this paper, Landin describes a programming language which he says in a footnote might be aptly called "Church without the lambda" - but which in the paper is called "If You See What I Mean" (ISWIM).

Alvaro's talk delved deeply into the question of "What is the semantics or meaning of a program?" Alvaro's thesis is that the meaning of a program is to produce desired outcomes from a computing system but that current languages focus on

btholt

const React = require('react');
const _ = require('lodash');

var model = new falcor.Model({
  cache: {
    movies: [
      {
        title: "Daredevil",
        plot: "Marvel lol",
        year: "2015-",

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.

---

aras-p

// Just before switching jobs:
// Add one of these.
// Preferably into the same commit where you do a large merge.
//
// This started as a tweet with a joke of "C++ pro-tip: #define private public",
// and then it quickly escalated into more and more evil suggestions.
// I've tried to capture interesting suggestions here.
//
// Contributors: @r2d2rigo, @joeldevahl, @msinilo, @_Humus_,
// @YuriyODonnell, @rygorous, @cmuratori, @mike_acton, @grumpygiant,

ragingwind

Backend Architectures

Twitter

ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats

• Introduce Gizzard of Twitter - 트위터의 새로운 분산 관리 라이브러리 Gizzard를 소개합니다.
• The Architecture Twitter Uses to Deal with 150M Active Users, 300K QPS, a 22 MB/S Firehose, and Send Tweets in Under 5 Seconds
• Scaling Twitter: Making Twitter 10000 Percent Faster

5HT

Server-care HTML5

Micro, REST bindings and Simple Templating

Framework	Link	Star	Fork	Templating
Python: Flask,	https://github.com/mitsuhiko/flask	6887	1422	jinja
Ruby: Sinatra,	https://github.com/sinatra/sinatra	5097	792

pthariensflame

The Indexed State Monad in Haskell, Scala, and C#

Have you ever had to write code that made a complex series of succesive modifications to a single piece of mutable state? (Almost certainly yes.)

Did you ever wish you could make the compiler tell you if a particular operation on the state was illegal at a given point in the modifications? (If you're a fan of static typing, probably yes.)

If that's the case, the indexed state monad can help!

Motivation

ckirkendall

(use '[clojure.core.match :only [match]])

(defn evaluate [env [sym x y]]
  (match [sym]
    ['Number]   x
    ['Add]      (+ (evaluate env x) (evaluate env y))
    ['Multiply] (* (evaluate env x) (evaluate env y))
    ['Variable] (env x)))
    
(def environment {"a" 3, "b" 4, "c" 5})