Tumblelog by Soup.io
Newer posts are loading.
You are at the newest post.
Click here to check if anything new just came in.

December 07 2013

Dependently Typed Programming in Agda

In Hindley-Milner style languages, such as Haskell and ML, there is a clear separation between types and values. In a dependently typed language the line is more blurry – types can contain (depend on) arbitrary values and appear as arguments and results of ordinary functions.

Dependently Typed Programming in Agda

In Hindley-Milner style languages, such as Haskell and ML, there is a clear separation between types and values. In a dependently typed language the line is more blurry – types can contain (depend on) arbitrary values and appear as arguments and results of ordinary functions.

January 19 2013

Simonpj/Talk:FunWithTypeFuns - HaskellWiki

Ole Kiselyov, Simon Peyton Jones, Chung-chieh Shan: Tony Hoare has always been a leader in writing down and proving properties of programs. To prove properties of programs automatically, the most widely used technology today is by far the ubiquitous type checker. Alas, static type systems inevitably exclude some good programs and allow some bad ones. This dilemma motivates us to describe some fun we've been having with Haskell, by making the type system more expressive without losing the benefits of automatic proof and compact expression.

Simonpj/Talk:FunWithTypeFuns - HaskellWiki

Ole Kiselyov, Simon Peyton Jones, Chung-chieh Shan: Tony Hoare has always been a leader in writing down and proving properties of programs. To prove properties of programs automatically, the most widely used technology today is by far the ubiquitous type checker. Alas, static type systems inevitably exclude some good programs and allow some bad ones. This dilemma motivates us to describe some fun we've been having with Haskell, by making the type system more expressive without losing the benefits of automatic proof and compact expression.

January 17 2013

IO inside

The following text is an attempt to explain the details of Haskell I/O implementations.

IO inside

The following text is an attempt to explain the details of Haskell I/O implementations.

January 03 2013

Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell

Simon Peyton Jones: This tutorial focuses on explaining the "bits round the edges" of Haskell programs, rather than the beautiful functional core we all know and love.

Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell

Simon Peyton Jones: This tutorial focuses on explaining the "bits round the edges" of Haskell programs, rather than the beautiful functional core we all know and love.

September 05 2012

Type Families

Type families are a Haskell extension supporting ad-hoc overloading of data types

Generalized Algebraic Datatypes (GADT)

Generalized Algebraic Datatypes basically allow you to explicitly write down the types of the constructors of a type

Phantom type

A phantom type is a parametrized type whose parameters do not all appear on the right-hand side of its definition

August 08 2011

July 25 2011

July 17 2011

July 16 2011

October 28 2010

October 25 2010

April 08 2010

April 07 2010

Older posts are this way If this message doesn't go away, click anywhere on the page to continue loading posts.
Could not load more posts
Maybe Soup is currently being updated? I'll try again automatically in a few seconds...
Just a second, loading more posts...
You've reached the end.

Don't be the product, buy the product!

Schweinderl