harrah

// in comments, the syntax:
//   [A](B => C)
// represents a quantified function literal parameterized by type A

object Z
{
	// The main type, a quantified function object
	trait Q[M[_], N[_]] { def apply[C](m: M[C]): N[C] }
	
		// Helper Types

cowboy

This is now an actual repo:

https://github.com/cowboy/jquery-tiny-pubsub

wrwills

import scalaz._

/**
 * playing with some of the ideas from the Haskell fclabels library
 * using the new Lens functionality in scalaz
 * 
 * http://hackage.haskell.org/package/fclabels
 */
object LensTest {

viktorklang

import scala.collection.mutable.ListBuffer
import akka.actor.{Actor,ActorRef}
import akka.actor.Actor._
import akka.routing.{ Listeners, Listen }

//Represents a domain event
trait Event

//A builder to create domain entities
trait EntityBuilder[Entity] {

debasishg

def enumResultSet[E,A](rs: ResultSet, iter: IterV[E, A], get: ResultSet => IO[E]): IO[IterV[E, A]] = {
    def loop(i: IterV[E, A]): IO[IterV[E, A]] =
      i.fold(done = (_, _) => i.pure[IO],
             cont = k => next(rs) >>= (hasMore =>
                         if (!hasMore) i.pure[IO]
                         else get(rs) >>= (t => loop(k(El(t))))))
    loop(iter)
}

kencoba

Inductive day : Type :=
  | monday : day
  | tuesday : day
  | wednesday : day
  | thursday : day
  | friday : day
  | saturday : day
  | sunday : day.

Definition next_weekday (d:day) : day :=

copiousfreetime

#!/usr/bin/env ruby

#
# A quick script to dump an overview of all the open issues in all my github projects
#

require 'octokit'
require 'awesome_print'
require 'rainbow'

remeniuk

class Aggregator(recipients: Iterable[ActorRef]) extends Actor{
    
  def receive = {
    case msg @ Message(text) => 
      println("Started processing message `%s`" format(text))
      
      val result = Promise[String]()          
      val promises = List.fill(recipients.size)(Promise[String]())
      
      recipients.zip(promises).map{case (recipient, promise) =>

oxbowlakes

/**
 * Part Zero : 10:15 Saturday Night
 *
 * (In which we will see how to let the type system help you handle failure)...
 *
 * First let's define a domain. (All the following requires scala 2.9.x and scalaz 6.0)
 */

import scalaz._
import Scalaz._

milessabin

object Tuples {
  import HLists._

  implicit def tuple1ToHList[A](t : Product1[A]) = new { def hlisted : A :: HNil = t._1 :: HNil }
  implicit def tuple2ToHList[A, B](t : Product2[A, B]) = new { def hlisted : A :: B :: HNil = t._1 :: t._2 :: HNil }
  implicit def tuple3ToHList[A, B, C](t : Product3[A, B, C]) = new { def hlisted : A :: B :: C :: HNil = t._1 :: t._2 :: t._3 :: HNil }

  implicit def hListToTuple1[A](h : A :: HNil) = new { def tupled : Tuple1[A] = Tuple1(h.head) }
  implicit def hListToTuple2[A, B](h : A :: B :: HNil) = new { def tupled : (A, B) = (h.head, h.tail.head) }
  implicit def hListToTuple3[A, B, C](h : A :: B :: C :: HNil) = new { def tupled : (A, B, C) = (h.head, h.tail.head, h.tail.tail.head) }