Re: [Haskell-cafe] Postdoctoral Fellowship in Functional Programming
--- Iain Lane [EMAIL PROTECTED] wrote: Bryan Burgers wrote: On 9/26/07, Graham Hutton [EMAIL PROTECTED] wrote: Salary will be within the range 25,134 - 32,796 pounds per year, depending on qualifications and experience. The post is available immediately, and will be offered on a fixed-term contract for 3 years. I don't mean to diminish the seriousness of your message, but why is the salary range so exact? Couldn't you have just rounded the upper bound to 32,768 for the sake of readability? I would imagine that they come from the University's salary scales[1]. As for why the salaries on there are so exact, that's anyone's guess. [1] http://www.nottingham.ac.uk/hr/scales/r-t010807%2B.pdf I used to work for a county goverment in the USA where I started at $8.886 per hour and left at $12.998 per hour. Even multiplying by 2080 hours per annum resulted in decimal places. It was probably part of the percentage increases we received each year: somehow it made the infaamous bean counters happy... ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] OSCON 2007, who's going?
--- Evan Lenz [EMAIL PROTECTED] wrote: I'll be there for the Haskell tutorial (and Damian Conway's Vim tutorial). I've been to OSCON one other time (2005) and that was to present a tutorial on XSLT. I won't be staying for the conference though. Portland is nice. I live in Seattle, and we make it down there every so often. Evan XSLT is what I do at my dayjob, too. I just presented a quick tutorial (one hour) on how we like our XSLT to be done and how to use XPath in the company. None of the developers who needed to be there showed up. Next week I do one to show how I use XSLT to route messages around the company. The support guys asked for that, since it will help them debug message flows. Your XSLT 1.0 Pocket Reference is very helpful, but I wish people would buy their own and stop borrowing mine all the time. :-D Today I get to see if we can use Java classes created by a mapping tool, because their XSLT would not run on our infrastructure (IBM's WebSphere Message Broker). The XSLT compiled to bad Java classes, but since the XSLT was created from Java classes, maybe the original Java classes might work??? I've been considering both those tutorials as well as Higher-order Perl and Intro to Rails, but I'll probably end up in whatever isn't full when I get to registering. At least my flight and hotel are booked. Now my employers just have not to cancel my vacation. My next mission, besides convincing people at work that I know Perl and Java (most of what I was doing before they hired me), is to get them to switch to Haskell. Christopher Milton wrote: Are a lot of Haskellers going to be at OSCON, or just Simon Peyton Jones and myself? http://conferences.oreillynet.com/os2007/ I've never been to Portland, Oregon, before. Chris Milton AIM: cmiltonperl ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] OSCON 2007, who's going?
Are a lot of Haskellers going to be at OSCON, or just Simon Peyton Jones and myself? http://conferences.oreillynet.com/os2007/ I've never been to Portland, Oregon, before. Chris Milton AIM: cmiltonperl ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] job ads I saw on DICE
It is rare to see ads looking for Haskell programming experience... http://seeker.dice.com/jobsearch/servlet/JobSearch?op=1002dockey=xml/6/2/[EMAIL PROTECTED]source=3 http://seeker.dice.com/jobsearch/servlet/JobSearch?op=1002dockey=xml/b/8/[EMAIL PROTECTED]source=3 ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Re: [Haskell] Haskell recruitment?
It would be nice to see more Haskell job postings. an aside: As XML gets applied to DoD logistics and supply transactions, it would be interesting to apply Haskell to the problems of data/message conversion... but the XML used in the XML for DoD logistics is implemented with XML Schema Documents, not DTDs. Currently I'm using Perl, Java, and XSLT, as well as XSD. --- Lyle Kopnicky [EMAIL PROTECTED] wrote: I think there are so few such opportunities that it would not overwhelm the list. I should also point out that you can post such openings at http://www.haskell.org/jobs.html by sending an e-mail to [EMAIL PROTECTED] and [EMAIL PROTECTED] Regards, Lyle Jochen L. Leidner wrote: Finally, would it be considered spam to post Haskell-realted job postings in this group? Thanks in advance. Regards, Jochen ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Producing fortran/C code with haskell?
Strafunski might help? --- Derek Elkins [EMAIL PROTECTED] wrote: On Fri, 30 Jan 2004 19:32:53 +0100 Vincenzo aka Nick Name [EMAIL PROTECTED] wrote: I seem to recall a discussion, don't know if it was here or on comp.lang.functional, where somebody said he uses haskell to generate fortran code. That fascinated me a lot, because that would mean being able to generate a program already specialized for a specific input, by first reading input in haskell and then producing code (fortran, but could be C either) - and because I guess it can add static safety exploiting haskell types. Since we already have that nice syntax for monads those programs should be readable, too. Where could I find information on such topics, or existing libraries to generate programs with haskell? Is somebody willing to share what (s)he already did? Googling for embedded domain specific compilers should turn up links on one interesting technique to achieve this. ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe = Christopher Milton [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: 7 Millennium Prize problems
Or maybe Cryptol with P-logic/Programmatica. --- Christopher Milton [EMAIL PROTECTED] wrote: --- Keith Wansbrough [EMAIL PROTECTED] wrote: Christopher Milton [EMAIL PROTECTED] writes: I think Haskell can be used to solve several, if not all, of the seven problems. Now I have to decide which problem to tackle first. (a joke, I assume...) http://www.claymath.org/Millennium_Prize_Problems/ 1. Birch and Swinnerton-Dyer Conjecture 2. Hodge Conjecture 3. Navier-Stokes Equations 4. P vs NP 5. Poincare Conjecture 6. Riemann Hypothesis 7. Yang-Mills Theory Any ideas how to solve any of these, with Haskell or otherwise? I was thinking of combining one of the algebra libraries with a theorem prover, and maybe a refactoring tool, then plugging in some of the equations to see what happens, e.g.: James J. Leifer: Formal logic via functional programming http://para.inria.fr/~leifer/research.html http://para.inria.fr/~leifer/articles/logic/LogicviaFP.300.ps.gz http://para.inria.fr/~leifer/articles/logic/LogicviaFP.gs Serge Mechveliani: DoCon the Algebraic Domain Constructor http://www.haskell.org/docon/ Jeroen Fokker: Explaining algebraic theory with functional programs http://www.cs.uu.nl/people/jeroen/article/algebra/index.html Refactoring Functional Programs http://www.cs.kent.ac.uk/projects/refactor-fp/ Yes, it's crazy and naive, but I need to give my brain some exercise. ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
EDI X12
Has anyone in the Cafe written EDI X12 generator/parser in Haskell? = Christopher Milton [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: pet project - 7 Millennium Prize problemss
--- Keith Wansbrough [EMAIL PROTECTED] wrote: Christopher Milton [EMAIL PROTECTED] writes: I think Haskell can be used to solve several, if not all, of the seven problems. Now I have to decide which problem to tackle first. (a joke, I assume...) http://www.claymath.org/Millennium_Prize_Problems/ 1. Birch and Swinnerton-Dyer Conjecture 2. Hodge Conjecture 3. Navier-Stokes Equations 4. P vs NP 5. Poincare Conjecture 6. Riemann Hypothesis 7. Yang-Mills Theory Any ideas how to solve any of these, with Haskell or otherwise? I was thinking of combining one of the algebra libraries with a theorem prover, and maybe a refactoring tool, then plugging in some of the equations to see what happens, e.g.: James J. Leifer: Formal logic via functional programming http://para.inria.fr/~leifer/research.html http://para.inria.fr/~leifer/articles/logic/LogicviaFP.300.ps.gz http://para.inria.fr/~leifer/articles/logic/LogicviaFP.gs Serge Mechveliani: DoCon the Algebraic Domain Constructor http://www.haskell.org/docon/ Jeroen Fokker: Explaining algebraic theory with functional programs http://www.cs.uu.nl/people/jeroen/article/algebra/index.html Refactoring Functional Programs http://www.cs.kent.ac.uk/projects/refactor-fp/ Yes, it's crazy and naive, but I need to give my brain some exercise. = Christopher Milton [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
pet project - 7 Millennium Prize problemss
Folks, I think Haskell can be used to solve several, if not all, of the seven problems. Now I have to decide which problem to tackle first. Chris = Christopher Milton [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: pet project - 7 Millennium Prize problemss
--- Ketil Malde [EMAIL PROTECTED] wrote: Christopher Milton [EMAIL PROTECTED] writes: I think Haskell can be used to solve several, if not all, of the seven problems. What's this? Is there an URL with more information? Sorry, I meant to include the URL, but I got distracted. http://www.claymath.org/Millennium_Prize_Problems/ = Christopher Milton [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: HSQL Linking Problem with ghc6
Nevermind, I found it. http://htoolkit.sourceforge.net/ --- Christopher Milton [EMAIL PROTECTED] wrote: I keep only finding a Java SQL interface on SourceForge when I look for HSQL. What is the URL? --- Charles Perkins [EMAIL PROTECTED] wrote: Hello Haskellians, I have been looking for a way to get ghc-compiled haskell programs to talk to a PostgreSQL database, and HSQL seems to be exactly what I need... And what's more, it appears to have downloaded and installed with minimal hassle... Alas (and I am sure this is a problem with my own lack of knowledge or misconfiguration of my system) I can't get ghc to link my program to the HSQL libHSSql.a library. At least I think that is the problem. On my debian-stable system, with some packages and libraries upgraded to -testing so I could install ghc6, I downloaded HSQL 1.0 from sourceforge and then ./configured with --enable-postgress and told it to make and then make -install the HSQL package. When I put an import HSQL statement in my program ghc compiles it without errors but the Linking phase reports the following (my program name is EnvPassed:) Linking ... EnvPassed.o: In function `__stginit_main_': EnvPassed.o(.text+0x25): undefined reference to `__stginit_HSQL_' Collect2: ld returned 1 exit status I get the same error when I do a standard compile and when I specify the library to link to as follows: ghc --make EnvPassed.hs -o EnvPassed -lHSsql -L/software/HSQL/ (I had expanded and built HSQL in the /software directory.) Am I doing something stupid? What should I check for this kind of error? Any help would be appreciated. Chuck ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: Monads
Mark, I'm no expert, but does it help to start from withStateT? withStateT :: (s - s) - StateT s m a - StateT s m a withStateT f m = StateT $ runStateT m . f There are some notes about computations and lifting state transformers in Modular Denotational Semantics for Compiler Construction Sheng Liang, Paul Hudak http://citeseer.nj.nec.com/liang96modular.html Monad Transformers and Modular Interpreters Sheng Liang, Paul Hudak, Mark Jones http://citeseer.nj.nec.com/liang95monad.html Don't mind me: I just couldn't control the vestiges of librarianship lurking in my dark, lost soul... Dobrego Nowego Roku! Chris Milton (no, not MLton:-) --- Mark Carroll [EMAIL PROTECTED] wrote: Omitting the typeclass bit, I'm trying to write something like (s1 - s2) - StateT s1 m () - StateT s2 m a - StateT s1 m a That is, it sequences two StateT computations, providing a way to translate from the first's state to the second to keep the chain going. I can easily write something for when s1 and s2 are the same, and my understanding of much of Control.Monad.* remains tenuous at best, but if it's easy for anyone to provide me with some tips, then I thought I should mention that it'd certainly be helpful. And Happy New Year, everyone! -- Mark ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: Representing cyclic data structures efficiently in Haskell
--- Sarah Thompson [EMAIL PROTECTED] wrote: What is the best way to represent cyclic data structures in Haskell? You _might_ find some useful ideas in Franklyn Turbak and J. B. Wells. Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees. Third International Conference on Principles and Practice of Declarative Programming. ACM, 2001. http://cs.wellesley.edu/~fturbak/pubs/ppdp01.html http://cs.wellesley.edu/~fturbak/pubs/index.html Stefan Kahrs. Unlimp: Uniqueness as a leitmotiv for implementation. In M. Bruynooghe and M. Wirsing, editors, Proc. Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science 631, 115--129, 1992. http://citeseer.nj.nec.com/kahrs92unlimp.html Chris Milton (busy processing MILSTRIPs in Perl) = Christopher Milton [EMAIL PROTECTED] ¸ÅÃӤ䤫¤ï¤ºÈô¤Ó¹þ¤à¿å¤Î²» --Matsuo Bashou ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: Interpret haskell within haskell.
--- David Sankel [EMAIL PROTECTED] wrote: I was wondering if there is any project that aims to interpret haskell within haskell. http://www.haskell.org/implementations.html quote type=partial GHC, the Glasgow Haskell Compiler The Glasgow Haskell compiler is a full implementation of Haskell. It is itself written in Haskell and is designed to act as a substrate for the research work of others. The source code is freely available. It produces fast code. /quote The GHC interpreter is ghci. (It's not as slow anymore.) http://www.haskell.org/ghc/ The other Haskell interpreters also load and interpret users' Haskell source code, as well. If you have defined functions in myprog.hs: :load myprog.hs then the functions defined in the file are available, or else you'll get error message(s) about problems found parsing myprog.hs. __ Do you Yahoo!? Yahoo! Mail Plus - Powerful. Affordable. Sign up now. http://mailplus.yahoo.com ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: Editor Tab Expansion
I think the compiler sees ^I and not spaces.
The layout rule follows similar guidelines to good
indenting practice expected in organizations that
program in other languages.
If you use (g)vim to edit, you can :set expandtab
to only use spaces for tabs. We do that where I
work after some grumblings over whether a tab
should represent 4 or 8 spaces. Now we use 4 spaces
and no tabs. (:set list works in most vi flavors
to show whether tab is spaces or ^I chars.)
There are ways to implement it in (n)vi described
in the vi FAQ published each month in comp.editors
on Usenet and Google Groups.
Also availble at
ftp://rtfm.mit.edu/pub/usenet-by-hierarchy/comp/editors/
Also, be careful to write let ... in ... in lowercase.
Haskell is case sensitive.
--- Ingo Wechsung [EMAIL PROTECTED] wrote:
Hello,
I'm new to Haskell and FP in general and I find it great.
Having more than 10 years expirience with whitespace does not matter
languages,
the only thing that drives me crazy is the layout rule.
As far as I understand it, I have 2 options:
1. Use braces and semicolons and ignore the layout rules.
2. Change the settings in all my editors so that the code looks like the
Haskell compiler sees it.
Currently, I expand tabs to 4 spaces only, so
\tx=bar
looks like
foo = bar
to me when the compiler sees
foo = bar
I would not want to change dozens of .exrc files, shell startup files with
and/or ultraedit settings on many different machines.
I also do not want to care whether there are spaces or tabs in front of my
source code lines.
So I'm stuck with option 1, right?
Just to be sure, can I really, really forget about layout if I write fully
braced and semicolonoized code?
Besides, is there any reason why the syntax is LET { decl1; decl2; ... } IN
expr when LET and IN are sufficient enough to enclose the declarations?
Greetings,
Ingo
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
=
Christopher Milton
[EMAIL PROTECTED]
__
Do you Yahoo!?
Yahoo! Mail Plus - Powerful. Affordable. Sign up now.
http://mailplus.yahoo.com
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: newbie question re linear algebra in Haskell
--- Keith Wansbrough [EMAIL PROTECTED] wrote: I'm a complete newcomer to Haskell, having learned about only recently. I'm intrigued by the possibility of in using it for numerical applications, specifically linear algebra. I understand that (at least in its present state) Haskell 98 isn't competitive with imperative languages when it comes to primitive matrix-vector operations, which often rely on destructive updating. It strikes me that one approach that takes advantage of the strengths of both paradigms would be create an imperative subsystem to handle primitive operations, then create a functional matrix algebra layer on top of it. [..] One thing that comes to mind is Barry Jay's FISh language: http://www-staff.it.uts.edu.au/~cbj/Publications/shapes.html#Array_Programming This compiles code in a functional language with arrays down to C, by using shape inference to fix the size of all the arrays. I believe FFTW (the Fastest Fourier Transform in the West) similarly uses a functional programming language to generate imperative (C) code. Mr. Austin migfht also want to look at some dated modules at ftp://ftp.cs.chalmers.se/pub/haskell/library/bevan/ and perhaps at Matrix Inversion using Quadtrees Implemented in Gofer (1995) Jeremy D. Frens David S. Wise http://citeseer.nj.nec.com/frens95matrix.html Auto-Blocking Matrix-Multiplication or Tracking BLAS3 Performance from Source Code (1997) Jeremy D. Frens David S. Wise http://citeseer.nj.nec.com/frens97autoblocking.html and From Fast Exponentiation to Square Matrices: An Adventure in Types Chris Okasaki http://www.eecs.usma.edu/Personnel/okasaki/pubs.html#icfp99 Chris = Christopher Milton [EMAIL PROTECTED] __ Do you Yahoo!? Yahoo! Web Hosting - Let the expert host your site http://webhosting.yahoo.com ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: Sets
This might be of some help, circa Haskell 1.2, SetMap.hs - sets and maps in Haskell Author: Nick North ftp://ftp.cs.chalmers.se/pub/haskell/library/SetMap.hs Chris = Christopher Milton [EMAIL PROTECTED] __ Do you Yahoo!? Yahoo! Web Hosting - Let the expert host your site http://webhosting.yahoo.com ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: storing to a file
For some reason, the York ftp links never work for me, so here are the links for the Binary data papers (practically all of their webpages only point to ftp://; for papers): Heap Compression and Binary I/O in Haskell Malcolm Wallace and Colin Runciman http://www.cs.york.ac.uk/ftpdir/pub/malcolm/hw97.html The Bits Between The Lambdas: Binary Data in a Lazy Functional Language Malcolm Wallace and Colin Runciman http://www.cs.york.ac.uk/ftpdir/pub/malcolm/ismm98.html Chris Milton --- Mark Carroll [EMAIL PROTECTED] wrote: On 14 Nov 2002, Johan Steunenberg wrote: thanks for your advice, I guess it sweetens the situation, though I really would like to know how to store in a binary format. http://www.pms.informatik.uni-muenchen.de/mitarbeiter/panne/haskell_libs/Binary.html might be interesting for you. Actually, deriving binary would be a nice thing to have in general - even more, a way to add your own deriving things from within Haskell, although I have no idea how such a thing would work. http://www.pms.informatik.uni-muenchen.de/forschung/haskell-wish-list/items.php3?sort=pmono=y seems to be a bit broken at the moment so I don't know if that relates to any proposed extensions. Are there any pages that summarise what people have learned from trying out already-implemented extensions, to help get an idea what the next Haskell will be like, or what ideas to try next? For instance, I expect to see some concurrency and exceptions, multi-parameter type classes, etc. make it through. -- Mark __ Do you Yahoo!? Yahoo! Web Hosting - Let the expert host your site http://webhosting.yahoo.com ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Haskell98 Report copyright
I hope we don't have a repeat of the MathWorld website shutdown.* I also can't find a webpage with the definition of Standard ML... only avaible in print from MIT Press? Chris * http://mathworld.wolfram.com/erics_commentary.html = Christopher Milton [EMAIL PROTECTED] __ Do you Yahoo!? U2 on LAUNCH - Exclusive greatest hits videos http://launch.yahoo.com/u2 ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
categorical prelude
I have a copy of the paper by Erik Meijer and Luc Duponcheel, On the expressive power of Combinator Classes, but I can't seem to find a copy of the prelude file anywhere. Has anyone still got a copy anywhere? I look to hearing from you. = Christopher M. Milton [EMAIL PROTECTED] Phone719/380-7665 Colorado Springs, CO __ Do You Yahoo!? Yahoo! GeoCities - quick and easy web site hosting, just $8.95/month. http://geocities.yahoo.com/ps/info1 ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: categorical prelude
Oops, that should have been Constructor Classes. --- Christopher Milton [EMAIL PROTECTED] wrote: I have a copy of the paper by Erik Meijer and Luc Duponcheel, On the expressive power of Combinator Classes, but I can't seem to find a copy of the prelude file anywhere. Has anyone still got a copy anywhere? I look to hearing from you. __ Do You Yahoo!? Yahoo! GeoCities - quick and easy web site hosting, just $8.95/month. http://geocities.yahoo.com/ps/info1 ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Hugs 1.4 sourcecode availability?
Does anyone here still have a tarball of Hugs 1.4 (any release)? I seem to have lost my copies somewhere along the line. I like to make comparisons between different releases sometimes. (I still play with Gofer, too.) -- Christopher Milton [EMAIL PROTECTED] Colorado Springs, Colorado, USA http://www.geocities.com/cmiltonperl itinerant programmer __ Do You Yahoo!? Find the one for you at Yahoo! Personals http://personals.yahoo.com ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
