» tagged pages
» logout

sorted by: recent | see : popular
Content Tagged with compsci + types

The Comonad.Reader " The Cofree Comonad and the Expression Problem

The need for extensible cases to handle open variants as part of the expression problem.

Haskell: del.icio.us tag/haskell

The Comonad.Reader " Zipping and Unzipping Functors

How do we decide what functors are zippable?

Haskell: del.icio.us tag/haskell

Foundations for Structured Programming with GADTs

The standard theory of data types as carriers of initial algebras of functors can be extended from algebraic and nested data types to GADTs.

Haskell: del.icio.us tag/haskell

Arrows for Secure Information Flow

Embedded security sublanguage for enforcing information-flow policies in Haskel. Mechanisms include dynamic security lattices, run-time code privileges, declassification.

Haskell: del.icio.us tag/haskell

Polytypic programming at Chalmers

Many functions have to be written over and again on different types: they are polytypic. Examples include pretty printers, parsers, equality tests, rewriters. A polytypic function is defined by induction on the structure of user-defined types.

Haskell: del.icio.us tag/haskell