» tagged pages
» logout

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

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

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

Graham Hutton: Publications

<sep/>operational semantics makes it ideal for implementation in a functional programming language such as Haskell.

Haskell: del.icio.us tag/haskell

Composing monads using coproducts

General (nearly all monads compose), mathematically elegant (use the standard categorical tools underpinning monads) and computationally expressive (support a canonical recursion operator).

Haskell: del.icio.us tag/haskell

Functional Thinking " Deriving an Efficient nub Using Worker/Wrapper

A systematic way of solving the problem of finding an efficient nub for Int's, using recent work on the worker/wrapper transformation.

Haskell: del.icio.us tag/haskell

Clean

The programming language Clean is a general purpose, pure and lazy functional programming language.

Haskell: del.icio.us tag/haskell

There and Back Again: Arrows for Invertible Programming

Introduces bidirectional arrows. The bi-arrow class extends arrows with an extra combinator that changes the direction of computation. Specify a conversion in one direction (e.g. parser), and get the inverse (pretty printer) almost for free.

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

The zipper

Almost every programmer has faced the problem of representing a tree together with a subtree that is the focus of attention, where that focus may move. The Zipper is Huet’s nifty name for a nifty data structure which fulfills this need.

Haskell: del.icio.us tag/haskell

Research papers/Functional pearls - HaskellWiki

Functional pearls are elegant, instructive examples of functional programming. They are supposed to be fun, and they teach important programming techniques and fundamental design principles. They traditionally appear in The Journal of Functional Programmi

Haskell: del.icio.us tag/haskell

Research papers/Functional pearls - HaskellWiki

Elegant, instructive examples of functional programming. Supposed to be fun, and teach important programming techniques and fundamental design principles. Traditionally appear in Journal of Functional Programming, and at ICFP and affiliated workshops.

Haskell: del.icio.us tag/haskell

Why Functional Programming Matters

As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can be re-used to reduce future programming costs. Conventio

Haskell: del.icio.us tag/haskell

Monads in functional programming - Wikipedia, the free encyclopedia

Monads are used in functional programming to express input/output (I/O) operations and changes in state without using language features that introduce side effects.

Haskell: del.icio.us tag/haskell

CircularProgramming - The Haskell Wiki

Use lazy evaluation to access results which could not possibly be calculated yet.

Haskell: del.icio.us tag/haskell

Page 1 | Next >>