Re:

Jules Gilbert writes: >>Huh? I don't know what this letter of yours is in response to. I have been getting funny misdirected e-mail recently so if you are answering something that appears to come from me I would be interested to see the details. Richard Platek

No Subject

ou soon! >> John John, I don't know how you got my e-mail address but I am not your brother so you should try again. Richard Platek

Re: hGetChar considered harmful

Marcin Kowalczyk writes: >Sun, 23 Jul 2000 19:38:39 -0700 (PDT), Richard Uhtenwoldt <[EMAIL PROTECTED]> pisze: > >> but it would be nice for a small program fragment be able to loop over >> the contents of an input file without resorting to "catch", which is &

list archive

there exists a 'web interface' to the old messages to this list. I want the old messages in one big file, eg, a tarfile or a mail folder in mbox format or such, so I can grep them. I already have the traffic since Feb 15, 2000. if you can provide me with such a thing, let me know. (logistics: I

Re: The importance and relevance of FP

Ralf Muschall writes: >Some old dead lisps might lack lexical scoping, at least CL has it >since a long time. The only places I know about where old lisps still >live are Reduce and Autocad (is this still dynamical?). They still live in Emacs. (Emacs Lisp's variables are dynamically scoped.)

Re: mapM/concatMapMy

Sengan Baring-Gould writes: >Is >>= not lazy? since no experts have answered yet, this newbie will answer. I think it's strict. somewhere in the compiler doco, IIRC, it says (>>=) was lazy at first, but experience showed it was more confusing for users (Haskell programmers). moreover, from the

List types

Eric Allen Wohlstadter writes: >I would like to be able to make a list that contains functions which take >arguments of a certain type 'a'. However I don't know how many 'a' >arguments there are. For example I'd like to be able to make a list of >f,g, and h. > >f::a->b >g::a->a->b >h::a->a->a->b >

proofs

I want to learn how to go about proving things like (p >>= j) >= k == p >>= (\x->(j x >>= k)) where p >>= k = \s0 -> let (s1, a) = p s0 in k a s1 eg, verifying that the 3 monad laws hold for a specific monad. also, verifying the more n

[Haskell] Announcement

My book "Pearls of Functional Algorithm Design" will be published by CUP this month. See http://www.comlab.ox.ac.uk/news/237-full.html Richard Bird ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Haskell2Java

exists Haskell to C translators and C to Java translators but I am interested in a rather more highly tuned compilations process which can evolve to add support for parallelization and distribution. Thanks for your time. Richard Emberson [EMAIL PROTECTED]

Design Methodologies

y created to provide a common OO design technique for such projects (and, no doubt, to create a single larger tools market, rather than a number of smaller, disjoint markets). What exists for functional languages? Thanks. Richard Emberson

Book announcement

. Yours faithfully, Richard Knott Purely Functional Data Structures Chris Okasaki Columbia University Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML

Re: Haskell Wish list: library documentation

t: * a single (say) Latex/Postscript document * a single HTML document * a sequence of HTML documents; perhaps grouping by similar function. So we could produce for instance a compact printable ``quick reference'' form or extensive cross linked HTML form. Regards Richard

why software needs an explicit license

George Russell seems to imply that the only purpose of a license is to protect the copyright holder's rights: >The is a drag; I suspect it could in fact be dispensed with in >most though sadly not all of the civilised world, where the presence of >a "LICENSE" file in all distributions, or indeed

Re: more detailed explanation about forall in Haskell

although this argument originated from a discussion of rank-2 polymorphism in Haskell's type system, the part I am replying to addresses only first-order predicate logic (also called "predicate calculus"). Jan Brosius asserts > Now forall s1. ( ST s1 T(s)) IMPLIES forall s . ( ST s T(s) )

hGetChar considered harmful

Chapter "IO" of the Haskell 98 Library Report contains this example: import IO import System main = do [f1,f2] <- getArgs h1 <- openFile f1 ReadMode h2 <- openFile f2 WriteMode copyFile h1 h2 hClose h1 hClose h2

Tackling the Awkward Squad

Simon Peyton-Jones tell us of his latest paper: > Tackling the Awkward Squad: monadic I/O, concurrency, exceptions, > and foreign-language calls in Haskell. > > http://research.microsoft.com/~simonpj/papers/marktoberdorf.ps.gz > >This 40-page tutorial focuses on explaining the "

RE: Literate Programming

this is addressed to Mark, but others may be interested in my lament against papers available only in "paper-oriented" formats (dvi, ps, pdf). Mark P. Jones writes: >I use exactly the kind of techniques described here in my work. For >example, I use literate programming for the "Typing Haskell i

Re: Coroutines

Andreas Gruenbacher writes: >It's not what I had in mind, though. Simon's MVars (in the Awkward Squad) >come pretty close, but they're still not the sort of (cooperative) >multitasking that I'm thinking of. I hope I'm not being too fussy, but seems to me that the CVar is what is needed, not the

Re: micro-rant

nguage specification, and would remove a obstacle that novice programmers sometimes stumble over. Richard ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Multi-parameter OOP

Ashley Yakeley: >I think existential types are arranged so that Haskell never needs to >store type information in them at run-time. So you'll never be able to do >dynamic OOP with them. > >One possible extension to Haskell for dynamic OOP, which I never tire of >suggesting, is the extensible data

penalty for proper tail recursion

What is the penalty that compilers pay these days for allowing "proper" tail-recursion (that does not grow the stack)? It used to be that implementations targetting C would use the while (1) {cont=(*cont)();} trick, which would lose a factor of 2 or so in speed IIRC. If the compiler

big picture on optimization

s ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

type aliases in instances

... of course, you also cannot use liftM and other library functions with (Monad m)=> in their signature, but I do not mind that so much as loss of the do notation. -- Richard Uhtenwoldt ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: using less stack

because with recursion, lists and monadic interfaces Haskell already has a lot of significant learning barriers to adoption, and the nonrecursive style of definition is easier to learn (get used to) than any one of those last 3. -- Richard Uhtenwoldt ___ H

a survey of language popularity

ian http://people.debian.org/~jgb/debian-counting/";>Counting Debian // http://www.eros-os.org/pipermail/e-lang/2001-February/004594.html";> [E-Lang] popularity of programming languages among open source hackers // weak survey, of Sourceforge projects. see also Oct 2001 e-lang. -- Ric

Re: ">>" and "do" notation

>If (as a human reader of a programme) I see > >do a <- thing1 > > >and I notice (perhaps after some modifications) that a is >not present in , then I /really/ don't want a >change to > >do thing1 > > >to change the meaning of the programme. That's understandable, just like it's understanda

monads, modules, sandboxes

org/pipermail/e-lang/. If you post to this mailing list, please tell them I sent you! I participated on this list till earlier this month. Finally, my favorite intros to capability thinking are: http://mumble.net/jar/pubs/secureos/";>Rees's 1995 paper "Security Kernel" ht

Re: Best recursion choice for "penultimax"

iq (y : xs) | otherwise = x : uniq (y : xs) uniq xs = xs -- empty and singleton lists Richard Braakman ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: nub

t; to "unique" makes it clear that it is similar, but not identical to what Unix "uniq" does. Richard Braakman ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

RE: Running out of memory in a simple monad

David Bergman writes: >It is easy to get the feeling that the recursive call in > > recurse = do > f x > recurse > >is the last one, but this is just an illusion of the iterative layout of >"do". Sometimes the monads lure us into old iterative thou

The Haskell 98 Report

Simon PJ writes: > the existing notice that says "you can do what >you like with this Report" will stay unchanged. No "non-commercial >only" caveats. I remained relatively quiet throughout the discussion, as I have not contributed to the Report, but I'm very much relieved. S

RE: Running out of memory in a simple monad

many Haskellers have a negative opinion of such heavy use of the IO monad, but in systems programming you need more control over when (relative to other interactions) your program performs an interaction with a file, network or UI resource than is available in Haskell without the IO monad. -- Richard

Re: dynamic types

Hal Daume III writes: >You are correct. You can't say: > > let x = if ??? then () else (5::Integer) I meant to ask if when you do this next let x = if ??? then toDyn () else toDyn (5::Integer) can you then dispatch on x's type. In my sample code, I forgot the toDyns. eek! Anyway, this nex

dynamic types

Just want to make sure I understand. There does not exist a Haskell implementation-specific extension which provides the sort of dynamic type that would allow one to discriminate at run time between built-in types; right? eg, main=do object<-readLn case object of --or some such syntax

ANNOUNCE: Helium, for learning Haskell

Instructions for installing Helium 1.0 on Debian GNU/Linux. I'm on version 3.0 of Debian, a.k.a, Woody. I'm just a user of, not an expert on Debian. 1. apt-get install ghc5 libreadline4 libreadline4-dev # Optionally, get some documentation for GHC; libsrc is source code # for th

[list-mm-net] 1st MM-NET Workshop on Analytical Techniques for Memory Management

ctors. Registration is free for mm-net members and should be made through http://www.mm-net.org.uk/ Coffees and lunch will be provided. Some support for travel costs for UK personnel may be available (please contact Richard Jones <[EMAIL PROTECTED]>). Talk slots will be allocated

Re: [Haskell] Function to replace given element in list

Hi Niely, everything after the "in" in your "let in" is one expression. In other words all of this: init x x ++ newNmr x ++ y is being read as one line.. so init x x ++ newNmr x ++ y which is why the compiler is complaining

[Haskell] Haskell Implementors' Workshop Call for Talks

nd perplex Haskell implementors, or simply to ask for feedback and collaborators. Program Committee - * Richard A. Eisenberg -- chair (Bryn Mawr College) * Adam Gundry (Well-Typed) * Bartosz Nitka (Facebook) * Wren Romano (X, formerly Google[x]) * Alejandro Serrano Mena (U

[Haskell] Deadline in 2 days: Haskell Implementors' Workshop Call for Talks

implementors, or simply to ask for feedback and collaborators. Program Committee - * Richard A. Eisenberg -- chair (Bryn Mawr College) * Adam Gundry (Well-Typed) * Bartosz Nitka (Facebook) * Wren Romano (X, formerly Google[x]) * Alejandro Serrano Mena (Utrecht Univers

Re: [Haskell] Guidelines for respectful communication

cally? Thanks for coming forward with these concerns. Richard > On Dec 6, 2018, at 4:59 PM, Philippa Cowderoy wrote: > > I lack the energy to contribute to GHC directly, but these guidelines are far > too easy to abuse by someone acting in bad faith and we know that bad faith > actor

[Haskell] CFP: Haskell Symposium 2019

rón Trilla Galois, Inc Benjamin Delaware Purdue University Richard Eisenberg (chair) Bryn Mawr College Jennifer HackettUniversity of Nottingham Kazutaka MatsudaTohoku University Trevor McDonnellUtrecht University

[Haskell] Haskell Symposium: Early Track due this Friday, March 15

rón Trilla Galois, Inc Benjamin Delaware Purdue University Richard Eisenberg (chair) Bryn Mawr College Jennifer HackettUniversity of Nottingham Kazutaka MatsudaTohoku University Trevor McDonell Utrecht University

[Haskell] Final CFP: Haskell Symposium due this Friday

rón Trilla Galois, Inc Benjamin Delaware Purdue University Richard Eisenberg (chair) Bryn Mawr College Jennifer HackettUniversity of Nottingham Kazutaka MatsudaTohoku University Trevor McDonell Utrecht University

[Haskell] Haskell Symposium: early reg deadline is next week

ge on Thursday, 22 August. • Lennart Augustsson and Satnam Singh, both of Google Research, will co-present Haskell Use and Abuse at Scale on Friday, 23 August. Come join! Symposium details are below. I hope to see you there! Ri

[Haskell] CfP: Haskell eXchange

a few topic areas we want to make sure to cover, other talks are very welcome. I hope you submit something! Thanks, Richard -- The Haskell eXchange Call for Participation is now open! We actively encourage submissions on the following topics: • Optimization and

[Haskell] Tomorrow: Simon PJ announces Haskell Foundation

Tomorrow (Wednesday Nov 4) at 12:00 UTC, Simon PJ will announce the formation of the Haskell Foundation, an independent, non-profit organization dedicated to broadening Haskell adoption. This will be a part of Haskell eXchange, but this announcement will be free to attend, via YouTube. Much of t

[Haskell] Announcing the Haskell Foundation

I'm very pleased to announce the creation of the Haskell Foundation (HF), an independent, non-profit organisation dedicated to broadening Haskell adoption. Website: https://haskell.foundation/ Twitter: @haskellfound Founding whitepaper: https://haskell.foundation/whi

[Haskell] Help lead Haskell: Executive Director sought for Haskell Foundation

Posting on behalf of the Haskell Foundation Working Group. Please forward widely! The Haskell Foundation is seeking an Executive Director. Please find the job description here: https://haskell.foundation/ ed-job-description

Question on output redirection with Gofer

tion of this capability mentioned in the documentation. This feature was very handy in Miranda for quickly constructing text files. ('&>>' would append the output to the file.) I am using the Gofer interpreter Version 2.30a on a UNIX System V Release 4.0 machine. Thank you. Richard E. Adams [EMAIL PROTECTED]

proposal for anonymous-sum syntax

Haskell has nice syntactic support for unnamed product types (tuples). It is as though there were builtin several datatype definitions of the form: data (a,b) = (a,b) data (a,b,c) = (a,b,c) data (a,b,c,d) = (a,b,c,d) ... But for sum types, there is only one generi

Re: learning to love laziness

On Wed, 24 Sep 2003, Norman Ramsey wrote: > Consider the following Haskell function: > > > asPair x = (fst x, snd x) > > This function has type forall a b. (a, b) -> (a, b) > and is almost equivalent to the identity function, except it > can be used to make programs terminate that might otherw

Question concerning ftp and GHC binaries for HP-UX

not sure whether it is relevant, but I use Reflection terminal emulation to telnet from my PC to the HP 9000 machine. Truly 'hi-tech' :) . Thank you. Sincerely, Richard E. Adams Softmatrix, Inc. Roseville, CA Email: [EMAIL PROTECTED] _