plumenator

-- reference paper: https://www.cl.cam.ac.uk/%7Esd601/papers/semirings.pdf
{-# OPTIONS_GHC -Wno-incomplete-patterns #-}

import Data.List

infixl 9 |*|

infixl 8 |+|

-- closed semiring = ring with the usual rules, but w/o additive inverse, and w/ a closure operator

plumenator

Competitive Programming Syllabus

Geometry

• Graham Scan algorithm for Convex Hull O(n * log(n))
• Online construction of 3-D convex hull in O(n^2)
• Bentley Ottmann algorithm to list all intersection points of n line segments in O((n + I) * logn)
  • Suggested Reading - http://softsurfer.com/Archive/algorithm_0108/algorithm_0108.htm
• Rotating Calipers Technique
  • Suggested Reading - http://cgm.cs.mcgill.ca/~orm/rotcal.html

• Problems - Refer the article for a list of problems which can be solved using Rotating Calipers technique.

plumenator

Competitive Programming Syllabus

Geometry

• Graham Scan algorithm for Convex Hull O(n * log(n))
• Online construction of 3-D convex hull in O(n^2)
• Bentley Ottmann algorithm to list all intersection points of n line segments in O((n + I) * logn)
  • Suggested Reading - http://softsurfer.com/Archive/algorithm_0108/algorithm_0108.htm
• Rotating Calipers Technique
  • Suggested Reading - http://cgm.cs.mcgill.ca/~orm/rotcal.html

• Problems - Refer the article for a list of problems which can be solved using Rotating Calipers technique.

plumenator

{-# LANGUAGE DeriveFunctor #-}

module Main where

type Algebra f a = f a -> a

type Coalgebra f a = a -> f a

newtype Fix f = In { out :: f (Fix f) }

plumenator

Originally:
https://gist.github.com/7565976a89d5da1511ce

Hi Donald (and Martin),

Thanks for pinging me; it's nice to know Typesafe is keeping tabs on this, and I
appreciate the tone. This is a Yegge-long response, but given that you and
Martin are the two people best-situated to do anything about this, I'd rather
err on the side of giving you too much to think about. I realize I'm being very
critical of something in which you've invested a great deal (both financially

plumenator

package fpmax

import scala.util.Try
import scala.io.StdIn.readLine

object App0 {
  def main: Unit = {
    println("What is your name?")

    val name = readLine()

plumenator

Edit: This list is now maintained in the rust-anthology repo.

• Introduction
  • Understanding Over Guesswork
  • An Alternative Introduction to Rust
  • Rust and CSV Parsing
• Ownership
  • Where Rust Really Shines
  • Rust Means Never Having to Close a Socket
• The Problem with Single-threaded Shared Mutability

plumenator

import scala.util.{Try, Success, Failure}

def f(s: String): Try[Int] = Try { s.toInt }
def g(i: Int): Try[Int] = Try { i * 2 }
def unit[T](v: T): Try[T] = Success(v)

//val v = "1" 
val v = "bad"
val m = Success(v)

plumenator

• http://typelevel.org/blog/2016/08/21/hkts-moving-forward.html
• http://spray.io/blog/2012-12-13-the-magnet-pattern/
• http://eed3si9n.com/revisiting-implicits-without-import-tax
• http://ktoso.github.io/scala-types-of-types/
• http://blog.scalac.io/2015/10/22/shapeless-and-monads.html
• http://www.cakesolutions.net/teamblogs/copying-sealed-trait-instances-a-journey-through-generic-programming-and-shapeless
• http://www.oweinreese.com/blog/2016/3/16/over-constraining-the-a
• http://www.oweinreese.com/blog/2016/2/21/a-type-level-proof-of-uniqueness
• http://jto.github.io/articles/getting-started-with-shapeless
• http://dev.sortable.com/flatmap-to-option/

plumenator

Haskell Problems for a New Decade

[Haskell For a New Decade]

History of Haskell

[Wearing the hair shirt: a retrospective on Haskell (2003)]