Gabriel Claramunt gclaramunt

Play Framework vs. the relative messiness of Yesod/Snap/Happstack/Scotty/raw WAI. Clojure has a similar (to Haskell's) story here. I'm understating it here, but this is pretty big. Most web applications are not special snowflakes, a framework to wrap-up common-case nonsense concisely is very valuable. Micro-framework stacks like using WAI directly or Scotty are good to have, but insufficient.

Specialized NLP libraries (in Java, at present) such as for medical lexicons. Might be replicable by being layered on top of existing Haskell NLP libs, but doesn't yet exist to my knowledge. Hardening up libraries like this usually takes a lot of time.

Slick is nicer and easier to get started with than Persistent. Partly due to documentation, partly because Slick isn't silly and embraces relational databases directly, partly because Persistent is just kind of hairy. Supporting MongoDB isn't a plus, it's a minus. Compromises the API anyway.

A migrations library of pretty much any sort at all.

Scala/xml equivalent i

hprof a builtin java agent which dumps profiling info at runtime
class sharing class file cache used for faster startup times
pack200 unpack200 uber packed jars
mission control a Profiling, Monitoring, and Diagnostics Tools Suite
jstat performance stats tool
jhat heap dump browser
jmap memory maps
jstack prints stack trace of running process

This is material to go along with a 2014 Boston Haskell talk.

We are going to look at a series of type signatures in Haskell and explore how parametricity (or lack thereof) lets us constrain what a function is allowed to do.

Let's start with a decidedly non-generic function signature. What are the possible implementations of this function which typecheck?

wrangle :: Int -> Int

	19:07 ~/Projects/Kepler_typemacros/sandbox (topic/typemacros)$ scalac Macros.scala
	19:07 ~/Projects/Kepler_typemacros/sandbox (topic/typemacros)$ scala -cp .
	Welcome to Scala version 2.10.1-20121120-175733-b60f5bcf2c (Java HotSpot(TM) 64-Bit Server VM, Java 1.6.0_37).
	Type in expressions to have them evaluated.
	Type :help for more information.

	scala> class C extends AnyRef with Macros.Foo[Int]("2")
	defined class C

	scala> new C().hello

	Hello scala, my old friend
	I've come to take you home again
	Because a feature slowly creeping
	left me plagued with doubts and weeping
	and the version that was tagged in the repo
	just has to go
	it lacks the signs of soundness

	On sleepless nights I hacked alone
	applying ant and other tools of stone

	import Data.Foldable
	import Data.Monoid

	pipeline :: [a -> a] -> a -> a
	pipeline = appEndo . getDual . foldMap (Dual . Endo)

	main = print $ pipeline [(+1), (*10)] 100

	trait Functorial[F[_], B] {
	def map[A](m: F[A])(f: A => B): F[B]
	}

	trait Monadic[M[_], B] extends Functorial[F, B] {
	def point(b: B): M[B]
	def flatMap[A](m: M[A])(f: A => M[B]): M[B]
	}

	trait Traversial[F[_], B] {

	[info] Starting scala interpreter...
	[info]
	Welcome to Scala version 2.10.2 (Java HotSpot(TM) 64-Bit Server VM, Java 1.7.0_21).
	Type in expressions to have them evaluated.
	Type :help for more information.

	scala> import shapeless._
	import shapeless._

	You appear to be advocating a new:

	[ ] cloud-hosted [ ] locally installable [ ] web-based [ ] browser-based [ ] language-agnostic
	[ ] language-specific IDE. Your IDE will not succeed. Here is why it will not succeed.

	You appear to believe that:
	[ ] Syntax highlighting is what makes programming difficult
	[ ] Garbage collection is free
	[ ] Computers have infinite memory
	[ ] Nobody really needs:

	module AlaCarte where

	-- Control.Monad.Free

	data Free f a = Free (f (Free f a)) \| Pure a

	instance Functor f => Monad (Free f) where
	Pure a >>= f = f a
	Free r >>= f = Free (fmap (>>= f) r)
	return = Pure