monoidal
Tuesday, January 29, 2013
On safety and abstraction
›
Haskell does not have full-fledged dependent types. For example, there is no way to create naturals as a subset of integers. One way to side...
Monday, September 17, 2012
A kind for regions
›
With a new powerful kind system in GHC, there are many lurking opportunities for expressive programming. Here's one. What is the kind ...
Thursday, May 24, 2012
A toy version of Safe Haskell
›
The idea of Safe Haskell is to control unsafe operations. Here is an alternative idea of implementation. Define a class > {-# LANGUAGE ...
3 comments:
Monday, April 16, 2012
Descending the level ladder
›
The following is a way to compute 2+1 using the GHC type system. The ":kind!" command tells GHCi to display normalized version of ...
2 comments:
Thursday, October 27, 2011
Kind polymorphism - a draft
›
I extended the post on kind polymorphism to Omega, and I'm rather satisfied - I captured 10 different senses of monoids, used level pol...
2 comments:
Wednesday, September 1, 2010
Algorithms and functions
›
Consider the following two functions: f :: () -> () f = const () g :: () -> () g = id Is there a way to write a function that tells th...
1 comment:
Thursday, July 29, 2010
The universal space
›
Take (or imagine) a blank sheet of paper. This is a plane. You can put points and vectors on it. A vector connects two points, but it is ...
2 comments:
›
Home
View web version