[Haskell] Haskell Job Opportunity

HAppS LLC has part-time and full-time positions open for haskell programmers to: * improve the open source haskell codebase at HAppS.org * implement infrastructure to make it work well in Amazon S3/EC2 environments * make http://pass.net reliable enough to be used by live apps * build the ma

Re: [Haskell] -compiler-options vs {#-LANGUAGE Flags-#}

. Alexander Jacobson on 2007-03-23 17:16:26 -0400: The correct answer, I believe, is to require that module authors put flags in the module themselves where they belong. Does the OPTIONS_GHC pragma solve your issue? http://www.haskell.org/ghc/docs/latest/html/users_guide/using-ghc.html#source-file

[Haskell] -compiler-options vs {#-LANGUAGE Flags-#}

In theory, Haskell modules should contain all information necessary to interpret/compile them properly. In practice, many modules don't because their authors are flagging required language extensions in build systems rather than in module sources. This practice causes problems because then it

[Haskell] Re: STM applications and examples?

ks! Simon ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users ______ S. Alexander Jacobson tel:917-770

Re: [Haskell] ANNOUNCE: Google Summer of Code Projects

wish the students good luck and good hacking! The Haskell.org Team. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell ______ S. Alexander Jacobson tel:91

[Haskell] monads, records, verbosity

specialized instance Is this possible/reasonable? -Alex- __________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Re: ECT and SearchPath

nt for missing modules rather than forcing you to quit out and restart ghci every time you add an import of an undownloaded module in your code. Using searcpath make thing very smooth, but this feature would make it completely so. -Alex- _______

[Haskell] implicit responses/values

would work, but it strikes me as useful. Anything like that in the offing? -Alex- __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell@haskell.org

RE: [Haskell] Realistic max size of GHC heap

now distribute IO threads over multiple CPUs or is it still a 1 CPU system? -Alex- __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com On Thu, 15 Sep 2005, Simon Marlow wrote: On 15 September 2005 01:04, Karl Grapone

[Haskell] ANN: SearchPath 0.5 and Request for https module URLs

this way, please email me a baseURL. Location: http://happs.org/SearchPath.hs -Alex- __________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell@haskell.o

Re: [Haskell] Re: Proposal: Relative Module Imports

ed, but more readable and still a large improvement on the status quo. Thoughts? -Alex- __________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com On Tue, 3 May 2005, Samuel Bronson wrote: On 5/3/05, S. Alexander Jacobson alexjac

[Haskell] Proposal: Relative Module Imports

import Text.HaXML.XML.Escape as Escape import .Prettyimport Text.HaXML.XML.Pretty as Pretty I believe that the proposed syntax is much more concise and readable than the current equivalent. -Alex- __ S. Alexander

Re: [Haskell] How to make Haskell more popular

stinfo/haskell ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Stop untracked dependencies! (was RE: mapping module identifiers to URLs (was RE: [Haskell] URLs in haskellmodule namespace))

between them (e.g. file associations). However, what users of libraries want is just a safe and easy way to populate a local cache of module-implementations from various sources and that is what I am asking for here. -Alex- ___

mapping module identifiers to URLs (was RE: [Haskell] URLs in haskell module namespace)

odule locations. Note: Yes, I know about Cabal's Build-Depends, but it doesn't serve the need described here. -Alex- [1] http://www.haskell.org/pipermail/libraries/2003-September/001457.html __________ S. Alexander Jacob

Re: [Haskell] URLs in haskell module namespace

to agree with you! -Alex- __________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] URLs in haskell module namespace

corresponding to an old version into a data structure defined in the new version... -Alex- __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell

Re: [Haskell] URLs in haskell module namespace

spect to packages that would be entirely fine. But right now module names are global and that is a serious problem. -Alex- __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] URLs in haskell module namespace

d it be hard to adapt Cabal to work like this? -Alex- __________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com On Tue, 22 Mar 2005, Lemmih wrote: On Mon, 21 Mar 2005 23:06:25 +0100, Sven Moritz Hallberg <[EMAIL PROTECTED]> wro

Re: [Haskell] URLs in haskell module namespace

skell module namespace.) -Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com On Mon, 21 Mar 2005, Sven Moritz Hallberg wrote: Greetings Alexander, I have been thinking about something very much similar for some time

[Haskell] URLs in haskell module namespace

d ask the user if it is appropriate to upgrade to the new version. Does this make sense? -Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list Ha

[Haskell] par and forkIO

;sSearch=&nPage=1 Do the current implementations of par and forkIO in e.g. GHC take advantage multiple CPUs/cores or is special plumbing needed (GPH?)? -Alex- __________ S. Alexander Jacobson tel:917-770-

instance Show Data.Map? (was Re: [Haskell] Data.Map missing keysFM_GE, eltsFM_GE?)

nt it as (show.assocs), or to provide a Read instance. Any hope of the above, or do I need to refactor my code not to use (Read,Show) around Data.Map? -Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com On Mon, 2

[Haskell] Data.Map missing keysFM_GE, eltsFM_GE?

Data.FiniteMap has functions keysFM_GE and eltsFM_GE which return the keys or elts of pairs greater than or equal to the provided key. These functions do not appear to be in the new Data.Map. Is this intentional? -Alex- __ S. Alexander

Re: [Haskell] Proposal: Allow "\=" for field update in record update syntax

e TH infix operators on the agenda? -Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com Keean. S. Alexander Jacobson wrote: I don't know what it takes to get this sort of change into circulation, but I assume it star

[Haskell] Proposal: Allow "\=" for field update in record update syntax

ntax? It makes sense to use \= for this task as it is the functional generalization of C or Java's += or *= . Then myFun would have the elegant and clear syntax: myFun db myType1 =db {tMyType1\=insert myType1, nextId\=(+1)} -Alex- _______

Re: [Haskell] Job Posting (Looking for a few good functional programmers)

-Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com On Thu, 3 Feb 2005, Yaron Minsky wrote: Jane Street Capital (an affiliate of Henry Capital <http://henrycapital.com>) is a proprietary trading company located in Man

[Haskell] Re: [Haskell-cafe] field record update syntax

2005, Henning Thielemann wrote: On Thu, 27 Jan 2005, S. Alexander Jacobson wrote: I have a lot of code of the form foo {bar = fn $ bar foo} Is there a more concise syntax? I am thinking the record equivalent of C's foo+=5... I imagine there is some operator that does this e.g. foo {bar

Re: [Haskell] pattern matching accross instance declarations

My point is that I want to be able to add new toMyType definitions without having to modify some central library file and I want the compiler to warn me when I haven't defined one for each instance. -Alex- On Thu, 2 Dec 2004, Ben Rudiak-Gould wrote: > S. Alexander Jacobson wrote: >

[Haskell] why no strictness annotations in labelled fields?

Is there a good reason one can't do: data Foo = Foo {bar::!String} -Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED]

[Haskell] pattern matching accross instance declarations

ally writing lookup functions in addition to per-instance functions and that is both annoying and error-prone. -Alex- __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell

[Haskell] Re: understanding HaXml and escaping

not the same thing... -Alex- http://www.thaiopensource.com/relaxng/derivative.html On Thu, 28 Oct 2004, Malcolm Wallace wrote: > "S. Alexander Jacobson" <[EMAIL PROTECTED]> writes: > > > Is there a good entry point into HaXml? > > I've now spent some ti

[Haskell] Re: understanding HaXml and escaping

> mkPI :: String -> String -> CFilter > mkPI pitarget str = \t-> [ CMisc (PI (pitarget,str)) ] Will this work to insert a PI before the first element? -Alex- __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

[Haskell] understanding HaXml and escaping

y the XML spec. Likewise, the HTML > pretty-printer makes some wild and unjustified assumptions about the > way that humans like to format their documents, whereas the XML pp > is more strictly-conforming. Once XHTML becomes common, the HTML > parser/pp will be obsolete. > > Regards, > Malcolm > __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] HaXML incorrect interpretation of XML spec!

inconsistent, but I don't know what it is... Thoughts? -Alex- On Wed, 27 Oct 2004, S. Alexander Jacobson wrote: > The XML spec defines the prolog(1) as follows: > > [22]prolog ::= XMLDecl? Misc* (doctypedecl Misc*)? > > In other words you can have M

[Haskell] HaXML incorrect interpretation of XML spec!

/ __ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Haskell XML

sus on how to produce XML (from Haskell types) if one is starting a project today? -Alex- ______ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL

RE: [Haskell] modern language design, stone age tools

-Alex- _____ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com On Thu, 24 Jun 2004, Simon Peyton-Jones wrote: > Switching on profiling (-prof -auto-all) does essentially just this. The > cost centre stack is j

Re: [Haskell] modern language design, stone age tools

these exceptions explicitly. -Alex- _____ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com On Wed, 23 Jun 2004, MR K P SCHUPKE wrote: > I like to write pro

Re: [Haskell] modern language design, stone age tools

ose functions. Does this make any sense? -Alex- * I've never actually used implicit parameters. I just swiped the syntax I saw skimming: http://www.cse.ogi.edu/~mbs/pub/implicit_parameters/ _________ S. Alexander Jacobson

Re: [Haskell] Re: sizeFM type

quotation here. "Premature optimization is the root of all evil." People who need high performance can use specialized int functions where it is truly necessary. Everywhere else it is a waste of programmer time to force futzing. -Alex- __

RE: [Haskell] Why is newChan in the IO Monad?

Yes, that makes sense, but I'm ok with passing in an identity. I'd like a function like this: newChanSafe::Identity -> Chan a type Identity = Double -- or whatever -Alex- _____ S. Alexander Jacobson

[Haskell] Why is newChan in the IO Monad?

- _ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http

[Haskell] Announce: Haskell ACID Relational DBMS v0.1

Copyright (C) 2004 S. Alexander Jacobson This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Th

RE: [Haskell] overuse of maybe and [] in prelude and libs

e good style even though it exports Just and Nothing? -Alex- _________ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com On Thu, 8 Apr 2004, Simon Peyton-Jones wrote: > > | > Haskell is pretty good

Coginitive Dimensions and Haskell (was RE: [Haskell] overuse of maybe and [] in prelude and libs)

://research.microsoft.com/Users/simonpj/papers/excel/excel.pdf If so, is there a publicly available CD analysis of Haskell and its libs available? -Alex- _ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565

RE: [Haskell] overuse of maybe and [] in prelude and libs

ly core to Haskell and what is really just common utilities located their? Alternatively, does an "advanced prelude" already exist that does what I probably want but don't know yet? -Alex- _ S. Alexander Jaco

[Haskell] overuse of maybe and [] in prelude and libs

this is a FAQ, but where?) _________ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] insufficiently [EMAIL PROTECTED] -- more counterintuitive stuff

____ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com On Tue, 30 Mar 2004, Martin [ISO-8859-1] Sjögren wrote: > tis 2004-03-30 klockan 17.30 skrev S. Alexander Jacobson: > > I would assume that this function:

[Haskell] insufficiently [EMAIL PROTECTED] -- more counterintuitive stuff

imagine this issue is fairly common so perhaps its another idiom issue. -Alex- PS This code is part of a joinSets function for data.Sets _ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565

[Haskell] Re: performance tuning Data.FiniteMap

translate from an arbitrary key into [base]. -Alex- _ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

RE: [Haskell] performance tuning Data.FiniteMap

gt; to find out. And GHC is not doing as well as it should on arrays just > now. (One of the things on our to-do list.) Might vary between > implementations too. > > Simon > _________ S. Alexander Jacobson

RE: [Haskell] performance tuning Data.FiniteMap

r community *needs* people like > you, who are using Haskell for real applications. That's how we'll > learn "where the shoe pinches". Ask away. Thank you. -Alex- _________ S. Alexander Jacobson mail

Re: [Haskell] performance tuning Data.FiniteMap

e various issues. It is hard to find information on these sorts of things and the absense of field testing means you just have to ask these questions in advance. _________ S. Alexander Jacobson mailto:[EMAIL PROTECT

Use Radix for FiniteMap? (was Re: [Haskell] performance tuning Data.FiniteMap)

st? Also, basic Haskell questions: * How do I get insert to typecheck? insert' works fine. * How do I hide the "lookup" automatically imported from GHC.List? -Alex- _ S. Alexander Jacobson mailto:[EMAI

Re: [Haskell] performance tuning Data.FiniteMap

d with a fast memcpy (though not as fast as the destructive updates in Data.HashTable) Note: I don't know how to avoid the namespace conflict with GHC.List.lookup so its hLookup. -Alex- _____ S. Alexander Jacobson

[Haskell] performance tuning Data.FiniteMap

skell arrays do fast memcpy for small arrays? -Alex- _____ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Ha

Re: [Haskell] updating graphs non-destructively

em. -Alex- _____ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com On Mon, 16 Feb 2004, andrew cooke wrote: > > have you looked at the functional graph library? i can't remember the > details, but t

[Haskell] updating graphs non-destructively

- _ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo

RE: [Haskell] GHC 64bit?

ssible). -Alex- _________ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com On Fri, 13 Feb 2004, Simon Marlow wrote: > > > alex: > > > Is there a maximum memory GHC can use/reach? > &g

[Haskell] GHC 64bit?

Is there a maximum memory GHC can use/reach? Specifically, can GHC address more than 4gb of memory? -Alex- _ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http

[Haskell] behavioral difference between GHC and GHCi

lex- _____ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Making Haskell web development easier

_______ S. Alexander Jacobson mailto:[EMAIL PROTECTED] tel:917-770-6565 http://alexjacobson.com ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: How to make reading an array from disk more efficient

n.com/j2se/1.4.2/docs/api/java/io/BufferedReader.html> And if so, is there something about Haskell that makes a Haskell implementation of such a lib difficult? -Alex- _________ S. Alexander Jacobson mailto:[EMAIL

Re: haskell httpd

- ___ S. Alexander Jacobson Check out my new blog!!! 1-212-787-1914 voice http://alexjacobson.com On Tue, 11 Nov 2003, Peter Simons wrote: > S Alexander Jacobson writes: > > > 1.

Re: haskell httpd

wed by disk writes * Write-ahead logs mean not worrying about crashes during writes * If necessary, I can scale up GET performance using caching and multiple CPUs each doing log recovery. -Alex- _______ S. Alexander Jacobson

Re: haskell httpd

wed by disk writes * Write-ahead logs mean not worrying about crashes during writes * If necessary, I can scale up GET performance using caching and multiple CPUs each doing log recovery. -Alex- _______ S. Alexander Jacobson

haskell httpd

skell httpd implementation around that uses poll/select? -Alex- _______ S. Alexander Jacobson Check out my new blog!!! 1-212-787-1914 voice http://alexjacobso

MIME-RPC as an FFI (was Re: Storable Class)

ions for in-process communication as well as network communication. -Alex- PS Dave Winer's Scripting.com just picked up MIME-RPC so I think the idea is gaining some traction. _______ S. Alexander Jacobson i2x Medi

Re: GUI Library Task Force

Great. So that is something that goes into some library conventions document. Java has a convention that libraries should have reverse domain name structure. Is that how we should use _? -Alex- On Wed, 26 Sep 2001, Lennart Augustsson wrote: > "S. Alexander Jacobson" wrote: >

RE: GUI Library Task Force

age. -Alex- PS I don't know if this agenda is in the right order. I do think that everyone randomly thrashing about with different language features will make everything take much longer. ___ S. Alexander Jacobson

RE: GUI Library Task Force

e the structure > of the components explicit in the types (like the TupLS > does). From the paper, it wasn't clear to me how useful > that is for the application programmer. > > Cheers, > Manuel > > ___ > Haskell mailing list > [EMAIL PROTECTED] &

Joy and Concatenative Programming

curious what the wiser and more experienced people on this list think of Joy's approach. -Alex- ___________ S. Alexander Jacobson Shop.Com 1-646-638-2300 voiceThe Ea

Re: RFC: GUI Library Task Force

I can't find any real information about it. Is there a web page for > it? > > Carl Witty > > ___ > Haskell mailing list > [EMAIL PROTECTED] > http://www.haskell.org/mailman/listinfo/haskell > _

Re: The future of Haskell discussion

kell2. Unless I am wrong about all of the above, it seems more important to converge Haskell to a language that can support industrial strength libraries and that is Haskell2 rather than Haskell98. -Alex- _______ S. Alexander Jac

Re: The future of Haskell discussion

e GTK+ haskell interface? Shouldn't more effort be put into getting Fruit production quality and/or figuring out how to use arrows to manage textual and network IO? -Alex- _______ S. Alexander Jacobson Shop.Com 1-64

Re: The future of Haskell discussion

ld bear in mind that anything that doesn't build on > existing infrastructure involves a lot of coding and I > haven't seen many volunteers stepping forward yet.) > > Manuel > > ___ > Haskell mailing list > [EMAIL P

Re: The future of Haskell discussion

s in compiling it all into a good usable package. I am not volunteering to do it, but I would be happy to help beta if someone else does. -Alex- PS There may be other better/easier initial application domains for Haskell, but this is what I know. _____

Re: Another question wrt hiding imports

___ S. Alexander Jacobson Shop.Com 1-646-638-2300 voiceThe Easiest Way To Shop (sm) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Why is there a space leak here?

On 6 Jun 2001, Carl R. Witty wrote: > "S. Alexander Jacobson" <[EMAIL PROTECTED]> writes: > > > For example w/ foldl: > > > > foldl + 0 [1..1] > > foldl (+) ((+) 0 1) [2..1] > > foldl (+) ((+) ((+) 0 1) 2) [3..1] > > > >

Re: Why is there a space leak here?

be reached*. In other words, v's "middle" grows faster > than its head, ensuring that take will never consume the tail. Taking > elements from the head only makes the middle grow larger. The more your > take, the larger it grows. > > So the problem isn't Hugs but ra

Happy and Macros (was Re: ANNOUNCE: Happy 1.10 released)

nough? -Alex- _______ S. Alexander Jacobson Shop.Com 1-646-638-2300 voiceThe Easiest Way To Shop (sm) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

RE: Haskell jobs (fwd)

g and supporting the software * we are largely running Java as our platform so easier Java integration is important. > S. Alexander Jacobson writes: > > Off the top of my head here are some Haskell specific things that we need: > > > * HSP pages (like ASP or JSP or PHP) > &

RE: Haskell jobs (fwd)

am leaning towards python because it has curry, map, filter, lambda expressions and a Java interpreter. -Alex- ___ S. Alexander Jacobson Shop.Com 1-212-420-7700 voiceThe Easiest Way To Shop (sm

RE: Haskell jobs (fwd)

Alex- ___ S. Alexander Jacobson Shop.Com 1-212-420-7700 voiceThe Easiest Way To Shop (sm) On Fri, 14 Jul 2000, Benjamin Leon Russell wrote: > Speaking of Haskell- and Haskell-related- jobs, does anybody know of any good Haskell internships? Somebody

FRP/FRAN vs O'Haskell

#x27;Haskell? -Alex- _______ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop (sm) On Fri, 19 May 2000, Paul Hudak wrote: > > Has anyone built any block simulators (for modeling continuous > > electronic sy

FYI: Mozilla Languages and RDF Inference

tter client side scripting in Mozilla. Some lobbying for an open language implementation (or our favorite language), might be appopriate. -Alex- ___ S. Alexander Jacobson Shop.Com 1-212-697-0184 voice

RE: runtime optimization of haskell

rather than the test conditions of the lab. -Alex- ___ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop On Mon, 27 Mar 2000, Simon Peyton-Jones wrote: > One such tool

Re: runtime optimization of haskell

implementation would be a great way to give developers feedback and would do much more to improve software than any type of rt optimization. -Alex-- _______ S. Alexander Jacobson Shop.Com 1-212-697-0184 voice

Re: Relection

This discussion feels like deja-vu all over again! What is wrong with the various generic programming extensions that have already been discussed? Derive, PolyP and their progeny? -Alex- ___ S. Alexander Jacobson

RE: drop & take [was: fixing typos in Haskell-98]

drop"abc" "bc""c" "" "bc""c" "" (take n list) ++ (drop n list) == list This is sane and consistent with itself and python. -Alex- _______

Re: drop & take [was: fixing typos in Haskell-98]

t; take n . take m === take (n + m) > (which, I note in passing, is broken also by suggestion A) All the proposals break this law as well, so I this argument is weak (if not insane :-)) -Alex- ___ S. Alexander Jacobson

RE: fixing typos in Haskell-98

t; [3,4] > drop -2 [1,2,3,4] -> [1,2] > take -2 [1,2,3,4] ++ drop -2 [1,2,3,4] -> [3,4,1,2] > > --brian > ___ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop

Re: fixing typos in Haskell-98

t to B. If the list is finite, these are really useful primitives, like chop() in perl. I think this solution also satisfies Chris Okasaki's: take n xs ++ drop n xs == xs (except where the list is infinite) -Alex- _______ S

Re: deleteBy

an overloaded function may have several > non-overloaded counterparts whose names are suffixed with > `By'[ss]. > Examples: By means "by something simplest", > ByPby predicate, > ByR2 by binary relation, > ... > " > - > > > -- > Sergey Mechveliani > [EMAIL PROTECTED] > > > ___ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop

Re: RE to Peyton-Jones

structures would be a big win here. I know that this may not be Haskell as it is currently conceived, but I assume that the people here know more about the right answers than anyone else. -Alex- _______ S. Alexande

XSLT: Is assignment really necessary for performance?

Internet programming. We are already using XSLt here to manage generating the site. -Alex- ___ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop

Re: OO in Haskell

more powerful, since I can add dancing and singing methods > to objects without having to go back to the original class definition. Encapsulation of state. -Alex- _______ S. Alexander Jacobson Shop.Com 1-212-697-018

CPP is not part of Haskell

ternative is just too slow. -Alex- _______ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop

Xtract with hugs and Haskell implementation inconsistency

(cpp).readlines()[1:]: if line: print line[:-1]; ___________ S. Alexander Jacobson Shop.Com 1-212-697-0184 voiceThe Easiest Way To Shop

  1   2   3   >