All Articles

1-24 of 4183 // 1 2 3 4 ... 173 174 175 »
  1. Programming Haskell: String processing (with a dash of concurrency)

    cgi.cse.unsw.edu.au (Jul 17 2008) Explore Article

    This is part two in a series of tutorials on programming Haskell. You can get up to speed by reading yesterday's introductory article. Today we'll look more into the basic tools at our disposal in the Haskell language, in particular, operations for doing IO and playing with files and strings. Administrivia Before we get started, I should clarify a small point raised by yesterday's article. One issue I forgot to ...

    Comment on Article Mentions:   Haskell

  2. Jan's homepage

    XS4ALL internet (Jul 17 2008) Explore Article

    I'm Jan Kort and I'm an "AIO" at the UvA (University of Amsterdam). If everything goes as planned I'll have my doctorate in July 2003. My CV (in Dutch). Haskell Ray Tracer Here's a picture I made with the Haskell ray tracer I wrote for my master thesis, also take a look at the sources to see how convenient Haskell is a as a scene description language. The walls are ...

    Comment on Article Mentions:   Haskell

  3. Scrap your type applications

    Microsoft Research Home (Jul 17 2008) Explore Article

    many type applications can be implicit. Supports decidable type checking and strong normalisation. Haskell experiments suggest it could reduce the amount of intermediate code in compilers using System F

    Comment on Article Mentions:   Benjamin C. Pierce   Jeremy Gibbons   Systems

  4. Using “foldr” in Haskell

    InquiryLabs (Jul 17 2008) Explore Article

    Author: Duane Johnson 17 Jul I’ve been reading Real World Haskell lately in order to get a better grasp on Haskell and functional programming. It’s a book I’d highly recommend—especially when it’s done! One of the fundamental building-blocks of Haskell is the foldr method which, I am told, is called a “primitive recursive” function because it is capable of building any function in a set of useful recursive functions (e.g. ...

    Comment on Article Mentions:   Haskell

  5. eigenclass - Reexamining qsort, eager vs. lazy algorithm analysis and Ruby's (and other's) GC

    eigenclass (Jul 17 2008) Explore Article

    The Comonad.Reader article attempted to reconcile the theory with the observation that the "quicksort" based on difference lists scales better than the original one. We came up with the following conjecture: what if the amount of GC work scales superlinearly? The improved function uses less memory and would thus be less affected, if GHC's GC had for instance a term. Ruby's GC, for instance, does work (n being the amount ...

    Comment on Article

  6. Haskell Quicksort: A Sort of Difference

    DZone (Jul 17 2008) Explore Article

    Recently there was a post on eigenclass that was picked up by programming.reddit wherein the author performed an analysis of the classic Haskell quicksort example and tried to reverse the folklore understanding that as classically implemented the quicksort used by most Haskell programmers has an n^2 average case performance. Bowing to Lennart's biases I'll admit the Haskell quicksort is not exactly the same thing and refer to it as "quicksort" ...

    Comment on Article Mentions:   Haskell

  7. July 16 Haskell Weekly News Available

    plnews.org (Jul 17 2008) Explore Article

    The July 16, 2008 edition of the Haskell Weekly News is now available. It summarises recent developments and discussion within the Haskell community.

    Comment on Article Mentions:   Haskell Weekly News

  8. λ Tony's blog λ " Blog Archive " Haskell exercises for beginners

    λ Tony’s blog λ (Jul 16 2008) Explore Article

    #λ Tony’s blog λ RSS Feed λ Tony’s blog λ The weblog of Tony Morris « Scala exercises for beginners Haskell exercises for beginners The exercises below are similar to my previous ‘Scala exercises for beginners’, except the rules a little clearer. For those of who have emailed me or submitted responses here on the blog, I will get around to providing you feedback, however, I’d prefer to do so ...

    Comment on Article Mentions:   Haskell

  9. Holden Karau: Integrating your HUnit (or other) tests into your cabal package

    Holden's Blog (Jul 16 2008) Explore Article

    As part of one my side projects I'm working on learning haskell, and creating a simple DNSBL lookup tool. An important part of any project, especially one which you plan to build on top off is its testing. There are quite a few options for Haskell testing such as quickcheck,etc., and the one that I ended up using HUnit. Most developers that I know have been burned at one time ...

    Comment on Article

  10. Beta availability hiccups

    Real World Haskell (Jul 16 2008) Explore Article

    The server that’s hosting the beta content is misbehaving mysteriously, and is currently down. When it comes back up, I’ll rescue a fresh backup of the comments from it and move the whole lot to a more stable host. Sorry for the inconvenience.

    Comment on Article

  11. 3.2. Loading source files

    Haskell (Jul 16 2008) Explore Article

    Prev Chapter 3. Using GHCi Next Suppose we have the following Haskell source code, which we place in a file Main.hs: main = print (fac 20) fac 0 = 1 fac n = n * fac (n-1) You can save Main.hs anywhere you like, but if you save it somewhere other than the current directory^3] then we will need to change to the right directory in GHCi: Prelude> :cd dir ...

    Comment on Article Mentions:   Haskell

  12. Ralf Lammel: The Expression Lemma – Explained

    MSDN Blogs (Jul 16 2008) Explore Article

    I have been somewhat silent for all kinds of boring reasons, but also quite so because I am terribly slow in grasping even basic category theory. (You don’t need to have any such knowledge to enjoy this post – just a bit of time because I guess this is going to be the longest blog post ever.) Still all the categorical pain was worth it, and here is why … ...

    Comment on Article Mentions:   Haskell

  13. A Sort of Difference

    The Comonad.Reader (Jul 16 2008) Explore Article

    Recently there was a post on eigenclass that was picked up by programming.reddit wherein the author did an analysis of the classic Haskell quicksort example. and tried to reverse the general understanding that as classically implemented the quicksort used by most Haskell programmers has an n^2 average case performance. Bowing to Lennart's biases I'll admit the Haskell quicksort is not exactly the same thing and refer to it as "quicksort" ...

    Comment on Article Mentions:   Haskell

  14. Haskell Weekly News: July 16, 2008

    The Haskell Sequence (Jul 16 2008) Explore Article

    Haskell Weekly News: July 16, 2008 Welcome to issue 77 of HWN, a newsletter covering developments in the Haskell community. Announcements Takusen 0.8.3. Alistair Bayley announced the release of Takusen 0.8.3, with ODBC support, more Cabal improvements, bug fixes, and some basic result-set validation. Launching Haskell Group in Vancouver, Canada. Jon Strait announced that a Haskell Programmers Group has been created in Vancouver; the first meeting is scheduled for next ...

    Comment on Article Mentions:   Dan Piponi   Bryan O'Sullivan   Ghc Api

  15. Real World Haskellers at Oscon next week

    Real World Haskell (Jul 16 2008) Explore Article

    John and I will be in Portland, Oregon next week for OSCON. I’ll be giving a Haskell overview talk on Thursday at 17:20, but I’ll be around for a few days before and after. Our co-author, Don, actually lives in Portland. If you are based in Portland or visiting OSCON, and you’d be interested in meeting [...]

    Comment on Article Mentions:   Haskell

  16. ExistentialQuantification - Haskell Prime - Trac

    HackageDB (Jul 16 2008) Explore Article


    Comment on Article

  17. Network.CGI.Cookie

    Haskell (Jul 16 2008) Explore Article

    Portability portable General server side HTTP cookie library

    Comment on Article

  18. Followup: CSV Parsing in Haskell and Python « tech guy in midtown

    tech guy in midtown (Jul 16 2008) Explore Article

    Followup: CSV Parsing in Haskell and Python July 15, 2008 at 11:57 pm · Filed under Haskell, Programming Languages, Python ·Tagged Haskell, Python Tonight I tried improving the Haskell version of my CSV data analysis program. None of the changes made the Haskell program perform as well as the Python program. Still, I thought I’d share the results. I first tried using the Parsec code discussed in the Real World ...

    Comment on Article Mentions:   Haskell

  19. Haskell/Euler_Problem_201.Html

    maztravel.com (Jul 16 2008) Explore Article

    Solving Euler Problem 201 View my profile on Mazatlan Please help the animals of Mazatlan PayPal - The safer, easier way to pay online! A Tale of Two Approaches A recent Euler Problem, number 201, asks for the unique sums in the 50 element subsets of the set S = {1^2, 2^2, ... , 100^2}. It mentions that S has 100891344545564193334812497256 50-element subsets, so clearly calculating all combinations is not ...

    Comment on Article

  20. Sphinx full-text searching client on Hackage - fa.haskell | Google Groups

    Google Groups (Jul 16 2008) Explore Article


    Comment on Article

  21. vector 0.1 (efficient arrays with lots of fusion) - fa.haskell | Google Groups

    Google Groups (Jul 16 2008) Explore Article


    Comment on Article

  22. Dobbs Code Talk - What Type of Optimization Excites Me

    Dobbs Code Talk (Jul 16 2008) Explore Article

    What Type of Optimization Excites Me PDF Print E-mail Written by Christopher Diggins 07/16/08 I tend to get excited by estoeric stuff ignored by the mainstream. When it comes to optimization, I am really excited about the potential for optimizing code written in the functional programming style. Especially FP code that is succinct and clear. I read this the other day: The Erlang code is written in a Haskell-style, with ...

    Comment on Article Mentions:   Haskell   Erlang

  23. Paste number 58366: my xmonad config

    paste.lisp.org pastebin (Jul 16 2008) Explore Article

    Annotate this paste Pasted by: sphynx 3 months, 2 weeks ago None Paste contents: Raw Source | XML | Display As OK -- -- dying_sphynx's xmonad config file

    Comment on Article

  24. Parsec, a fast combinator parser

    Microsoft Research Home (Jul 15 2008) Explore Article

    Daan Leijen University of Utrecht Dept. of Computer Science PO.Box 80.089, 3508 TB Utrecht The Netherlands daan@cs.uu.nl, http://www.cs.uu.nl/~daan 4 Oct 2001 Introduction Parsec is an industrial strength, monadic parser combinator library for Haskell. It can parse context-sensitive, infinite look-ahead grammars but it performs best on predictive (LL) grammars. Combinator parsing is well known in the literature and offers several advantages to YACC or event-based

    Comment on Article Mentions:   Haskell

1-24 of 4183 // 1 2 3 4 ... 173 174 175 »
Home All Articles Entities Quotes Comments Login Register Powered by HiveFire