Re: [Haskell-cafe] Changing my Profile

2010/8/23 Christopher Done : > Any suggestions would be appreciated. Isn't there the possibility to mute a thread in gmail ? You need to activate keyboard shortcuts, then "?" gives you a list of keys. m seems to be used to mute a thread, but I didn't try it so I don't know what it does exactly.

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

Here's a way I've been tinkering with to think about iteratees clearly. For simplicity, I'll stick with pure, error-free iteratees for now, and take chunks to be strings. Define a function that runs the iteratee: > runIter :: Iteratee a -> [String] -> (a, [String]) Note that chunking is explici

Re: [Haskell-cafe] Hackage on Linux

On 24 August 2010 16:15, David Virebayre wrote: > 2010/8/24 Ivan Lazar Miljenovic : > >> What do you mean by "metapackages"? > > Metapackage are packages of packages, they don't provide something by > themselves, but they have a dependency list so that a set of package > can be installed together.

Re: [Haskell-cafe] Hackage on Linux

2010/8/24 Ivan Lazar Miljenovic : > What do you mean by "metapackages"? Metapackage are packages of packages, they don't provide something by themselves, but they have a dependency list so that a set of package can be installed together. For example, on ubuntu, installing "build-essentials" will

Re: [Haskell-cafe] Higher-order algorithms

On 23 August 2010 14:03, Eugene Kirpichov wrote: > Do there exist other nontrivial higher-order algorithms and datastructures? > Is the field of higher-order algorithms indeed as unexplored as it seems? Aren't higher order algorithms "functional pearls"? :-) You might find Olivier Danvy and Mic

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

On 24 August 2010 14:47, Jason Dagit wrote: > > > On Mon, Aug 23, 2010 at 10:37 PM, Conrad Parker > wrote: >> >> On 24 August 2010 14:14, Jason Dagit wrote: >> > I'm not a semanticist, so I apologize right now if I say something >> > stupid or >> > incorrect. >> > >> > On Mon, Aug 23, 2010 at 9:

Re: [Haskell-cafe] Hackage on Linux

On 24 August 2010 15:50, Mathew de Detrich wrote: > I used to use archlinux packages however it became a pain for the following > reasons > > - packages on archlinux don't auto update when cabal does. This becomes > really annoying when package X gets updated on cabal but not on arch and > causes

Re: [Haskell-cafe] Hackage on Linux

I used to use archlinux packages however it became a pain for the following reasons - packages on archlinux don't auto update when cabal does. This becomes really annoying when package X gets updated on cabal but not on arch and causes conflicts with other packages - in some situations doing a ge

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

On Mon, Aug 23, 2010 at 10:37 PM, Conrad Parker wrote: > On 24 August 2010 14:14, Jason Dagit wrote: > > I'm not a semanticist, so I apologize right now if I say something stupid > or > > incorrect. > > > > On Mon, Aug 23, 2010 at 9:57 PM, Conal Elliott wrote: > >>> > >>> So perhaps this could b

Re: [Haskell] Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

On 24/08/10 03:47, John Millikin wrote: [...] > I would like to avoid hard-coding the error type to SomeException, because > it forces libraries to use unsafe/unportable language features (dynamic > typing and casting). However, given the apparent practical requirement that > all iteratees have the

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

On 24 August 2010 14:14, Jason Dagit wrote: > I'm not a semanticist, so I apologize right now if I say something stupid or > incorrect. > > On Mon, Aug 23, 2010 at 9:57 PM, Conal Elliott wrote: >>> >>> So perhaps this could be a reasonable semantics? >>> >>> Iteratee a = [Char] -> Maybe (a, [Char

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

I'm not a semanticist, so I apologize right now if I say something stupid or incorrect. On Mon, Aug 23, 2010 at 9:57 PM, Conal Elliott wrote: > So perhaps this could be a reasonable semantics? >> >> Iteratee a = [Char] -> Maybe (a, [Char]) >> > > I've been tinkering with this model as well. > >

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

> > So perhaps this could be a reasonable semantics? > > Iteratee a = [Char] -> Maybe (a, [Char]) > I've been tinkering with this model as well. However, it doesn't really correspond to the iteratee interfaces I've seen, since those interfaces allow an iteratee to notice size and number of chunks

Re: [Haskell-cafe] Higher-order algorithms

Eugene Kirpichov wrote: Do there exist other nontrivial higher-order algorithms and datastructures? Is the field of higher-order algorithms indeed as unexplored as it seems? Many algorithms in natural language processing can be captured by higher-order algorithms parameterized by the choice of

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

> > I have omitted the chunking [Char] because I don't like it; invariance with > respect to the chunk sizes is something that should be left to the iteratee > abstraction. > I have this same reservation about iteratees. And related one for enumerators and enumeratees. Assuming my sense of their

Re: [haskell-cafe] How to substitute FD like a -> b c by type families?

Vladimir Matveev wrote: I'm trying to implement the "Advanced Example : Type-Level Quicksort" from HaskellWiki using type families instead of functional dependencies. My code is at [1]. I substituted all 'many to one' functional dependencies like xs ys -> zs by explicit type families, but I don't

Re: [Haskell-cafe] Fwd: Semantics of iteratees, enumerators, enumeratees?

Conal Elliott wrote: For anyone interested in iteratees (etc) and not yet on the iteratees mailing list. I'm asking about what iteratees *mean* (denote), independent of the various implementations. My original note (also at the end below): With the encouragement & help of Conrad Parker, I've

Re: [Haskell] Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

It's not released yet, but persistent 0.2 is going to be using enumerator. I personally don't mind SomeException as a hard-coded error type, but go ahead and do whatever you think is best for the API. Michael On Tue, Aug 24, 2010 at 5:47 AM, John Millikin wrote: > After fielding some more quest

Re: [Haskell] Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

After fielding some more questions regarding error handling, it turns out that my earlier mail was in error (hah) -- error handling is much more complicated than I thought. When I gave each iteratee its own error type, I was expecting that each pipeline would have only one or two sources of errors

Re: [Haskell-cafe] feasability of implementing an awk interpreter.

On Aug 23, 2010, at 7:00 PM, Roel van Dijk wrote: > On Mon, Aug 23, 2010 at 8:07 AM, Richard O'Keefe wrote: >> But what _is_ "the core functionality". >> The Single Unix Specification can be browsed on-line. >> There is no part of it labelled "core"; it's all required >> or it isn't AWK. [If

[Haskell-cafe] Re: Filename encoding error (was: Perform a research a la Unix 'find')

I've been banging my head on the same issues. To summarise: GHC 6.12 strings are unicode; unix file paths are slightly restricted byte strings; the former is used to represent the latter, leading to great confusion; the best way to fix it is unclear. Here's a workaround I wrote this morning: --

Re: [Haskell-cafe] Changing my Profile

On the bottom of this page, enter your e-mail address: http://www.haskell.org/mailman/listinfo/haskell-cafe This is also provided in the footer of these list e-mails. On Mon, Aug 23, 2010 at 1:35 PM, David Webster wrote: > Is there any way t

Re: [Haskell-cafe] Function signatures and type class constraints

On Monday 23 August 2010 22:30:03, Oscar Finnsson wrote: > Hi, > > I'm wondering why I have to repeat the class constraints at every > function. > > If I got the data type > > > data (Eq a, Show a, Data a, Eq b, Show b, Data b, Eq c, Show c, Data > > c) => Foo a b c = Foo a b c > Type class constr

Re: [Haskell-cafe] ANNOUNCE: ipatch, the interactive patch editor

This would benifit darcs, as the help-text would be correct even if I've renamed the executable. For example darcs-beta vs. darcs. On Aug 23, 2010 3:49 PM, "Joachim Breitner" wrote: > Hi, > > Am Montag, den 23.08.2010, 13:43 -0700 schrieb Jason Dagit: >> On Mon, Aug 23, 2010 at 1:32 PM, Joachim B

Re: [Haskell-cafe] ANNOUNCE: ipatch, the interactive patch editor

Hi, Am Montag, den 23.08.2010, 13:43 -0700 schrieb Jason Dagit: > On Mon, Aug 23, 2010 at 1:32 PM, Joachim Breitner > wrote: > > $ ipatch split --help > Usage: darcs split [OPTION]... > > > Darcs? > > > > $ ./dist/build/ipatch/ipatch apply --help >

Re: [Haskell-cafe] ANNOUNCE: ipatch, the interactive patch editor

On Mon, Aug 23, 2010 at 1:32 PM, Joachim Breitner wrote: > $ ipatch split --help > Usage: darcs split [OPTION]... > Darcs? > $ ./dist/build/ipatch/ipatch apply --help > Usage: darcs apply [OPTION]... > Darcs? I assume those are typos left over from borrowing code? Jason __

Re: [Haskell-cafe] ANNOUNCE: ipatch, the interactive patch editor

Hi, Am Montag, den 23.08.2010, 15:10 -0500 schrieb Antoine Latter: > On Tue, Aug 3, 2010 at 3:52 PM, Joachim Breitner > wrote: > > Dear Haskell and Darcs community, > > > > I have written a tool to interactively edit patches, which under the > > hood uses the Darcs API. A more catchy introduction

[Haskell-cafe] Function signatures and type class constraints

Hi, I'm wondering why I have to repeat the class constraints at every function. If I got the data type > data (Eq a, Show a, Data a, Eq b, Show b, Data b, Eq c, Show c, Data c) => > Foo a b c = Foo a b c and then a function from Foo to String I have to supply the signature > bar :: (Eq a, Sho

Re: [Haskell-cafe] ANNOUNCE: ipatch, the interactive patch editor

On Tue, Aug 3, 2010 at 3:52 PM, Joachim Breitner wrote: > Dear Haskell and Darcs community, > > I have written a tool to interactively edit patches, which under the > hood uses the Darcs API. A more catchy introduction, including a > screencast, can be found on > https://www.joachim-breitner.de/bl

[Haskell-cafe] ANNOUNCE: darcs 2.5 beta 4

The darcs team would like to announce the immediate availability of darcs 2.5 beta 4 (also known as darcs 2.4.98.4 due to Cabal restrictions). Important changes since darcs 2.4.4 are: * trackdown can now do binary search with the --bisect option * darcs always stores patch metadata encoded

Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

On Mon, Aug 23, 2010 at 4:24 PM, Paulo Tanimoto wrote: > On Mon, Aug 23, 2010 at 6:16 AM, John Lato wrote: > > It's not necessary to understand CPS to use CPS-based iteratees. The CPS > > implementation generally simplifies the types and removes the necessity > for > > special combinators like

Re: [Haskell-cafe] Changing my Profile

I don't know about doing it at the server side. I've been trying to setup the right filters and quick links in my GMail to filter out emails I'm not interested. I'd like to recieve *all* emails, but be able to filter out the ones I'm not interested in so I never see them again. I tried an Uninter

[Haskell-cafe] Changing my Profile

Is there any way to change my profile or signup options so that I don't get CC'ed on every posting to Haskell-Cafe? David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Crypto-API is stabilizing

All, Crypto-API - a unified interface to which I hope hash and cipher algorithms will adhere - has recently gotten a reasonable amount of polish work. I continue to welcome all comments! A blog on its current interface is online [1] as are darcs repositories of the crypto-api package [2]. Recen

[Haskell-cafe] Higher-order algorithms

(Accidentally sent off-list, resending) On Mon, Aug 23, 2010 at 15:03, Eugene Kirpichov wrote: > * Difference lists > I mean that not only higher-order facilities are used, but the essence > of the algorithm is some non-trivial higher-order manipulation. If I'm not mistaken, we can "defunctiona

Re: [Haskell-cafe] Fast Integer Input

2010/8/23 Bertram Felgenhauer : > Serguey Zefirov wrote: > The timings seem about right. Thank you for letting me know about divide-and-conquer variant. But I am still amuzed that producing 1200 words of data from 13Kbytes of text took those little 200 cycles of CPU. This is quite interesting an

[Haskell-cafe] Second Call for Copy: Monad.Reader Issue 17

Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 17 is **Friday, October 1, 2010** That's little more than a month away! Get

[Haskell-cafe] Re: empty .prof file

2010/8/23 Vo Minh Thu : > Hi, > > I'd like to profile a GLUT application. After a run of the application > with the +RTS -p flag, the .prof file is actually created but is > always empty. > > Does someone have a clue of what's going on? Would it be related to my > application calling GLUT's leaveMa

Re: [Haskell-cafe] Fast Integer Input

Serguey Zefirov wrote: > 2010/8/23 <200901...@daiict.ac.in>: > > This function takes 1.8 seconds to > > convert 2000 integers of length 10^13000. I need it to be smaller that > > 0.5 sec. Is it possible? > > 2000 integers of magnitude 10^13000 equals to about 26 MBytes of data > (2000 numbers eac

[Haskell-cafe] empty .prof file

Hi, I'd like to profile a GLUT application. After a run of the application with the +RTS -p flag, the .prof file is actually created but is always empty. Does someone have a clue of what's going on? Would it be related to my application calling GLUT's leaveMainLoop to exit? Thanks, Thu _

Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

On Mon, Aug 23, 2010 at 6:16 AM, John Lato wrote: > It's not necessary to understand CPS to use CPS-based iteratees.  The CPS > implementation generally simplifies the types and removes the necessity for > special combinators like ($$) and (>>==), so I strongly suspect newcomers > will find it eas

Re: [Haskell-cafe] Fast Integer Input

>>Does the length of those numbers happen to be fixed? It they are all >>exactly 13000 decimals then it should be possible to create a more >>optimised parser. Well actually they can have any number of digits less than 13000. But the only post processing of the numbers is calculating the binary lo

Re: [Haskell-cafe] Fast Integer Input

2010/8/23 <200901...@daiict.ac.in>: > This function takes 1.8 seconds to > convert 2000 integers of length 10^13000. I need it to be smaller that > 0.5 sec. Is it possible? 2000 integers of magnitude 10^13000 equals to about 26 MBytes of data (2000 numbers each 13000 digits long). Rounding 1.8 se

[Haskell-cafe] Fast Integer Input

I need a function which has fast conversion from Bytestring to Integer. I am currently using this: import qualified Data.ByteString.Lazy.Char8 as BS readInteger :: BS.ByteString -> Integer readInteger x = case BS.readInteger x of Just (i,_) -> i Are there faster implementations? This function

Re: [Haskell-cafe] Higher-order algorithms

2010/8/23 Eugene Kirpichov : > For example, parser combinators are not so interesting: they are a > bunch of relatively orthogonal (by their purpose) combinators, each of > which is by itself quite trivial, plus not-quite-higher-order > backtracking at the core. This is only if you're not quite co

Re: [Haskell-cafe] Higher-order algorithms

2010/8/23 Eugene Kirpichov : > [snip] > Do there exist other nontrivial higher-order algorithms and datastructures? > Is the field of higher-order algorithms indeed as unexplored as it seems? > [snip] Hi, I'm thinking to some HOAS (higher order abstract syntax) representation. Cheers, Thu _

[Haskell-cafe] Higher-order algorithms

Most of the well-known algorithms are first-order, in the sense that their input and output are "plain" data. Some are second-order in a trivial way, for example sorting, hashtables or the map and fold functions: they are parameterized by a function, but they don't really do anything interesting wi

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

On Mon, 23 Aug 2010 14:38:29 +0200, Heinrich Apfelmus wrote: > Luke Palmer wrote: > > Heinrich Apfelmus wrote: > >> Conal Elliott wrote: > >>> For anyone interested in iteratees (etc) and not yet on the iteratees > >>> mailing list. > >>> > >>> I'm asking about what iteratees *mean* (denote), ind

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On Mon, Aug 23, 2010 at 9:00 AM, Simon Marlow wrote: > I think it's the latter.  bufRead loops until it has read the full amount of > data requested, or EOF is reached. Hmmm... sorry about the noise then =). Cheers, -- Felipe. ___ Haskell-Cafe mailin

[Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

Luke Palmer wrote: Heinrich Apfelmus wrote: Conal Elliott wrote: For anyone interested in iteratees (etc) and not yet on the iteratees mailing list. I'm asking about what iteratees *mean* (denote), independent of the various implementations. In my world view, iteratees are just a monad M wit

Re: [Haskell-cafe] Re: Unix emulation

On Mon, Aug 23, 2010 at 12:36:18AM -0700, Kevin Jardine wrote: > In the past, installing it has only taken a few minutes. That still > looks to be the case for MinGW but it now appears that msys has been > split into a confusing and long list of packages. I think that it > needs a standard installe

Re: [Haskell-cafe] Compiling UHC

Hi Henk-Jan, On Mon, Aug 23, 2010 at 00:15, Henk-Jan van Tuyl wrote: > > L.S., > > I am trying to compile the current release of UHC (1.0.1); I started with > the installation of the most recent version of uulib and uuagc. When > running > make uhc > I received the following message: > EH\Uti

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On 23/08/2010 12:57, Felipe Lessa wrote: On Mon, Aug 23, 2010 at 8:51 AM, Simon Marlow wrote: Hmm, RawIO.read looks ok: -- | Read up to the specified number of bytes, returning the number -- of bytes actually read. This function should only block if there -- is no data available. If there is

[haskell-cafe] How to substitute FD like a -> b c by type families?

I'm trying to implement the "Advanced Example : Type-Level Quicksort" from HaskellWiki using type families instead of functional dependencies. My code is at [1]. I substituted all 'many to one' functional dependencies like xs ys -> zs by explicit type families, but I don't know how to replace 'many

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On Mon, Aug 23, 2010 at 8:51 AM, Simon Marlow wrote: > Hmm, RawIO.read looks ok: > > -- | Read up to the specified number of bytes, returning the number > -- of bytes actually read.  This function should only block if there > -- is no data available.  If there is not enough data available, > -- th

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On 23/08/2010 12:38, Felipe Lessa wrote: On Mon, Aug 23, 2010 at 8:29 AM, Simon Marlow wrote: Which documentation are you referring to? This looks ok to me: http://www.haskell.org/ghc/docs/6.12.2/html/libraries/base-4.2.0.1/System-IO.html#v%3AhGetBuf Indeed, while there isn't a big fat warn

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On Mon, Aug 23, 2010 at 8:29 AM, Simon Marlow wrote: > Which documentation are you referring to?  This looks ok to me: > > http://www.haskell.org/ghc/docs/6.12.2/html/libraries/base-4.2.0.1/System-IO.html#v%3AhGetBuf Indeed, while there isn't a big fat warning, it does say that it reads 'count' b

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On 23/08/2010 12:10, Felipe Lessa wrote: Hello, Simon! On Mon, Aug 23, 2010 at 8:00 AM, Simon Marlow wrote: The issue is that hGet always waits for a complete buffer-full of data before returning. The hWaitForInput/hGetNonBlocking combination fixes that problem, but you have to be careful to

Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

> > From: John Millikin > > On Sat, Aug 21, 2010 at 15:35, Paulo Tanimoto wrote: > > Apologies if I'm asking you to repeat yourself, but I couldn't find > > the explanation. Â What was the reason why you went with IterateeM > > instead of IterateeMCPS? Â Simplicity? > > Iteratees are difficult

Re: [Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

On Mon, Aug 23, 2010 at 1:06 AM, Heinrich Apfelmus wrote: > Conal Elliott wrote: >> >> For anyone interested in iteratees (etc) and not yet on the iteratees >> mailing list. >> >> I'm asking about what iteratees *mean* (denote), independent of the >> various >> implementations.  My original note (

Re: [Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

Hello, Simon! On Mon, Aug 23, 2010 at 8:00 AM, Simon Marlow wrote: > The issue is that hGet always waits for a complete buffer-full of data > before returning.  The hWaitForInput/hGetNonBlocking combination fixes that > problem, but you have to be careful to make sure that the Handle is in > bina

Re: [Haskell-cafe] Simple Sudoku solver using Control.Monad.Logic

Many thanks. This is very useful :) 2010/8/23 Sebastian Fischer : > > On Aug 22, 2010, at 11:09 PM, Vladimir Matveev wrote: > >> are there any materials >> except LogicT.pdf from link on the logict hackage entry? I'd like to >> read something on this interesting topic > > The functional pearl > >

[Haskell-cafe] Re: [Haskell] Re: ANNOUNCE: enumerator, an alternative iteratee package

On 21/08/2010 04:30, John Millikin wrote: This also changes the binary enumHandle to use non-blocking IO, as recommended by Magnus Therning. I'm embarrassed to admit I still don't understand the improvement, exactly, but three people so far have told me it's a good idea. The issue is that hGet

Re: [Haskell-cafe] Simple Sudoku solver using Control.Monad.Logic

On Aug 22, 2010, at 11:09 PM, Vladimir Matveev wrote: are there any materials except LogicT.pdf from link on the logict hackage entry? I'd like to read something on this interesting topic The functional pearl A program to solve Sudoku by Richard Bird http://www.cs.tufts.edu/~nr/comp

Re: [Haskell-cafe] Trouble with winGHCi

Hi David Maybe WinGHCi (the gui) it is failing to start GHCi (the interpreter)? Though then going to a black screen of death is very bad. On my system I can run WinGHCi from HP2010.2.0.0 - but it runs an old version of GHCi. This makes me suspect it is using the /path/ environment variable to fin

[Haskell-cafe] ICFP '10: Final call for participation

= Final Call for Participation The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP 2010) http://www.icfpconference.org/icfp2010/

[Haskell-cafe] Re: Unix emulation

I'd agree with Stephen. I've used MinGW / msys for years and would never consider doing any open source development (especially involving C) without it. In the past, installing it has only taken a few minutes. That still looks to be the case for MinGW but it now appears that msys has been split i

Re: [Haskell] Re: [Haskell-cafe] ANNOUNCE: enumerator, an alternative iteratee package

On Sat, 21 Aug 2010 13:36:08 -0700, John Millikin wrote: > On Sat, Aug 21, 2010 at 12:44, Magnus Therning wrote: > > As an aside, has anyone written the code necessary to convert a parser, such > > as e.g.  attoparsec, into an enumerator-iteratee[1]? > > This sort of conversion is trivial. For a

[Haskell-cafe] Re: Fwd: Semantics of iteratees, enumerators, enumeratees?

Conal Elliott wrote: For anyone interested in iteratees (etc) and not yet on the iteratees mailing list. I'm asking about what iteratees *mean* (denote), independent of the various implementations. My original note (also at the end below): In my world view, iteratees are just a monad M with a

Re: [Haskell-cafe] feasability of implementing an awk interpreter.

On Mon, Aug 23, 2010 at 8:07 AM, Richard O'Keefe wrote: > But what _is_ "the core functionality". > The Single Unix Specification can be browsed on-line. > There is no part of it labelled "core"; it's all required > or it isn't AWK.  There are weird little gotchas like >        File "foo" = '{ pri