[Haskell] Speed of development/change? Re: Haskell as a disruptive technology?
Paul Johnson <[EMAIL PROTECTED]> writes: > So I tried to summarise the Haskell "value proposition" compared to the > incumbent languages. Thats what it looks like to me, and I am not exactly > ignorant on the subject, so I suggest we take it as a given for now and look > at the real question: > > Is there a market that is poorly served by the incumbent languages for which > Haskell would be an absolute godsend? What about speed of development, and speed of change? One of the pragmatic programmer guys recently suggested that software development could become simple enough that you could have a dev on every street corner. You'd walk down to the corner and ask for certain app, then get it in a few hours. Abstraction addiction can be a danger, but it also lets you put out working code in a tiny amount of time, as well as later extend that code to add new features in equally small amounts of time. What if development time for new programs was measured in days not years? -- I've tried to teach people autodidactism,| ScannedInAvian.com but it seems they always have to learn it for themselves.| Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Re: Trying On Learn Haskell Web Server
Graham Klyne <[EMAIL PROTECTED]> writes: > - Easy mapping from Haskell data structures to underlying SQL - what would be > called an Object-Relational Mapper (ORM) in OO languages For this, what about SerTH[1] on top of HaskellDB? [1] http://www.cs.helsinki.fi/u/ekarttun/SerTH/ -- I've tried to teach people autodidactism,| ScannedInAvian.com but it seems they always have to learn it for themselves.| Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Re: Trying On Learn Haskell Web Server
"Cale Gibbard" <[EMAIL PROTECTED]> writes: > Looks like there's an updated version here which supports dynamically > loadable plugins: http://www.mdstud.chalmers.se/~md9ms/hws-wp/ Peter Thiemann has a more recent version that uses hs-plugins: http://www.informatik.uni-freiburg.de/~thiemann/haskell/WASH/ -- I've tried to teach people autodidactism,| ScannedInAvian.com but it seems they always have to learn it for themselves.| Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Re: Simple and Easy Persistence
"Matthew M. Munz" <[EMAIL PROTECTED]> writes: >I have some program data that I'd like to persist. I could just use read > and show and file I/O to store arrays as files. [1] This works and it is easy > and simple (which I like) but it is also inefficient and a little cumbersome. I like SerTH - http://www.cs.helsinki.fi/u/ekarttun/SerTH/ -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Accessing The Haskell community via nntp, http, and smtp, was Re: Making Haskell more open
Tomasz Zielonka <[EMAIL PROTECTED]> writes: > That's a good point... or points. I also like newsgroups, but I haven't > used them in a while, probably because most of discussions about haskell > take place on mailing lists. > > Maybe it's time to register comp.lang.haskell? > > Could someone tell me something about fa.haskell? Is it a mirror of > [EMAIL PROTECTED] Can it be used to post messages through NNTP? I use gmane.org for all my mailing lists. I use gnus in emacs, and I have: (setq gnus-select-method '(nntp "news.gmane.org")) Subscribe to newsgroups that match gmane.comp.lang.haskell.*, and you're done. > How about an integrated newsgroup+mailinglist+forum. If we had a > two-way newsgroup+mailinglist integration, people could use it also > as a forum, for example through gmail.google.com. But I don't use > fora, so I probably talk nonsense. That would be gmane.org. It has a web interface[1] [2], nntp interface, and it works with all mailing lists that subscribe to it. It's also free. [1] http://blog.gmane.org/gmane.comp.lang.haskell.general/ [2] http://news.gmane.org/gmane.comp.lang.haskell.general -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Making the haskell.org website more open with a wiki? was Re: Making Haskell more open
Wolfgang Jeltsch <[EMAIL PROTECTED]> writes: > Am Freitag, 11. November 2005 12:22 schrieb Udo Stenzel: > > Seperation of article and discussion is a cultural, not a technical > > problem. > > One thing I always disliked about the Haskell Wiki is that you often have a > short "article" and then a lot of user comments. What people searching for > information on a certain topic mostly want is a consistent article describing > the topic, not a text with a mix of pieces certain users threw in. That's part of the goal of The Monad.Reader, but feel free to refactor Wiki pages from ThreadMode into DocumentMode. (see ThreadMode and DocumentMode on http://c2.com/cgi/wiki?WikiModes ) > > What HaWiki needs is not yet another wiki engine > > I think, the discussion was not about basing the HaWiki on a different wiki > engine but to create a new wiki which should be a replacement for the whole > Haskell website. If a wiki engine in Haskell is a good motivation, there's always Flippi. My only worry with the current wiki is the licensing. There's no overall license required for content contributed, so example code can't be directly used in OSS or commercial projects. I'd like to freeze the wiki at some point and create a new wiki instance with a sensible license, whether it be BSD3, Creative Commons, Gnu FDL, or whatever fits. Moving the existing website to a wiki will solve the problems of community updating, searching, file attachments, and the like. On the other hand, those same problems could also be solved by putting the website into a darcs repository and allowing certain users to push changes. Then anyone could send a patch to one of those certain users. -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] The Monad.Reader - http://www.haskell.org/tmrwiki/IssueFive
For issue five, the subjects are a short introduction to Haskell, generating polyominoes, a ray tracer, number parameterized types, practical graph manipulation, and a short introduction to software testing in Haskell. The Monad.Reader is always in need of articles related to Haskell if you want to write an article, contact Shae Erisson! http://www.haskell.org/tmrwiki/IssueFive -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Re: pros and cons of static typing and side effects ?
mt <[EMAIL PROTECTED]> writes: > Most hackers I know have been disappointed by the ML family. Languages with > static typing would be more suitable if programs were something you thought > of in advance, and then merely translated into code. But that's not how > programs get written. Type inferencing gives you 'compile time dynamic typing', so you don't have to think too much in advance. Representing a problem domain with types is roughly equivalent to using objects for the same purpose. > The inability to have lists of mixed types is a particularly crippling > restriction. It gets in the way of exploratory programming (it's convenient > early on to represent everything as lists), and it means you can't have real > macros. Haskell has lists of mixed type, see http://homepages.cwi.nl/~ralf/HList/ I think it's more convenient to represent everything as algrebraic datatypes. ADTs are sort of 'semantic lego' in that they represent the shape of the data. For example, the Tree datatype in http://www.haskell.org/hawiki/HaskellDemo : data Tree a = Nil | Node (Tree a) a (Tree a) says that a tree value can be either Nil or a Node that holds two tree values and something else, like Int, String, Double, or whatever you choose. How do lists of mixed types affect macros? Static typing in Haskell doesn't have that many downsides. A type system and checker is a simplified proof assistant implementation. You state certain properties about your program and the system checks for you. You can use the type system heavily, or skip most of the type checking. When I'm writing new code, my approach depends on my knowledge of the problem. Sometimes I ignore the types and just get the code working, and sometimes I write down the type signatures first and figure out the code from there. >From my viewpoint, type systems are one tool in the toolbox, no silver bullet, but at least a multitool :-) -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] June Issue of The Monad.Reader now online - http://www.haskell.org/tmrwiki/IssueThree
http://www.haskell.org/tmrwiki/IssueThree This month's issue has a definite introductory theme. It includes republished book reviews, notes on learning, a look at the differences between functional and object oriented programming, and distributed computation. As always, The Monad.Reader invites submissions on Haskell and related topics. Send a summary or abstract for your article to [EMAIL PROTECTED] As the summer approaches, it's getting harder to find authors. The Monad.Reader is fueled entirely by articles and time contributed by the community. Please contribute! -- It seems I've been living two lives. One life is a self-employed web developer In the other life, I'm shapr, functional programmer. | www.ScannedInAvian.com One of these lives has futures (and subcontinuations!)| --Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Been there, it's great. Let's do it again, Re: HaskellForge
Samuel Bronson <[EMAIL PROTECTED]> writes: > I'm sure most of us have used CVS and/or SVN with existing projects > (or before darcs, or for things which need to run everywhere and not > just where GHC runs), and some of us probably don't like darcs, but > that doesn't mean others of us don't feel the need for darcs hosting. I can attest to this. I've been hosting various darcs repos and mirros for some people on #haskell. I had a GForge test installation on ScannedInAvian.org years ago. I hacked in darcs support by slightly modifying the ssh key submission to allow submission of GPG keys. It's easy to get an ugly but working solution. Thesis: The Haskell community needs a HaskellForge. Point: Users can't find libraries and their details. Counterpoint: Hackage will cover that for smaller projects. Supporting evidence: I recently asked someone why they chose OCaml over Haskell. They said it's because OCaml has a wider range of libraries, especially OpenGL and SDL bindings. I know that Haskell has both of those, but it would appear that he couldn't find them. Here's a regular scavenger hunt you can see in the #haskell logs. What's the difference between HOpenGL and OpenGL? Where are the docs? Which one is included with the ghc6 debs? I'm not picking on HOpenGL specifically, I can think of lots of projects where details are hard to find (my code too!). Some others that come to mind are SOEGraphics and Yampa / Yampa Arcade. Coming at it from the other direction, can you figure what projects are on haskell.org? How many project webpages can you find without Google? I think the biggest lack is a searchable index of packages and details. A HaskellForge would have a searchable index of projects, but so will Hackage. But, hackage and cabal are more like deb/rpm than sourceforge. Hackage will never cover mailing lists, forums, or bug/feature trackers. So, I guess it depends on what you think the Haskell community needs. -- It seems I've been living two lives. One life is a self-employed web developer In the other life, I'm shapr, functional programmer. | www.ScannedInAvian.com One of these lives has futures (and subcontinuations!)| --Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] fptools tree bsd3 licensed? was Re: PPrint license
Samuel Bronson <[EMAIL PROTECTED]> writes: > Anybody know anything about this? I think anything in fptools is BSD3 licensed, but I'm not sure if that's true. -- Genius is an action. - Shae Matijs Erisson - http://www.ScannedInAvian.com ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Re: Beyond ASCII only editors for Haskell
Mads Lindstrøm <[EMAIL PROTECTED]> writes: > But we do not have to leave out ASCII based editors - atleast to begin > with. You can be showing functions like sqrt using real math symbol and at > the same time store your documents as ordinary Haskell sources, which can be > read by any editor. This would of cause require the editor to have a faily > big understanding of the Haskell language. And it can only go so far, some > math stuff will require richer formats that cannot be translated nicely to > ordinary Haskell sources. This has been done, Luke Gorrie wrote pretty-lambda.el: http://www.emacswiki.org/cgi-bin/wiki/PrettyLambda Jorge Adriano did something similar for Haskell with x-symbol: http://www.haskell.org/pipermail/haskell-cafe/2002-August/003237.html Pugs is doing this directly: http://use.perl.org/~autrijus/journal/24762 For more exciting possibilities, the plan for the Yi editor is to have parser-based modes. That would allow you to do much more than what's mentioned above. -- It seems I've been living two lives. One life is a self-employed web developer In the other life, I'm shapr, functional programmer. | www.ScannedInAvian.com One of these lives has futures (and subcontinuations!)| --Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Existing Haskell IPv6 Code was Re: Should inet_ntoa Be Pure?
Peter Simons <[EMAIL PROTECTED]> writes: > Considering that as of today _none_ of these variations has the slightest > idea what IPv6 is, it might be worth trying to unify that. Einar Karttunen's network-alt supports IPv6, datagram, and more: http://www.cs.helsinki.fi/u/ekarttun/network-alt/ -- It seems I've been living two lives. One life is a self-employed web developer In the other life, I'm shapr, functional programmer. | www.ScannedInAvian.com One of these lives has futures (and subcontinuations!)| --Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] The Monad.Reader - http://www.haskell.org/tmrwiki/IssueTwo
For issue two, the subjects are Template Haskell, better module compatibility, exploring dark corners of GHC, domain specific languages, and the Foreign Function Interface. We've also switched to an experimental wikipublishing format, in hopes of removing the bottlenecks that showed up in the first issue, and encouraging more peer review. We'd like to hear your feedback! http://www.haskell.org/tmrwiki/IssueTwo -- It seems I've been living two lives. One life is a self-employed web developer In the other life, I'm shapr, functional programmer. | www.ScannedInAvian.com One of these lives has futures (and subcontinuations!)| --Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] QuickCheck typeclass properties was Re: MonadPlus
Jan-Willem Maessen <[EMAIL PROTECTED]> writes: >> PS: your discussion of the laws of MonadPlus reinforces to me the real need >> for being able to declare the laws that a typeclass should satisfy, not just >> the signature. > On this I cannot but agree. But we don't usually count on being able to > prove these by construction. Still, including QuickCheck tests for typeclass laws would be nice. For example, QuickCheck.Utils has isAssociative, isCommutable, isTotalOrder. http://www.haskell.org/ghc/docs/latest/html/libraries/QuickCheck/Test.QuickCheck.Utils.html -- Programming is the Magic Executable Fridge Poetry, | www.ScannedInAvian.com It is machines made of thought, fueled by ideas. | -- Shae Matijs Erisson ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] First Issue of The Monad.Reader is online.
The first issue of The Monad.Reader is available: http://www.haskell.org/hawiki/TheMonadReader_2fIssueOne We'd like to hear what you think: http://www.haskell.org/hawiki/TheMonadReader_2fIssueOne_2fFeedBack -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
[Haskell] The Monad.Reader - Become an author for the Haskell eZine!
There are plenty of academic papers about Haskell, and plenty of informative pages on the Haskell Wiki. But there's not much between the two extremes. The Monad.Reader aims to fit in there; more formal than a Wiki page, but less formal than a journal article. Want to write about a tool or application that deserves more attention? Have a cunning hack that makes coding more fun? Got that visionary idea people should know about? Write an article for The Monad.Reader! Contact Shae Erisson ( [EMAIL PROTECTED] ) to become an author, or talk to shapr on the #haskell irc channel on irc.freenode.net. Check the current roster - http://www.haskell.org/hawiki/TheMonadReader Publishing Format: * Input is LaTeX (or just plaintext and images). * Output is Web and PDF/PS. * Release once a month. * Each article in a darcs repo for easy collaboration between author and editor. License: *BSD-like, feel free to read it, teach it, hack it, copy it, improve it. The Monad.Reader: sequencing your input since 2005 -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
Declarative Parallelism was Re: [Haskell] Implicit parallel functional programming
"Satnam Singh" <[EMAIL PROTECTED]> writes: > I'm trying to find out about existing work on implicit parallel functional > programming. I see that the Glasgow Haskell compiler has a parallel mode > which can be used with PVM and there is interesting work with pH at MIT. Does > anyone know of any other work on implicitly parallelizing functional programs > for fine grain parallel execution? > > The emergence of multi-core processors makes me think that we should look at > implicit parallel functional programming in a new light. Check out the Nepal project at UNSW, http://www.cse.unsw.edu.au/~chak/nepal/ There's a related discussion on declarative concurrency happening on http://lambda-the-ultimate.org/node/view/458 Nested data parallelism is the best option I've seen yet that might fulfill the dream of transparent use of many CPUs. Heavy interprocessor locking in distributed garbage collection will still be a problem, whether you use NDP or not. I suspect that the work on region allocation (see Moscow ML) can be applied to dramatically cut down interprocessor locking with distributed GC. (begin vaguely related musings on implementation) That would be a neat project, I think it would it end up being something like Template Haskell's staged static analyses but aimed at finding per-CPU region allocation inside a single program. You would effectively generate new subprograms that can do their own GC on their own CPU and only have to return a Maybe result. Bjorn Lisper predicted this in another post to this thread. -- Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said: You could switch out the unicycles for badgers, and the game would be the same. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
Parameterized Show? was Re: [Haskell] Conceptual overloading of show?
Graham Klyne <[EMAIL PROTECTED]> writes: > I raise a topic that has occurred to me repeatedly during my time with > Haskell. I am prompted to do so by a discussion in another place, where a > significant (and, apparently, recurring) concern about the use and abuse of > Java's toString() function is being raised. > > It seems to me that there are (at least) two important uses for a function > like 'show', which may sometimes have very different requirements: > > (1) creation of some human-readable representation of a value, which may or > may not contain sufficient information to reconstruct the value, and > > (2) creation of a textual serialization of a value from which the value can > subsequently be recreated. > > Where this leads is that I think there should be *two* common value-to-string > type classes, one of which is reversible (in the sense that the output of > show is intended to be consumable by read), and another that is not required > to be reversible and provides output for human consumption. E.g., let's call > the new class 'Format': This is similar Python's str() (string) vs repr() (representation) functions. Python's repr is designed to work like "read . show = id" such that eval(repr(x)) == x and repr also makes a string (only ASCII as far as I know). But maybe this doesn't have to be limited to strings? I've wanted "deriving WebPublish" and at some level that also involves a "show as html/xml" My WebPublish ideas would be easier with "readXML.showXML == id" Dominic Steinitz' ASN.1 code might be easier with readASN1/showASN1 I get the feeling there's a higher-level pattern here, but I don't how to capture it with Haskell's Read/Show classes. Some discussion on #haskell turned up: Björn Bringert mentioned the THDeriveXmlRpcType module in his XmlRpc library. So maybe Show can be parameterized on various 'transports' ? Philippa Cowderoy suggested "Show signal carrier" instead of the present "Show signal [implicit String]" Maybe deriving (Show Transport) like deriving (Show XmlRpc)? Any thoughts along these lines? -- Shae Matijs Erisson - Programmer - http://www.ScannedInAvian.org/ "I will, as we say in rock 'n' roll, run until the wheels come off, because I love what I do." -- David Crosby ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
[Haskell] Succ Zeroth IOHCC Results http://www.scannedinavian.org/iohcc/succzeroth-2004/
After a long delay, the Succ Zeroth IOHCC Results are online! http://www.scannedinavian.org/iohcc/succzeroth-2004/ The minimalistic results page links to three winning submissions of much entertainment. Winners by Category: Best overall entry UlfNorell with MetaSteganoGraphicObfuscation Best Abuse of Compiler Specific Features and Best Signature Sized Entry DonSteward with Crawl Most Useful submission JeremyGibbons with PiSpigot Thanks to everyone who entered! Please enter again next year! -- Shae Matijs Erisson - Programmer - http://www.ScannedInAvian.org/ "I will, as we say in rock 'n' roll, run until the wheels come off, because I love what I do." -- David Crosby ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
[Haskell] ANNOUNCE: The Succ Zero International Obfuscated Haskell Code Contest!
In the spirit of http://ioccc.org/ bring us your poor, weary, downtrodden, and unreadable source code. Come to the Succ Zeroth INTERNATIONAL OBFUSCATED HASKELL CODE CONTEST! This contest is meant to be fun, short, and not terribly serious. * submission deadline: August 31st, 2004 * judging deadline: September 15th, 2004 (expect results at that point) * send your code (complaints/comments) to: [EMAIL PROTECTED] submission must have source and some sort of description file so that the jurors won't be totally mystified. rules: * LICENSE: your code must be an original work, all submitted programs are thereby put in the public domain. All explicitly copyrighted programs will be rejected. (see the IOCCC rules) * max source size: 5k * entry must include shell script or makefile to perform the build * build must not require human intervention * doing something interesting and/or useful is a plus * we particularly like games * limited abuse of the rules is acceptible if the specific abuses are documented, and the judges think it's cool * judges aren't allowed to enter (not this time) portability: * latest public release versions of hugs, ghc, nhc, hbc, helium acceptable (any we missed?) * may use common Haskell tools such as hmake, happy etc. * program need not be portable across Haskell implementations * must be relatively portable across platforms (i.e. no Linux-specificisms) * use of ANSI/VTxxx codes which are not limited to a specific brand of terminal and work in a standard xterm are portable * FFI is discouraged, we want real Haskell source. five person jury: * BjornBringert (bringert) * AndrewBromage (Pseudonym) * ShaeErisson (shapr) * JeremyShaw (stepcut) * MartinSjögren (Marvin--) Awards will depend on the specific entries, but may include: * best one-liner - less than 80 chars not counting imports? * best .signature sized - 4x80 or 4x76 or whatever * best game * best H98-only program * best exploit of a compiler bug * most useful program * most creative layout * best abuse of implementation-specific extensions * best abuse of the type system * best abuse of category theory * worst abuse of the rules spirit, point, reason: * to seek out new lifeforms and new civilizations * to boldly go where no Haskell programmer has ever wanted to be! Semi-seriously, though, obfuscated code shows neat and unusual ways of structuring a program, cool tricks, dark nooks and crannies you've never thought of, and is generally a good way to shake off all that software discipline and stomp around in the muddy world of spaghetti code for a quick vacation. -- Shae Matijs Erisson - Programmer - http://www.ScannedInAvian.org/ "I will, as we say in rock 'n' roll, run until the wheels come off, because I love what I do." -- David Crosby ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
[Haskell] EuroHaskell - come to sweden, write code
You are cordially invited to come to EuroHaskell for fun and code.
EuroHaskell is a sprint[1] and gathering happening at Chalmers University of
Technology in Gothenburg, Sweden on June 10th, 11th, and 12th.
The goal is to meet, learn, and code.
The [dis]organizers are BjÃrn Bringert and Shae Erisson.
There is no entrance fee.
Food and drink are not supplied, but feel free to bring your own.
More information is available on the EuroHaskell wiki page:
http://www.haskell.org/hawiki/EuroHaskell
[1]A sprint is a focussed development session based on the principles of
Extreme Programming, in which developers pair off together in a room and focus
on a particular subsytem or task.
for more info see : http://www.zopemag.com/Guides/miniGuide_ZopeSprinting.html
--
Shae Erisson - putStr $ fix("HELLO\n"++) - http://www.ScannedInAvian.org/
OSDir: Community building... interesting... what's the secret sauce?
Limi: Irresponsible sleep patterns.
-- Alexander Limi, one of the Plone founders http://osdir.com/Article199.phtml
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Re: looking for Database Interface in Haskell
Johannes Waldmann <[EMAIL PROTECTED]> writes: > Dear all, we want to access a (MySQL) data base, > running on a linux server, from a Haskell program. > We planned to use http://www.volker-wysk.de/mysql-hs/ > but it depends on earlier versions of hdirect (0.17?) and ghc(-4?). > I built hdirect-0.19 (?) (from the ghc CVS) but the Foreign interfaces > seem to have changed a bit since mysql-hs-0.10.1 was written. > Any hints on what direction to take? Thanks, Also, HToolkit has working but not yet stable support for both postgresql and mysql. I haven't tried the mysql interface myself, but I have tried the postgresql code. It works, but it does explode if you do something unexpected. http://sourceforge.net/projects/htoolkit/ -- Shae Matijs Erisson - 2 days older than RFC0226 #haskell on irc.freenode.net - We Put the Funk in Funktion ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
Re: Q. about XML support
Joe English <[EMAIL PROTECTED]> writes: > As far as HXML goes, I have a rough sketch of an > implementation of XML namespace support, not yet > finished or released. (This is a somewhat thorny > problem; implementing XMLNS is not hard, but implementing > it in a sane way requires some ingenuity.) Do you have a version of HXML + (any) namespace support online or otherwise available for playing with? I'd like to try it. thanks, -- Shae Matijs Erisson - 2 days older than RFC0226 #haskell on irc.freenode.net - We Put the Funk in Funktion ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
Re: ANNOUNCE: 0th International Obfuscated Haskell Code Contest - http://iohc.mgoetze.net/
The following message is a courtesy copy of an article that has been posted to comp.lang.functional as well. I didn't include the url for rule updates and winner announcements. Here it is: http://iohc.mgoetze.net/ -- Shae Matijs Erisson - 2 days older than RFC0226 #haskell on irc.freenode.net - We Put the Funk in Funktion ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
ANNOUNCE: 0th International Obfuscated Haskell Code Contest
The following message is a courtesy copy of an article that has been posted to comp.lang.functional as well. In the spirit of http://ioccc.org/ Bring us your poor, weary, downtrodden, and unreadable source code. Come to the 0th INTERNATIONAL OBFUSCATED HASKELL CODE CONTEST! This contest is meant to be fun, short, and not terribly serious. Also, then we'll know if a 1st IOHCC is a good idea. * submission deadline: March 1st, 2003 * send your code (and/or complaints/comments) to: mailto:[EMAIL PROTECTED] Submission must have source and some sort of description file so that the jurors won't be totally mystified. Rules: * LICENSE: your code must an original work, all submitted programs are thereby put in the public domain. All explicitly copyrighted programs will be rejected. (see the IOCCC rules) * max source size: 5k * entry must include shell script or makefile to perform the build * build must not require human intervention * doing something interesting and/or useful is a plus * we particularly like games * limited abuse of the rules is acceptable if the specific abuses are documented, and the judges think it's cool Portability: * latest public release versions of hugs, ghc, nhc, hbc, helium acceptable (any we missed?) * may use common Haskell tools such as hmake, happy etc. * program need not be portable across Haskell implementations * must be relatively portable across platforms (i.e. no Linux-specificisms) * use of ANSI/VTxxx codes which are not limited to a specific brand of terminal and work in a standard xterm are portable * FFI is discouraged, we want real Haskell source. Five person jury: * Richard Braakman (dark) * Shae Erisson (shapr) * Ian Lynagh (Igloo) * Andrew Bromage (Pseudonym) * Manuel Chakravarty (Chilli) We expect judging to take two to three weeks, but this is the 0th IOHCC, could be shorter or longer. Awards will depend on the specific entries, but may include: * best one-liner - less than 80 chars not counting imports * best .signature sized - 4x80 or 4x76 or whatever * best game * best H98-only program * best exploit of a compiler bug * most useful program * most creative layout * best abuse of implementation-specific extensions * best abuse of the type system * best abuse of category theory * worst abuse of the rules Spirit, point, reason: * to seek out new lifeforms and new civilizations * to boldly go where no Haskell programmer has ever wanted to be! Semi-seriously, obfuscated code shows neat and unusual ways of structuring a program, cool tricks, dark nooks and crannies you've never thought of, and is generally a good way to shake off all that software discipline and stomp around in the muddy world of spaghetti code for a quick vacation. -- Shae Matijs Erisson - 2 days older than RFC0226 #haskell on irc.freenode.net - We Put the Funk in Funktion ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
Haskell Wiki is down, could someone fix it?
As the subject says, the Haskell Wiki is showing blank pages again, could someone fix it? Thanks, -- Shae Matijs Erisson - http://www.webwitches.com/~shae/ ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
