- Haskell - Haskell.org

CHARME 2003
by Tronci Enrico 06 Feb '03

06 Feb '03

---------------------------------------------------------------------- We apologize if you receive multiple copies of this announcement. ---------------------------------------------------------------------- *********************************************************************** C A L L F O R P A P E R S *********************************************************************** CHARME 2003 The 12th Advanced Research Working Conference on: Correct Hardware Design and Verification Methods 21-24 October 2003, University of L'Aquila, L'Aquila, Italy http://www.di.univaq.it/charme2003 Co-sponsored by the IFIP TC10/WG10.5 Working Group on Design and Engineering of Electronic Systems CHARME 2003 is the twelfth in a series of working conferences devoted to the development and use of leading-edge formal techniques and tools for the design and verification of hardware and systems. It has been the aim of the conference to expand its interest to software as well when the technology is related. Previous conferences have been held in Darmstadt, Edinburgh, Grenoble, Glasgow, Leuven, Torino, Arles, Frankfurt, Montreal, and Bad Herrenalb, and Edinburgh. It is the biennial counterpart of FMCAD, which takes place every even year in the USA. The aim of CHARME 2003 is to bring together researchers and users from academia and industry working in this active area of research. The conference will cover original research results, case studies, use of technologies across application domains, and reports on practical experiments. Papers describing original work in all aspects of formal hardware and system design and verification methods are invited. Papers related to formal modeling and verification of concurrent software are also welcome. The event will be held 21-24 October 2003 and hosted by University of L'Aquila, Italy. L'Aquila can be easily reached from Rome Airport. Topics of interest include, but are not limited to: * usage of semi-formal methods (combining simulation methods with formal verification) * high level design modeling languages and high level design constructs * formal verification of hybrid systems * timing verification * formal methods for commercial hardware description languages * correctness preserving transformations * formal synthesis methods * use of theorem provers for verification * BDD and FSM based approaches, including model checking and SAT checking * correctness aspects in HW/SW co-design * abstraction and compositional techniques * formal verification of protocols * diagnosis of design errors * coverage directed verification and other semi-formal verification methods * use of formal specification languages in simulation * formal verification of concurrent software * practical and industrial applications of formal techniques The conference proceedings will appear as a volume in Springer-Verlag's Lecture Notes in Computer Science series and will be available at the conference. Papers should not exceed 15 pages, formatted as specified by Springer-Verlag in the Authors Instructions page, and submitted electronically following the procedure given on the submissions page of the conference website, http://www.di.univaq.it/charme2003. Selected contributions may be invited for publication in STTT (International Journal on Software Tools for Technology Transfer, Springer-Verlag). ****************************************************************************** Author's Schedule: * 11 April 2003 - Deadline for paper submission * 6 June 2003 - Notification of acceptance * 11 July 2003 - Deadline for final version ****************************************************************************** Chairs Enrico Tronci (conference chair) (University of Rome, Italy) Daniel Geist (programme chair) (IBM, Israel) ****************************************************************************** Programme Committee Alan Hu (University of British Columbia, Canada) Alan Mycroft (University of Cambridge, UK) Anna Slobodova (Intel, USA) Armin Biere (Swiss Federal Institute of Technology, Switzerland) Byron Cook (Microsoft Corporation, USA) Carl Pixley (Synopsys, USA) Daniel Geist (PC Chair) (IBM, Israel) Dominique Borrione (University of Grenoble, France) Eli Singerman (Intel, Israel) Enrico Tronci (Conference Chair) (University of Rome, Italy) Ganesh Gopalakrishnan (University of Utah, USA) Hans Eveking (T.U. Darmstadt, Germany) John O'Leary (Intel, USA) Ken McMillan (Cadence, USA) Laurence Pierre (University of Marseille, France) Limor Fix (Intel, Israel) Mark Aagaard (University of Waterloo, Canada) Mary Sheeran (Chalmers Univ. and Prover Technology, Sweden) Moshe Vardi (Rice University, USA) Ofer Strichman (Carnegie-Mellon University, USA) Steve Johnson (Indiana University, USA) Thomas Kropf (Bosch, Germany) Tiziana Margaria (Univ. of Dortmund and METAFrame Techn., Germany) Tom Melham (University of Oxford,UK) Warren Hunt (University of Texas at Austin, USA) ******************************************************************************

1 0

ICFP 2003 Call for Papers -- deadline extended
by shivers＠ai.mit.edu 06 Feb '03

06 Feb '03

The submission deadline for ICFP (the ACM SIGPLAN International Conference on Functional Programming) has been extended by nine days to March 29 (2300 UTC). The 2003 ICFP will be in Uppsala, Sweden on August 25-29, in conjunction with PPDP (Principles and Practice of Declarative Programming). Please take a moment to read the "call for papers" I've appended below, and see if you have a topic or result you would like to submit to the program committee. See you in Sweden. -Olin Shivers program chairman =============================================================================== Eighth Annual ACM SIGPLAN International Conference on Functional Programming ICFP 2003 Call for Papers (Revised 2003/2/5) Affiliated with PLI 2003 August 25-29, 2003 Uppsala, Sweden http://www-users.cs.york.ac.uk/~colin/icfp2003.html http://www.cc.gatech.edu/icfp03/cfp.html ------------------------------------------------------------------------------- * Important dates ----------------- Submission deadline 18:00 EST 29 March, 2003 (Thursday) Notification of acceptance rejection 19 May, 2003 Final paper due 16 June, 2003 Conference 25-29 August, 2003 * Scope ------- ICFP 2003 seeks original papers on the full spectrum of the art, science, and practice of functional programming. The conference invites submissions on all topics ranging from principles to practice, from foundations to features, and from abstraction to application. The scope covers all languages that encourage programming with functions, including both purely applicative and imperative languages, as well as languages that support objects and concurrency. Topics of interest include, but are not limited to, the following: Foundations formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. Design Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming, multiparadigm programming. Implementation abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. Transformation and analysis abstract interpretation, partial evaluation, program transformation, theorem proving, specification and verification. Software development techniques for functional programming design patterns, specification, verification and validation, debugging, test generation, tracing and profiling. Applications and domain-specific languages systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, systems programming, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems construction, web programming. Practice and experience functional programming in education and industry, ramifications on other paradigms and computing disciplines. Functional pearls elegant, instructive examples of functional programming. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! * Submission guidelines ----------------------- Due date & time: Submissions must be filed at the web site by 18:00 EST on Thursday 29 March. Some convenient equivalents to 18:00 EST are New York: 6:00 PM = 18h00 San Francisco: 3:00 PM = 15h00 Chicago: 5:00 PM = 17h00 Paris: Midnight Hong Kong: 7:00 AM (30 March) UTC: 2300 For other time-zones/locations, see http://www.timeanddate.com/worldclock/fixedtime.html Submission URL: http://www.cc.gatech.edu/icfp03/submit Authors should submit a 100-200 word abstract and a full paper by 23:00 Universal Coordinated Time on Thursday, March 29, 2003. Submissions should be no more than 12 pages (including bibliography and appendices) in standard ACM conference format: two columns, nine-point font on a ten-point baseline, with pages 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). Detailed formatting guidelines are available at http://www.acm.org/sigs/pubs/proceed/template.html, along with formatting templates or style files for LaTeX, Word Perfect, and Word. You don't need to include categories, keywords, etc., though you are welcome to do so. Also, note that the ACM copyright notice is not required of submissions, only of accepted papers. Authors wishing to supply additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices, on the understanding that reviewers are not required to read the appendices. Submissions that do not meet these guidelines will not be considered. The submission deadline and length above are firm. Submissions will be carried out electronically via the Web, at the URL given above. Papers must be submitted in either PDF format, or as PostScript documents that are interpretable by Ghostscript, and they must be printable on US Letter sized paper. Individuals for which this requirement is a hardship should contact the program chair at least one week before the deadline. Submitted papers must have content that has not previously been published in other conferences or refereed venues; simultaneous submission to other conferences or refereed venues is unacceptable. Each paper should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, saying why it is significant, and comparing it with previous work. Authors should strive to make the technical content of their papers understandable to a broad audience. Authors of accepted papers will be required to sign the ACM copyright form. Proceedings will be published by ACM Press. * Student Attendees ------------------- Students who have a paper accepted for the conference are offered student membership of SIGPLAN free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund. * Conference Chair ------------------ Colin Runciman University of York, UK * Program Chair --------------- Olin Shivers College of Computing Georgia Institute of Technology Atlanta, Ga. 30332-0280, USA shivers at cc.gatech.edu Phone: +1 404 385.00.91 Fax: +1 404 383.12.53 * Program Committee ------------------- Andrzej Filinksi (DIKU, University of Copenhagen) Robby Findler (University of Chicago) Fritz Henglein (IT University of Copenhagen) Hugo Herbelin (INRIA) Ralf Hinze (Universitat Bonn) Annie Liu (Stony Brook University) Benjamin Pierce (University of Pennsylvania) Todd Proebsting (Microsoft Corp.) Amr Sabry (University of Indiana) Zhong Shao (Yale University) Tim Sheard (OGI School of Science and Engineering) Eijiro Sumii (University of Tokyo) * Change log ------------ 2003/2/5 Added program committee; revised submission deadline from 3/20 to 3/29; updated student travel-fellowship information.

1 0

Re: Looking for large Haskell programs
by Tobias Gedell 05 Feb '03

05 Feb '03

> GHC is such a program, as are the other Haskell compilers. Perhaps too > complicated for your purposes, though. GHC has too many mutually recursive modules to be useful, otherwise it would be great! But I will look more into the other compilers, are they written in Haskell?, thanks for the suggestion! > I can give you a few ~5000-10000 line programs if you want. I don't quite > have anything as large as 15000 lines, though. I have quite many 5-10k programs, but thanks anyway! I really need programs with more than 15000 lines of code. //Tobias

3 2

Looking for large Haskell programs
by Tobias Gedell 04 Feb '03

04 Feb '03

Hi, I'm looking for large haskell programs with more than 15000 lines of code. Does any of you know where I can find such programs? The programs found in the nofib suite are not large enough. //Tobias

3 2

RE: [OT] Teaching Haskell in High School (fwd)
by Rex Page 04 Feb '03

04 Feb '03

On Tue, 4 Feb 2003, David Bergman wrote: > Rex wrote: > > > This matches my experience, too. When I've taught Haskell to > > first year college students, there have always been some hard > > core hackers who've been at it in C or VB or Perl or > > something like that for years, and they rarely take kindly to > > Haskell. The ones without any programming background do better. > > > > I think Haskell would be great for a high school math class. > > They could learn some logic and induction along with it, and > > get a few proofs back into the high school math curriculum. > > > > Rex Page > > I have always had that same experience with any (more or less) > declarative language. BUT, as soon as the "hackers" (well, maybe not VB > programmers, they are kind of doomed...) have passed the initial > frustration, and acquired the "new way of thinking", they actually > perform much better than the real beginners. > > /David Yes, I've seen the same thing with some of the people who come in with experience. Some are lost, but a few of them really embrace the expressiveness of a language like Haskell. Rex > > > > ---------- Forwarded message ---------- > > Date: Tue, 04 Feb 2003 03:03:03 +0100 > > From: Wolfgang Jeltsch <wolfgang(a)jeltsch.net> > > To: The Haskell Mailing List <haskell(a)haskell.org> > > Subject: Re: [OT] Teaching Haskell in High School > > > > On Tuesday, 2003-02-04, 01:01, CET, Hal Daume wrote: > > > [...] > > > > > However, I'm also well aware that Haskell is very difficult > > to learn > > > (and, I'd imagine, to teach). > > > > Hi, > > > > I wouldn't claim that Haskell is very difficult to learn. I > > think, people > > often have problems with learning Haskell because they know > > imperative > > programming and try to apply their imperative thinking to > > programming in > > Haskell. > > > > Some months ago, a first year student told me that she liked > > Haskell very much > > and that she didn't find it very difficult. I asked her if > > she had had > > experiences with other programming languages before learning > > Haskell. She > > answered: "No." > > > > > [...] > > > > Wolfgang > > _______________________________________________ > > Haskell mailing list > > Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell > > > > _______________________________________________ > > Haskell mailing list > > Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell > > > >

1 0

Re: seeking ideas for short lecture on type classes
by Norman Ramsey 04 Feb '03

04 Feb '03

> > In a fit of madness, I have agreed to deliver a 50-minute lecture > > on type classes to an audience of undergraduate students. These > > students will have seen some simple typing rules for F2 and will > > have some exposure to Hindley-Milner type inference in the context > > of ML. > > Will they have had exposure to more "traditional" OO programming? If > so, it might be useful to note the difference between Haskell type > classes and C++/Java/whatever classes, namely that Haskell decouples > types and the interfaces that they support. The advantage is that you > can extend a type with a new interface at any point, not just when you > define the type. Hmm --- you are talking about the `instance' declarations, right? A fact that I know but don't understand the implication of is that Haskell dispatches on the static type of a value, whereas OO languages dispatch on the dynamic type of a value. But I suspect I'll leave that out :-) N

8 8

Re: [OT] Teaching Haskell in High School (fwd)
by Rex Page 04 Feb '03

04 Feb '03

This matches my experience, too. When I've taught Haskell to first year college students, there have always been some hard core hackers who've been at it in C or VB or Perl or something like that for years, and they rarely take kindly to Haskell. The ones without any programming background do better. I think Haskell would be great for a high school math class. They could learn some logic and induction along with it, and get a few proofs back into the high school math curriculum. Rex Page ---------- Forwarded message ---------- Date: Tue, 04 Feb 2003 03:03:03 +0100 From: Wolfgang Jeltsch <wolfgang(a)jeltsch.net> To: The Haskell Mailing List <haskell(a)haskell.org> Subject: Re: [OT] Teaching Haskell in High School On Tuesday, 2003-02-04, 01:01, CET, Hal Daume wrote: > [...] > However, I'm also well aware that Haskell is very difficult to learn (and, > I'd imagine, to teach). Hi, I wouldn't claim that Haskell is very difficult to learn. I think, people often have problems with learning Haskell because they know imperative programming and try to apply their imperative thinking to programming in Haskell. Some months ago, a first year student told me that she liked Haskell very much and that she didn't find it very difficult. I asked her if she had had experiences with other programming languages before learning Haskell. She answered: "No." > [...] Wolfgang _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell

2 1

RE: [OT] Teaching Haskell in High School
by Simon Peyton-Jones 04 Feb '03

04 Feb '03

Don't forget Helium (recently announced) http://www.cs.uu.nl/~afie/helium/index.html Also Manuel Chakravarty teaches Haskell to hordes. Simon | -----Original Message----- | From: Hal Daume III [mailto:hdaume@ISI.EDU] | Sent: 04 February 2003 00:02 | To: Haskell Mailing List | Subject: [OT] Teaching Haskell in High School | | Hi all, | | Before getting in to this, let me preface my question(s) with a note that | I have checked through the Haskell in Education web page and have found | various links off there of interest (and I've googled, etc. In | short: I've done my homework). | | That said, I've been in rather close correspondence with my math/computer | science teacher from high school. When I first took CS there, they taught | Pascal (a year early they had been teaching Scheme). They switched over | to VB (alas) recently and have been teaching that for a few years now. | | The teacher really wants to get away from VB, but is having a somewhat | difficult time deciding what to go to. The two most promising options are | Haskell and Java. | | Aside from hype, etc., the primary advantage to Java is that the Advanced | Placement (AP) tests are in Java. For those of you unfamiliar with these, | high school students can take AP tests and then (typically) skip out of | first semester college courses. They're essentially proficiency exams. | | The way the computer science curriculum is set up at my old school is | essentially as either (a) an elective or (b) a replacement for senior year | math. The students in the course are usually about 2/3 juniors (16 year | olds) taking it as an elective and 1/3 seniors who want to get our of | senior year math :). Either way, they've both taken differential | calculus, algebra, etc. Note, however, that high school math in the | states is very rudimentary when it comes to things like "induction" and | "proofs" and things of this sort. | | Due to the fact that CS is essentially an alternative math course, I think | it would be interesting to teach Haskell. It would enable the instruction | of things the students wouldn't have come across in their ordinary math | studies, etc. | | However, I'm also well aware that Haskell is very difficult to learn (and, | I'd imagine, to teach). Given that this would in large part be a first | language for them and that they won't have a college-level math | background, do you think it would be too much to attempt to teach Haskell | at this level, and stick with Java? | | I'm really interested in any comments/experience/etc. that people have | that might assist the teacher (and, to some extent, me) make this | decision. | | Thanks in advance! | | - Hal | | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell

1 0

PLC 27: call for participation
by Sophia A. Malamud 04 Feb '03

04 Feb '03

Dear friends and colleagues, Please circulate this announcement and call for registration! We apologise for multiple mailings. ________________________________________________________________________ 27th Penn Linguistics Colloquium ________________________________________________________________________ The 27th Annual Penn Linguistics Colloquium is scheduled for Friday through Sunday, February 21 through 23, 2003 at the University of Pennsylvania campus in Philadelphia. Keynote Lecture: A Compositional Characterization of the Definiteness Effect in Existential-There Sentences Invited Speaker: Professor Edward Keenan of UCLA Panel Discussion: Goffmans Legacy and Future Study of Language Interaction Discussants include: Deborah Shiffrin, William Labov Our program includes sessions on language acquisition, syntax, mathematical linguistics, sociolinguistics, historical linguistics, phonology, pragmatics, psycholinguistics, as well as a Special Session in formal semantics. Schedule of talks and local information are available at the conference website: http://www.ling.upenn.edu/Events/PLC/ ***Online pre-registration form is available now and until February 15th *** at http://www.ling.upenn.edu/Events/PLC/registration/register.php The pre-registration fee is $20 (students $15), on-site registration is $23 (students $18). Please pre-register! Early registration will help us estimate the number of attendees, and help you avoid paying extra $3 for on-site registration. If you have questions or concerns, please contact us at one of the following addresses: The Penn Linguistics Colloquium Committee Department of Linguistics 619 Williams Hall University of Pennsylvania Philadelphia, PA 19104-6305 plc27(a)ling.upenn.edu http://www.ling.upenn.edu/Events/PLC This event is supported by funding from GSAC, the Graduate Student Association Council of University of Pennsylvania. ________________________________________________________________________

1 0

RE: time since the epoch
by George Russell 03 Feb '03

03 Feb '03

Simon PJ wrote (snipped) > Meanwhile, I suspect there's an opportunity for someone (or a small > group) to suggest a new Time library that really does the business, and > provide an implementation. If it's sufficiently persuasive, all the > implementations will adopt it and it can become a de-facto standard. I already have written a TimeExts library which is in fact bundled with GHC, namely in -package lang. What I ought to do, I suppose, is fishify the comments so Haddock can produce something useful. Basically it allows you to add a time difference to a ClockTime value to get another ClockTime value, or subtract two ClockTime values to get a time difference. The time difference can be a number of picoseconds, seconds, minutes, hours, days, months or years. For all but seconds and picoseconds, it does this by converting to CalendarTime (using toUTCTime), doing complicated Gregorian calendar calculations (I am not proud of the code here), and then converting back using toClockTime. This is probably not a very good way of doing it but at least no-one has complained about it so far. Which means either it's perfect or no-one uses it, I fear the latter. At least it might be a good idea to start with something like this code, rather than reinventing the wheel. Things you need to watch out for are (a) leap seconds; (b) time zones. I didn't really address the time zone problem, instead doing everything in UTC. For us Europeans, it doesn't normally make any difference whether you use local or UTC time when you ask for the date one month from now.

1 0