Re: [***SPAM***] Re: [Haskell-cafe] How does one get off haskell?
On Jun 24, 2010, at 10:41 PM, cas...@istar.ca wrote: Quoting Andrew Coppin andrewcop...@btinternet.com: Serguey Zefirov wrote: I should suggest code generation from Haskell to C#/Java and PHP. Like Barrelfish, Atom, HJScript and many others EDSLs out there. You will save yourself time, you will enjoy Haskell. Probably, you will have problems with management because your programs will appear there in their completeness very suddently. ; I would imagine a bigger problem is that machine-generated C# is probably incomprehensible to humans. ;-) Most machine-generated code is probably incomprehensible to humans. :) What one wants is a translator back and forth, if one could understand the machine-generated code. Maybe you should translate to Perl. Nobody will notice it is machine-generated. Jur ___ 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] CFPapers: 22nd Symposium on Implementation and Applications of Functional Languages (IFL 2010)
CALL FOR PAPERS 22nd Symposium on Implementation and Applications of Functional Languages (IFL 2010) September 1-3, 2010 Utrecht University Alphen aan den Rijn, The Netherlands http://www.cs.uu.nl/wiki/bin/view/IFL2010/WebHome After a first successful visit to the USA, the Symposium on Implementation and Applications of Functional Languages returns to Europe for its 22nd edition. The hosting institution is Utrecht University in the Netherlands, although the conference itself will take place in the ornithological theme park Avifauna in Alphen aan den Rijn, situated conveniently close to Schiphol (Amsterdam Airport). The symposium dates are September 1-3, 2010. The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2010 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2010 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2010 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues. Here we follow the ACM Sigplan republication policy as defined on http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles, which will appear in the formal proceedings. INVITED SPEAKER Johan Nordlander of Lulea University, the designer and developer of the Timber language, is the invited speaker at IFL 2010. Timber is a functional programming language that draws some of its concepts from object-oriented programming, and has built-in facilities for concurrent execution. The language is specifically targeted at implementing real-time embedded systems. TOPICS IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2010, please contact the PC chair at j...@cs.uu.nl. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation runtime function specialization runtime code generation partial evaluation (abstract) interpretation generic programming techniques automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques runtime profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques industrial applications of functional programming PAPER SUBMISSIONS Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of Utrecht University. PETER LANDIN PRIZE The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honored article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. IMPORTANT DATES Draft proceedings submission deadline July 25, 2010 Registration deadline August 1, 2010 IFL 2010 Symposium September 1-3, 2010 Submission for review process deadline October 25, 2010 Notification Accept/Reject December 22, 2010 Camera ready versionFebruary 17, 2011 PROGRAM COMMITTEE Jost Berthold University of Copenhagen (DIKU), Denmark Olaf Chitil University of Kent, UK John
Re: [Haskell-cafe] Language simplicity
Andrew Coppin wrote: OK people, it's random statistics time! OK, my version of meaningless statistics: Java: 450 pages (language only?) Which version is this? The version of the Java Language Specification (version 3.0, 2005) I am currently reading has 684 pages. I'd prefer to read only 450. Jur ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Language simplicity
On Jan 14, 2010, at 8:38 PM, Andrew Coppin wrote: Martijn van Steenbergen wrote: Niklas Broberg wrote: 21 actually. case, class, data, default, deriving, do, else, if, import, in, infix, infixl, infixr, instance, let, module, newtype, of, then, type, where. There's also three special words that can still be used as identifiers, so aren't reserved: as, qualified, hiding. Since you can define operators in Haskell, would it make sense to include '=', '--', ':', ',' etc. as reserved names since those can't be used as operator names? Makes sense to me... It's merely more difficult to catelogue this information for a half- dozen different languages. Looking up the reserved word list is usually only a Google search away. Somebody suggested to me that the best metric for how difficult a language is to learn is the number of orthogonal concepts you need to learn. Of course, measuring THAT is going to be no picknick! I do not think so. More orthogonal concepts may make it more work to learn the language, but I think orthogonality helps to learn a language that has many concepts. For me, a major problem when learning a language is ad-hocness. The Java Language Specification part on Generics (parametric polymorphism) comes to mind. It is full of ad-hoc restrictions, and operational details. Haskell's polymorphism behaves much more predictably because it is much less ad-hoc. Although I do not have any Python programming experience, I got the impression that Python is very un-ad-hoc. Everything behaves in exactly the same way at all possible levels in the language. You need to master only one idea and it applies everywhere. Even if the way it behaves is strange. Jurriaan ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Test cases for type inference
On Tue, Oct 20, 2009 at 10:07 AM, Peter Verswyvelen bugf...@gmail.com wrote: For learning, I would like to develop my own implementation of type inference, based on the paper Typing Haskell in Haskell. At first sight, the source code of THIH contains a small number of tests, but I was wandering if a large test set exist? Thanks, Peter Dear Peter, The sources of the Helium compiler contain quite a few test files for type inference and other issues like static checking. Go to http://www.cs.uu.nl/wiki/Helium go to Downloads and get the most recent version. Then unpack it. Then go to the directory heliumsystem/helium/test/typerrrors that contains a large number of type erroneous programs,and heliumsystem/helium/test/correct contains quite a few that should pass the test (but that does depend somewhat on how extensive the language you support is). hope this helps, Jurriaan ___ 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 mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell] Re: on starting Haskell-Edu, a new education-related Haskell-related mailing list
On Jul 11, 2008, at 10:25 PM, Peter Verswyvelen wrote: [EMAIL PROTECTED] beginner sounds so humble... [EMAIL PROTECTED] ? [EMAIL PROTECTED] ? Jur Cheers, Peter Verswyvelen www.anygma.com -Original Message- From: [EMAIL PROTECTED] [mailto:haskell- [EMAIL PROTECTED] On Behalf Of Neil Mitchell Sent: vrijdag 11 juli 2008 17:33 To: Simon Marlow Cc: Bayley, Alistair; haskell@haskell.org Subject: Re: [Haskell] Re: on starting Haskell-Edu, a new education- related Haskell-related mailing list Hi Quite true. Any objections to [EMAIL PROTECTED] Google suggests that about 1 in 50 web pages spell beginner wrong, using only one n. Given that many Haskeller's are not native speakers, could we perhaps pick something that is easier to spell correctly? Thanks Neil ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
Re: [Haskell] on starting Haskell-Edu, a new education-related Haskell-related mailing list
taught Haskell. E.g., what kind of assignments work, which don't. Also it will give me a venue to bring Helium to the attention of these beginners and their educators. I am currently bringing the Helium compiler up to speed (but this is not a formal announcement). However, if you simply cannot wait, set your browser to http://www.cs.uu.nl/wiki/Helium . cheers, Jur --- On Sat, 6/28/08, Simon Marlow [EMAIL PROTECTED] wrote: From: Simon Marlow [EMAIL PROTECTED] Subject: Re: on starting a new Haskell-related mailing list To: Benjamin L. Russell [EMAIL PROTECTED] Cc: John Peterson [EMAIL PROTECTED] Date: Saturday, June 28, 2008, 4:20 AM Hi Benjamin, Normally we create new mailing lists when the new list has a narrow focus and covers a clearly unoccupied niche. In this case you're proposing a list that is very broad, and so I think it needs discussion amongst the community before we create the list, so that we can keep a consistent strategy. That's not to say that I disagree with your proposal. But it doesn't seem immediately clear what the focus would be, and why haskell-cafe shouldn't serve the purpose. One thing that isn't clear is whether the list you're proposing is for people interested in *teaching* Haskell (in which case I'd say it's a great idea), or people *learning* Haskell (in which case I'd consider carefully whether haskell-cafe shoudn't be serving that need). That's something you need to clarify when proposing this list to the community. So I suggest you send this proposal out to haskell@haskell.org in the first instance, and see what response you get. Discussion should move to haskell-cafe quickly. Cheers, Simon Benjamin L. Russell wrote: Greetings, John Peterson suggested that I send you an e-mail message requesting you to perform set-up of a new Haskell-related mailing list that I plan to moderate/administrate, since he said that you are the administrator of the mailing lists on Haskell.org. My name is Benjamin L. Russell, and I am interested in starting a new mailing list on Haskell, which I plan to call Haskell-Edu, specifically devoted to non-research beginner-level educational matters, guided by the philosophy that Haskell should be more accessible to non-computer science major students. This topic is not covered by any of the other mailing lists. I have regularly read both Haskell and Haskell-Cafe for the past six months or so, but the former is devoted to announcements, and the latter de facto to research matters. Also, the general tone of Haskell-Cafe is overly academic and research-oriented, and I feel that this creates an unnecessary learning curve for non-computer science majors interested in learning Haskell. Since John Peterson recommended that I request you to set-up the mailing list on Haskell.org, could you please set it whenever you have free time, as follows: Name of Mailing List: Haskell-Edu E-mail Address:[EMAIL PROTECTED] Description: The Haskell-Edu Mailing List: Discussion About Non-research Issues on Haskell in Education Could you please advise me on what I need to do to start this mailing list? Should I host it on haskell.org, or just start it by myself using a non-Haskell.org mailing list service? Also, how should I have it listed in the www.haskell.org Mailing Lists (http://www.haskell.org/mailman/listinfo) page for the benefit of other members of the Haskell community? Thank you very much for your time and cooperation. Sincerely yours, Benjamin L. Russell --- On Fri, 6/27/08, John Peterson [EMAIL PROTECTED] wrote: From: John Peterson [EMAIL PROTECTED] Subject: RE: on starting a new Haskell-related mailing list To: Benjamin L. Russell [EMAIL PROTECTED] Date: Friday, June 27, 2008, 12:05 AM Hi Benjamin, There's no problem starting a new mailing list. Simon Marlow is the administrator of our lists - if you drop him and email he'll do the setup for Haskell.org. Once the list is going, you can go into the wiki and add it to the appropriate pages. We've had a bunch of these special interest lists and most of them go dead after a few months but you never know ... John --- On Thu, 6/26/08, Benjamin L. Russell [EMAIL PROTECTED] wrote: From: Benjamin L. Russell [EMAIL PROTECTED] Subject: on starting a new Haskell-related mailing list To: John Peterson [EMAIL PROTECTED] Date: Thursday, June 26, 2008, 4:37 PM Greetings, My name is Benjamin L. Russell, and I am interested in starting a new mailing list on Haskell, which I plan to call Haskell-Edu, specifically devoted to non-research beginner-level educational matters, guided by the philosophy that Haskell should be more accessible to non-computer science major students. (This message is being addressed to you because I had already sent the portion below twice to other administrators at Haskell.org, first to [EMAIL PROTECTED], and then to [EMAIL PROTECTED], but had not received a response on either
package net question
Hello, I've been building the head and in my adaptation i need package net. I added this to the SRC_HC_OPTS, which made at least the haskell compile to hi/o. But when the ghc-6.5 compiler is built I get the complaint that ghc- inplace does not have this package. Funny thing is that when I omit the -package net option, it does compile. What is the cause of all this? Must I reconfigure and build? Is there something else I am missing? I can imagine that it is determined from the SRC_HC_OPTS which packages must be built for ghc-inplace, but maybe there is a different reason. Note that I did not do a rebuild (and I would like to avoid reconfiguring and building since it takes ages on my machine). And before I do it, it would be nice to know that this solves the not overly large problem. So, can anyone tell me? thanks, Jur ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
cvs-head compile question
Hi there, when I compile the head I get this message /usr/bin/ld: Undefined symbols: _ding _free_undo_list _rl_add_undo _rl_basic_quote_characters _rl_begin_undo_group _rl_bind_key_in_map _rl_binding_keymap _rl_char_is_quoted_p _rl_clear_message _rl_clear_signals _rl_complete_internal _rl_copy_keymap _rl_copy_text _rl_delete_text _rl_directory_completion_hook _rl_discard_keymap _rl_do_undo _rl_end_undo_group _rl_executing_keymap _rl_filename_dequoting_function _rl_filename_quote_characters _rl_filename_quoting_desired _rl_filename_quoting_function _rl_forced_update_display _rl_function_dumper _rl_function_of_keyseq _rl_generic_bind _rl_get_keymap _rl_get_keymap_by_name _rl_get_keymap_name _rl_ignore_some_completions_function _rl_insert_completions _rl_insert_text _rl_kill_text _rl_list_funmap_names _rl_make_bare_keymap _rl_make_keymap _rl_mark _rl_modifying _rl_named_function _rl_on_new_line _rl_pending_input _rl_possible_completions _rl_reset_line_state _rl_set_keymap _rl_set_signals _rl_unbind_command_in_map _rl_unbind_key _rl_unbind_key_in_map _rl_message collect2: ld returned 1 exit status ghc: 32089144 bytes, 4 GCs, 95456/95456 avg/max bytes residency (1 samples), 16M in use, 0.03 INIT (0.00 elapsed), 0.51 MUT (33.23 elapsed), 0.07 GC (0.26 elapsed) :ghc make[2]: *** [stage2/ghc-6.5] Error 1 make[1]: *** [stage2] Error 2 make: *** [bootstrap2] Error 2 So what am I missing. Is it GTK+2? Do I really need it? Is there some way to compile the compiler without needing to bother with this? thanks, Jur ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Build fail on MacOSX 1.4.5
Hello, been trying tobuild ghc from scratch (I'd like to fiddle with its code). I work on a PowerBook Mac under version 1.4.5 of MacOSX and the compile failed on the 1.4.2 sources from the haskell.org/ghc site. Strangely, this seemed also to be a bug on MacOSX 1.3.9 and a bug tracking report told me it was fixed. So what happened here? Can anybody help me out? Please reply to this message, since I am not a member of this group (yet). The output of the compiler is this: ...lots of stuf omitted... /usr/local/bin/ghc -H16m -O -istage1/utils -istage1/basicTypes - istage1/types -istage1/hsSyn -istage1/prelude -istage1/rename - istage1/typecheck -istage1/deSugar -istage1/coreSyn -istage1/ specialise -istage1/simplCore -istage1/stranal -istage1/stgSyn - istage1/simplStg -istage1/codeGen -istage1/main -istage1/ profiling -istage1/parser -istage1/cprAnalysis -istage1/compMan - istage1/ndpFlatten -istage1/iface -istage1/cmm -istage1/nativeGen -istage1/ghci -Istage1 -DGHCI -package template-haskell -package readline -DUSE_READLINE -cpp -fglasgow-exts -fno-generics -Rghc- timing -I. -IcodeGen -InativeGen -Iparser -package unix -ignore- package lang -recomp -Rghc-timing -H16M '-#include hschooks.h' - i../lib/compat -ignore-package Cabal-c utils/PrimPacked.lhs -o stage1/utils/PrimPacked.o -ohi stage1/utils/PrimPacked.hi utils/PrimPacked.lhs:250:0: Warning: foreign declaration uses deprecated non-standard syntax utils/PrimPacked.lhs:254:0: Warning: foreign declaration uses deprecated non-standard syntax utils/PrimPacked.lhs:257:0: Warning: foreign declaration uses deprecated non-standard syntax utils/PrimPacked.lhs:260:0: Warning: foreign declaration uses deprecated non-standard syntax utils/PrimPacked.lhs:263:0: Warning: foreign declaration uses deprecated non-standard syntax In file included from /tmp/ghc29849.hc:5: /usr/local/lib/ghc-6.4.1/include/HsUnix.h: In function '__hsunix_rtldNext': /usr/local/lib/ghc-6.4.1/include/HsUnix.h:103: error: 'RTLD_NEXT' undeclared (first use in this function) /usr/local/lib/ghc-6.4.1/include/HsUnix.h:103: error: (Each undeclared identifier is reported only once /usr/local/lib/ghc-6.4.1/include/HsUnix.h:103: error: for each function it appears in.) /usr/local/lib/ghc-6.4.1/include/HsUnix.h: In function '__hsunix_rtldDefault': /usr/local/lib/ghc-6.4.1/include/HsUnix.h:107: error: 'RTLD_DEFAULT' undeclared (first use in this function) ghc: 49082080 bytes, 10 GCs, 1539742/2981452 avg/max bytes residency (2 samples), 17M in use, 0.13 INIT (0.00 elapsed), 0.54 MUT (1.13 elapsed), 0.25 GC (0.36 elapsed) :ghc make[2]: *** [stage1/utils/PrimPacked.o] Error 1 make[1]: *** [all] Error 1 make: *** [build] Error 1 cheers, Jur(riaan Hage) ___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
Re: what's the goal of haskell-prime?
On Jan 31, 2006, at 1:50 PM, Wolfgang Jeltsch wrote: Am Montag, 30. Januar 2006 19:33 schrieb Isaac Jones: [...] Have you looked at the Helium language / compiler? It's a stripped-down version of Haskell for teaching. Maybe that's what you're actually suggesting? I think this is a great idea :) I think the current Helium version causes too many problems because of the lack of type classes since type classes are normally used even with very fundamental things like numbers and value-to-string conversion. To be fair, the current version of Helium does support some overloading, but you cannot (easily) define new classes and instance (you'd have to compile these in, more or less). From the Helium docs: # There are five built-in type classes with the following instances: * Num: Int, Float * Eq: Bool, Char, Either a b, Float, Int, Maybe a, [a] and tuples * Ord: Bool, Char, Float, Int, [a] and tuples * Show: Bool, Char, Either a b, Float, Int, Maybe a, Ordering, [a] and tuples * Enum: Bool, Char, Float, Int and () # Instances for Show and Eq (and not for other classes) can be derived for data types. These instances are needed to use overloaded functions, such as show and (==) # There is no overloading of numerals It is high on my wishlist for Helium to have these in the language. Personally, I find the idea of a scaled down language for teaching a good one, although it would be nice to be able to integrate various versions of the compiler into a single compiler. I also think the type inference directives and class directives could go a long way in making a full-fledged compiler for Haskell, student suited. For instance, I can imagine that a a slight generalization of (our) type inference directives (using decision trees instead of simple messages) can deal with the problem of monad comprehensions versus list comprehensions at a relatively high level. But maybe I am sketching too rosy a picture here, since I almost forgot that list comprehension introduce new bindings, and at the moment type inference directives do not allow scope changes. cheers, Jurriaan Hage peace, isaac Best wishes, Wolfgang ___ Haskell-prime mailing list Haskell-prime@haskell.org http://haskell.org/mailman/listinfo/haskell-prime ___ Haskell-prime mailing list Haskell-prime@haskell.org http://haskell.org/mailman/listinfo/haskell-prime
[Haskell] Ph D position available at University Utrecht
Hello, we have a Ph D position available, to be filled as soon as possible, but May 1st at the latest. The topic is the Top library and its use in making program analyses, like type inferencing, scriptable. Send this e-mail on to anyone you think might apply. This is a link to a more complete description, http://www.cs.uu.nl/vacatures/62411.html regards, Jurriaan Hage ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
