- Haskell - Haskell.org

Keeping input separate from output?
by ihope 27 May '06

27 May '06

I realized that my work on EagleBot has been stuck because of the fact that the program spontaneously outputting, say, "Foo!" while you're typing can result in stuff like "Lorem ipsum doFoo!lor sit amet." How would I keep the "Foo!" from conflicting with the "Lorem ipsum dolor sit amet."?

2 1

Cabal and dynamically generated files
by David House 26 May '06

26 May '06

Hi all. In order to compile the Main.hs for my program, you first need to compile the BuildMain.hs, then run it (it will create a Main.hs). This is easy with Makefiles, however, I'd quite like to use Cabal for its Windows support and dependency handling. This might not be easy, but could it be done? How would I go about it? -- -David House, dmhouse(a)gmail.com

2 1

installing streams library
by Chad Scherrer 26 May '06

26 May '06

It sounds like Bulat has gotten some impressive I/O speedups with his Streams library. I'd like to try this out, but I'm having some trouble installing it. I'm using GHC on Linux. My first attempt was looking around on this page: http://www.haskell.org/haskellwiki/Library/Streams There's a really nice description, but no signs of where to actually get the library. Eventually (thanks to Google) I tracked down this message: http://article.gmane.org/gmane.comp.lang.haskell.general/13625 >From here I was able to download it, but there's no information regarding how this needs to be set up. There are directories "Data", "Examples", and "System", which I assume are supposed to be plugged into the hierarchical module structure, but how do I do that? I thought this might have something to do with Cabal (I've not yet used that), but the Cabal manual talks about a .cabal file, which doesn't exist here. Does this follow some standard approach that I'm not familiar with? Where should I look to learn more? Thanks, -- Chad Scherrer "Time flies like an arrow; fruit flies like a banana" -- Groucho Marx

14 19

call for paper: workshop on constraints and security
by Stefano Bistarelli 25 May '06

25 May '06

-------------------------------------------------------------------- Call for Papers: CPSec 2006 2nd International Workshop on Applications of Constraint Satisfaction and Programming to Computer Security September 25, 2006 Nantes, France Held in conjunction with 12th International Conference on Principles and Practice of Constraint Programming, CP2006 http://www.sci.unich.it/~bista/organizing/cpsec/ -------------------------------------------------------------------- Constraint Satisfaction and Programming is emerging as an effective and practical approach for solving large complex problems. It offers a significant body of successful techniques for verifying system properties. Recently, researchers have begun using advances in constraint programming and solving to solve security problems, with success. This workshop seeks to act as a catalyst for this emerging area by exploring the challenges and the potential that these techniques may offer when applied to security problems. The use of Constraint Satisfaction and Programming to address security problems is recent, and it has already produced a number of novel solutions and insights. For example, constraints have been successfully used in the the analysis of security protocols, the development of access control models and mechanisms, firewall configuration and secure system configuration in general. Workshop topics include (but are not limited to): Access Control Database Security Security Trade-offs Information Flow Integrity Configuration Management Security Models Reliability Security Protocols Intrusion Detection Applications Risk Analysis Trust Software Security Trust Negotiation Submissions The workshop aim is to provide a forum where researchers currently working in the area of security and constraints can discuss their most recent ideas and developments and think together about the most promising new directions. Therefore we encourage the presentation of work in progress or on specialized aspects of the area. Papers that bridge the gap between theory and practice are especially welcome. Prospective attendees can submit a paper, which can be up to 15 pages in length. We encourage authors to submit papers electronically in postscript or pdf format. Papers should be formatted using the Lecture Notes in Computer Science (LNCS) style. At least one author of each accepted submission must attend the workshop, and all participants must pay the workshop fee. Please send your submissions by email to stefano.bistarelli(a)iit.cnr.it using the subject line "cpsec-2005 Workshop Submission". Important Dates Paper Submission deadline: June 24 Notification of acceptance: July 22th Early registration deadline: August 1st Camera-ready version deadline: August 5th Workshop Date: September 25, 2006. Workshop Organizers: Giampaolo Bella (Universit`a di Catania, Italy) Stefano Bistarelli (Università degli studi "G. D'Annunzio" di Chieti-Pescara & C.N.R. Pisa, Italy) Simon Foley (University College Cork, Ireland) Fred Spiessens (University College Cork, Ireland) Program Committee: Giampaolo Bella, Catania Fabio Martinelli, CNR Stefano Bistarelli, Pescara and CNR Barry O'Sullivan, Cork Yannick Chevalier, IRIT Justin Pearson, Uppsala Giorgio Delzanno, Genova Michael Rusinowich, LORIA Alessandra Di Pierro, Pisa Fred Spiessens, Cork Fabio Fioravanti, Pescara, Vitaly Shmatikov, Texas Simon Foley, Cork Frank D. Valencia, CNRS John Herbert, Cork Luca Vigano, Zurich Ralf Küsters, Kiel Duminda Wijesekera, GMU Herbert Wiklicky, Imperial

1 0

Interfacing to OLE/COM: HaskellDirect the only game in town?
by Alistair Bayley 25 May '06

25 May '06

I want to use some MS Windows OLE/COM libraries from Haskell, and this page: http://www.haskell.org/haskellwiki/Libraries_and_tools/Interfacing_other_la… and Google suggest that HaskellDirect is the only game in town. Is this the case? And, does anyone have recent experience of it? Is it still usable, or has it bit-rotted? Alistair

3 2

GHC on Intel Mac
by Thomas Davie 24 May '06

24 May '06

Hi, I was just wondering what the status of porting GHC to intel mac was these days? I've finally beaten Apple into submission, and got them to replace my broken iBook with a MacBook, so a nice fast version would be nice. Bob

2 1

ANNOUNCE: Google Summer of Code Projects
by dons＠cse.unsw.edu.au 24 May '06

24 May '06

We are very pleased to announce that nine Haskell projects have been selected to receive funding to the value of $45k under Google's 2006 Summer of Code program. A wide range of projects will be worked on, contributing to the community important tools and libraries. The students have until August 21 to complete their projects, and receive their grants. The Haskell.org team of mentors would like to thank Google for recognizing the importance of supporting the Haskell language and community. This year was extremely competitive, with over 110 Haskell project submissions. Of these, 38 projects received high scores and willing mentors, and 66 received positive reviews overall. We hope that many of the unsuccessful projects will be worked on nonetheless. The following projects were successful. Congratulations to these students! * Fast Mutable Collection Types for Haskell, Caio Marcelo de Oliveira Filho, Mentor: Audrey Tang * Port Haddock to use GHC, David Waern, Mentor: Simon Marlow * A model for client-side scripts with HSP, Joel Bj�rnson, Mentor: Niklas Broberg * GHCi based debugger for Haskell, Jos� Iborra L�pez, Mentor: David Himmelstrup * HaskellNet, Jun Mukai, Mentor: Shae Erisson * Language.C - a C parser written in Haskell, Marc Ernst Eddy van Woerkom, Mentor: Manuel Chakravarty * Implement a better type checker for Yhc, Mathieu Boespflug, Mentor: Malcolm Wallace * Thin out cabal-get and integrate in GHC, Paolo Martini, Mentor: Isaac Jones * Unicode ByteString, Data.Rope, Parsec for generic strings, Spencer Janssen, Mentor: Don Stewart We wish the students good luck and good hacking! The Haskell.org Team.

3 3

TypeCasting in Haskell
by Christophe Poucet 24 May '06

24 May '06

Dear all, I typically use indirect composite for making AST's. It allows me to easily make new types with other annotations without having to duplicate all elements but only those that actually change. It also allows a whole amalgam of other possibilities. Recently I have observed a type error which seems to be fixable only by doing a "typecast". What do I call a typecast, you may ask? Basically a noop that changes the type. Here attached you will find the code that demonstrates this. > module TypeCast where > > data FooBar foo bar = --- Indirect composite > Foo { unFoo :: foo} > | Bar { unBar :: bar} > > --- Assume some PFoobar (parsed) > data PFooBar = PF {unPF :: FooBar String String} > --- Assume some TFoobar (typed) > data TFooBar = TF {unTF :: FooBar Int String } > > -- Merrily we write our conversion, using binding to optimize slightly > typer :: PFooBar -> TFooBar > typer pFooBar = > case unPF pFooBar of > f@Foo { unFoo = foo} -> -- We only need to change foo > TF $ f{unFoo = 1} > b@Bar { unBar = bar} -> -- We don't need to change this string > TF $ b -- So we just return b > > --- Nice little main to make this a full module: > main :: IO () > main = do > print . typer . PF . Foo $ "Hello" > > --- Type error: > -- TypeCast.hs:19:11: > -- Couldn't match `Int' against `String' > -- Expected type: FooBar Int String > -- Inferred type: FooBar String String > -- In the second argument of `($)', namely `b' > -- In a case alternative: (b@Bar {unBar = bar}) -> TF $ b > > --- what is the fix? Basically do a noop on b > --- b@Bar {unBar = bar} -> > --- TF $ b{unBar = bar} > Cheers, Christophe -- Christophe Poucet Ph.D. Student Phone:+32 16 28 87 20 E-mail: Christophe (dot) Poucet (at) imec (dot) be Website: http://notvincenz.com/ IMEC vzw – Register of Legal Entities Leuven VAT BE 0425.260.668 – Kapeldreef 75, B-3001 Leuven, Belgium – www.imec.be *****DISCLAIMER***** This e-mail and/or its attachments may contain confidential information. It is intended solely for the intended addressee(s). Any use of the information contained herein by other persons is prohibited. IMEC vzw does not accept any liability for the contents of this e-mail and/or its attachments. **********

1 0

FLoC'06 -- Call for Participation
by Kreutzer + Schweikardt 23 May '06

23 May '06

Call for Participation --- FLoC'06 The 2006 Federated Logic Conference Seattle, Washington, USA August 10 -- August 22, 2006 http://www.easychair.org/FLoC-06/ We are pleased to announce the fourth Federated Logic Conference (FLoC'06) to be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.easychair.org/FLoC-06/floc-hotel.html) FLoC'06 promises to be the premier scientific meeting in computational logic in 2006. The following conferences will participate in FLoC'06: CAV Conference on Computer Aided Verification (Aug 17-20) ICLP Int'l Conference on Logic Programming (Aug 17-20) IJCAR Int'l Joint Conference on Automated Reasoning (Aug 17-20) LICS IEEE Symposium on Logic in Computer Science (Aug 12-15) RTA Conference on Rewriting Techniques and Applications (Aug 12-14) SAT Int'l Conference on Theory and Applications of Satisfiability Testing (Aug 12-15) The six major conferences will be accompanied by 41 workshops, held on Aug. 10-11, 15-16, and 21-22. The FLoC'06 program includes a keynote session to commemorate the Goedel Centenary, with John Dawson and Dana Scott as speakers, a keynote talk by David Harel, plenary talks by Randy Bryant and David Dill, and invited talks by F. Bacchus, A. Blass, B. Buchberger, A. Darwiche, M. Das, J. Esparza, J. Giesl, A. Gordon, T. Hoare, O. Kupferman, M. Lam, D. Miller, K. Sakallah, J. Stoy, and C. Welty. FLoC has received an NSF grant to provide funds for travel grants of up to $750 for student attendees of FLoC'06. We expect to award about 50 grants. See application information on the website. Seattle, the Emerald city, sits on the shores of Puget Sound surrounded by mountains to the east and west. Lovely views of blue waters and snow capped peaks seem to appear everywhere - around the next bend in the road or between the buildings downtown. Seattle is the gateway to the Pacific Northwest, a premier tourist attraction. In Seattle, Mt. Rainier enchants visitors; in Vancouver, British Columbia, the Coast Range juts out over downtown; and in Portland, 5,000 acres of forestland north of the city center harbor deer, elk, and the odd bear and cougar. Online registration for FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for preferred hotel rate is June 21, 2006. Deadline for early registration is July 10, 2006. FLoC'06 Steering Committee Moshe Y. Vardi (General Chair) Thomas Ball (Conference Co-Chair) Jakob Rehof (Conference Co-Chair) Edmund Clarke (CAV) Reiner Hahnle (IJCAR) Manuel Hermenegildo (ICLP) Phokion Kolaitis (LICS) Henry Kautz (SAT) Aart Middeldorp (RTA) Andrei Voronkov (IJCAR)

1 0

Final CFP: Scheme & Functional Programming Workshop 2006
by Robby Findler 23 May '06

23 May '06

Dear all, Just one last reminder that the Scheme and Functional programming workshop's deadline is fast approaching. Only a little more than two weeks to go. Do submit! Best, Robby ============================================================ The purpose of the workshop is to discuss experience with and future developments of the Scheme programming language, as well as general aspects of computer science loosely centered on the general theme of Scheme. http://scheme2006.cs.uchicago.edu/ IMPORTANT DATES Submission deadline: Friday June 9 Author notification: Friday June 30 Final versions due: Friday July 14 Workshop: Sunday September 17, the day before ICFP CALL FOR PAPERS Papers are invited concerning all aspects of the design, semantics, theory, application, implementation, and teaching of Scheme. Some example areas include (but are not limited to): * Language design Scheme's simple syntactic framework and minimal static semantics has historically made the language an attractive lab bench for the development and experimentation of novel language features and mechanisms. Topics in this area include modules systems, exceptions, control mechanisms, distributed programming, concurrency and synchronisation, macro systems, and objects. Past, present and future SRFIs are welcome. * Type systems Static analyses for dynamic type systems, type systems that bridge the gap between static and dynamic types, static systems with type dynamic extensions, weak typing. * Theory Formal semantics, calculi, correctness of analyses and transformations, lambda calculus. * Implementation Compilers, runtime systems, optimisation, virtual machines, resource management, interpreters, foreign-function and operating system interfaces, partial evaluation, program analysis and transformation, embedded systems, and generally implementations with novel or noteworthy features. * Program-development environments and tools The Lisp and Scheme family of programming languages have traditionally been the source of innovative program-development environments. Authors working on these issues are encouraged to submit papers describing their technologies. Topics include profilers, tracers, debuggers, program understanding tools, performance and conformance test suites and tools. * Education Scheme has achieved widespread use as a tool for teaching computer science. Papers on the theory and practice of teaching with Scheme are invited. * Agile Methogologies Dynamic languages seem to share a symbiotic relationship with agile software development methodologies. In particular, the dynamic type checking of Scheme clearly benefits from test-driven development, but that same dynamic checking makes the software more easily adapted to changing requirements. * Applications and experience Interesting applications which illuminate aspects of Scheme experience with Scheme in commercial or real-world contexts; use of Scheme as an extension or scripting language. * Scheme pearls Elegant, instructive examples of functional programming. A Scheme pearl submission is a special category, and should be a short paper presenting an algorithm, idea or programming device using Scheme in a way that is particularly elegant. Following the model of earlier workshops, experience papers need not necessarily report original research results; they may instead 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! ORGANIZERS Program Chair Robby Findler, University of Chicago Program Committee John Clements, Cal Poly Sebastian Egner, Philips Research Robby Findler, University of Chicago Cormac Flanagan, UC Santa Cruz Erik Hilsdale, Google Eric Knauel, University of Tubingen Steering Committee William D. Clinger, Northeastern University Marc Feeley, University of Montreal Robby Findler, University of Chicago Dan Friedman, Indiana University Christian Queinnec, University Paris 6 Manuel Serrano, INRIA Olin Shivers, Georgia Tech Mitchell Wand, Northeastern University

1 0