djspiewak

Moldbug Should Be Sanctioned

I want to start off by saying that I strongly respect John De Goes and the decision he made. If you haven't already read his extensive post about what he did and why he did it, I highly recommend you take the time. His post is thorough and generally persuaded me to his way of thinking, which is not that the works of Moldbug should be accepted or ignored, but that we need to be inclusive of differing beliefs in a community, so long as the holder of those beliefs is willing to "leave them at the door". This is a strong, intellectually defensible and consistent position.

However, as the day has gone on, and I've discussed this issue at length with many members of the community. I have come to the conclusion that this is idealistic, and ultimately missing the point. And as strange as it seems, the point is not that there is a literal Neo Nazi who will be speaking at a well-regarded conference! The point is somehow bigger tha

BekaValentine

import Control.Monad.Trans.Cont hiding (shift,reset)
import Control.Monad.Trans.Reader
import Control.Monad.Trans.State

txus

Memory as an effect

What if we treated memory as a side-effect?

Idris lets us track lots of things in the type system, in order to get errors at compile-time rather than at runtime. One of the tools that lets us do this in Idris is called Effects, and they're used to keep track of state, to manage file handlers, and lots more.

In barely 40 lines of Idris (which could be less if I had any idea what I'm

ekmett

{-# language KindSignatures #-}
{-# language PolyKinds #-}
{-# language DataKinds #-}
{-# language TypeFamilies #-}
{-# language RankNTypes #-}
{-# language NoImplicitPrelude #-}
{-# language FlexibleContexts #-}
{-# language MultiParamTypeClasses #-}
{-# language GADTs #-}
{-# language ConstraintKinds #-}

puffnfresh

module TraversePoint where

open import Level
open import Function
open import Relation.Binary.PropositionalEquality

record Monad {α} (T : Set α → Set α) : Set (suc α) where
  field
    bind : ∀ {A B : Set α} → (A → T B) → T A → T B
    point : ∀ {A : Set α} → A → T A

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

jlouis

8> eqc:module(z).
prop_find: Failed! After 1 tests.
{#Fun<eqc_fun.44.48683925>,0}
F = #Fun<eqc_fun.44.48683925>
Shrinking ...(3 times)
{#Fun<eqc_fun.44.48683925>,0}
F = fun(_) -> 0 end
[prop_find]

djspiewak

class Nat private (val value: Int) {

  // provably never imaginary
  def sqrt: Double = ???
}

object Nat extends (Int => Option[Nat]) {

  // lone introduction rule
  def apply(i: Int): Option[Nat] =

jamesmacaulay

-- paste into http://elm-lang.org/try and click "compile"
-- http://imgur.com/gallery/W6TwgZw

import Graphics.Collage exposing (..)
import Graphics.Element exposing (..)
import Text
import Color exposing (..)
import Time
import Signal

jozefg

module realize where
open import Relation.Nullary
import      Data.Empty       as E
open import Data.Product
open import Data.Sum
open import Data.Nat

data Term : Set where
  var    : ℕ → Term
  lam    : Term → Term