- Haskell - Haskell.org

Using newArray with hGetArray
by Andre Pang 24 May '05

24 May '05

Hi all, I have the following snippet of code: mutableMemoryArray <- newArray_ (0, bufferSize - 1) bytesRead <- hGetArray handle mutableMemoryArray bufferSize The problem is that hGetArray (like hGetBuf) may read less than the amount that you specify (since you may hit EOF before filling up the whole array). If this happens, the mutableMemoryArray array has a bounds which is greater than it should be. This is quite bad if, say, you hPutArray the array to another writable Handle. e.g. if bufferSize is 4096, and the input file is 4100 bytes long, the code will properly read 4096 bytes on the first pass, but only 4 bytes on the second pass; yet the bounds of the array will still be 4096 bytes in both cases, rather than 4096 and 4. You can't simply swap the two expressions since you don't know how many bytes you've read until you execute hGetArray, and you can't execute hGetArray until you allocate the array, which requires that you know the array bounds. Chicken-and-egg. Am I missing something obvious here? I'd even be happy if there was some way to adjust the bounds on a mutable array after it's been created, or even if I could use hGetBuf and somehow efficiently create an array from a (Ptr Word8). I know I could simply re- allocate another array and garbage collect the first one if bytesRead /= bufferSize, but that seems pretty inelegant. Thanks! -- % Andre Pang : trust.in.love.to.save <http://www.algorithm.com.au/>

2 2

1st Int. Workshop on Applications of Constraint Satisfaction and Programming to Computer Security (CPSec)
by Stefano Bistarelli 23 May '05

23 May '05

(apologizes for multiple copies) =================================================================================== 1st International Workshop on Applications of Constraint Satisfaction and Programming to Computer Security (CPSec) October 1st, 2005 Barcelona, Spain Held in conjunction with 11th International Conference on Principles and Practice of Constraint Programming, CP2005 http://www.sci.unich.it/~bista/organizing/cpsec/ ==================================================================================== Call for Paper ==================================================================================== Constraint Satisfaction and Programming is emerging as an effective 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): * security models * information flow * trust management * database security * data and system integrity * security protocols * security configuration * access control * secure applications * security trade-offs 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. Please send your submissions by email to stefano.bistarelli(a)iit.cnr.it using the subject line "cpsec-2005 Workshop Submission". Important Dates The proposed schedule of important dates for the workshop is as follows: Paper Submission deadline June 26th Notification of acceptance July 24th Camera-ready version deadline August 16th Workshop Date October 1st Workshop Organizers: Giampaolo Bella Dipartimento di Matematica e Informatica Universit`a di Catania, Italy Email: giamp(a)dmi.unict.it Web: http://www.dmi.unict.it/~giamp/ and Stefano Bistarelli (Primary Contact) Dipartimento di Scienze Università degli studi "G. D'Annunzio" di Chieti-Pescara, Italy Email: bista(a)sci.unich.it Web: http://www.sci.unich.it/~bista/ and Istituto di Informatica e Telematica C.N.R. Pisa, Italy Email: stefano.bistarelli(a)iit.cnr.it and Simon N. Foley Department of Computer Science University College Cork, Ireland Email: s.foley(a)cs.ucc.ie Web: http://www.cs.ucc.ie/~simon/ and Barry O'Sullivan Cork Constraint Computation Centre University College Cork, Ireland and Department of Computer Science University College Cork, Ireland Email: b.osullivan(a)cs.ucc.ie Web: http://www.cs.ucc.ie/~osullb/ Program Committee: Giampaolo Bella -- Dipartimento di Matematica e Informatica, Universita' di Catania, Italy Stefano Bistarelli -- Universita' degli Studi "G. D'annunzio", Pescara, Italy and IIT-CNR, Pisa, Italy Yannick Chevalier -- Institut de Recherche en Informatique de Toulouse (IRIT), France Giorgio Delzanno -- Dipartimento Informatica e Scienze dell'Informazione, Università di Genova, Italy Alessandra Di Pierro -- Dipartimento di Informatica, University of Pisa, Italy Fabio Fioravanti -- Universita' degli Studi "G. D'annunzio", Pescara, Italy Simon Foley -- Department of Computer Science University College Cork, Ireland John Herbert -- Department of Computer Science University College Cork, Ireland Fabio Martinelli -- Istituto di Informatica e Telematica, CNR, Pisa, Italy Barry O'Sullivan -- Cork Constraint Computation Centre, University College Cork, Ireland Michael Rusinowitch -- INRIA Lorraine, Villers les Nancy, Cedex, France Justin Pearson -- Department of information technology, Uppsala University, Sweden Vitaly Shmatikov -- Department of Computer Sciences, The University of Texas at Austin, USA Fred Spiessens -- U.C.L. Louvain-la-Neuve, Belgium Garret Swart -- I.B.M. Research, USA Peter Van Roy -- Department of Computing Science and Engineering, Catholic University of Louvain, Belgium Luca Vigano -- ETH, Zurich, Switzerland Duminda Wijesekera -- ISE, George Mason University, USA Herbert Wiklicky -- Department of Computing, Imperial College London, UK

1 0

PhD Position
by N Ghani 23 May '05

23 May '05

Please pass on to interested students. Apologies for multiple copies. --------------------------------------------------------------------- PhD Position School of Computer Science and Information Technology University of Nottingham United Kingdom Applications are invited for a PhD position on the recently funded EPSRC project "Theory and Applications of Containers" whose aim is to advance our ability to compute efficiently and correctly with advanced data structures using our recently developed theory of containers. You will join an expanding research group working on these ideas and will have the freedom to explore either more practical or theoretical aspects of the project. Applicants must have a very good undergraduate degree in Mathematics, Computing Science or in a related subject. Interest in functional programming, type theory and/or category theory are most welcome. Applicants must also have a strong interest in doing research. Any interested applicants should contact Dr Neil Ghani at the following address for further information Dr Neil Ghani ng13(a)mcs.le.ac.uk

1 0

PhD in aspect-oriented languages
by Oege de Moor 23 May '05

23 May '05

*** apologies for multiple copies *** The programming tools group at Oxford is pleased to invite applications for a fully funded PhD position in the design and implementation of aspect-oriented programming languages, as part of the abc project. Further details can be found at: http://musketeer.comlab.ox.ac.uk:9673/progtools/studentship

1 0

new to haskell
by wenduan 22 May '05

22 May '05

hi all, I'm new to haskell and just reading the "yet another haskell tutorial".I got stuck on the exercise of chapter 3,the problem goes like "repeatedly prompt the user to input some number until a zero is detected,then output the sum,product of those numbers and the factorial of each number." What I have done is I have an IO action up and running in a module I defined as following: module Main where main = do calculate calculate = do putStrLn "Give me a number (or 0 to stop):" number <- getLine let n = read number if n == 0 then do return [] else do rest <- calculate return (number : rest) Now the question is I couldn't get any clue from the first three chapters to do the remaining calculation,what I wanted to do is to get a list out of the IO action I just defined, and do the sum,product and factorial out of the list,I tried something like"list <- calculate, sum list,etc,but it wasn't helpful,so would anyone just give me any hint to solve this,sorry for those who feel its quite basic. -- ------------------------------------------------------------------------------------------------------- If you didn't succeed at the first attempt, you are just about average.

5 4

Call for Papers for CICLOPS'2005
by Fernando Silva 22 May '05

22 May '05

Please, do accept our apologies if you receive this call more than once. ------------------------------------------------------------------------------- Preliminary Call for Papers ------------------------------------------------------------------ CICLOPS 2005 Colloquium on Implementation of Constraint and LOgic Programming Systems October 5, 2005 Sitges (Barcelona) Spain Satellite workshop of ICLP 2005 ------------------------------------------------------------------ http://www.dcc.fc.up.pt/ciclops05 Topics of interest ------------------ The workshop aims at discussing and exchanging experience on the design, implementation, and optimization of logic and constraint (logic) programming systems, or systems intimately related to logic as a means to express computations. Preference will be given to the analysis and description of implemented (or under implementation) systems and their associated techniques, problems found in their development or design and steps taken towards the solutions. The workshop topics include, but are not limited to: * Implementation of standard/alternative sequential models (generalization and modification of the WAM, translation to lower-level and/or general-purpose languages, etc); * Implementation of parallel/concurrent models; * Interaction between high-level optimisations/transformations and low-level issues; * Compile-time analysis and its application to code generation; * Balance between compile-time effort and run-time machinery; * Memory management, indexing, and garbage collection issues; * Profiling tools and performance evaluation; * Implementation techniques for declarative programming paradigms with basis on, or extending, logic and constraint programming, such as non-monotonic reasoning, inductive logic programming, natural language processing systems, etc; * Software design with and for LP/CP systems: components, patterns, etc; * Design and implementation of programming environments; * Experiences from using systems in real-life applications. Workshop Relevance ------------------ The last years have witnessed continuous progress in the technology available both for academic and commercial computing environments. Examples include improved processor performance, increased memory capacity and bandwidth, faster networking technology, and operating system support for cluster computing. These improvements, combined with recent advances in compilation and implementation technologies, are causing high-level languages to be regarded as good candidates for programming complex, real world applications. Logic Programming and Constraint Programming, in particular, seem to offer one of the best options, as they couple a high level of abstraction and a declarative nature with an extreme flexibility in the design of their implementations and extensions and of their execution model. This flexibility is the key to, for example, the implicit exploitation of parallelism, allowing immediate and transparent reuse of logic and constraint programs written for sequential machines, without compromising efficiency. Moreover, implementations which reach good performance in terms of speed and memory consumption make declarative languages and systems amenable to develop non-trivial applications. We hope that the workshop will provide a meeting point and bring together people working on implementation technology for different aspects of logic and constraint-based languages and systems, in order to promote the exchange of ideas and feedback on recent developments. The workshop continues a tradition of successful workshops on Implementations of Logic Programming Systems, previously held with in Budapest (1993), Ithaca (1994) and Portland (1995), the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993 and 1994), Utrecht (1995) and Bonn (1996), the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages held in Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000), and recently the Colloquium on Implementation of Constraint and LOgic Programming Systems in Paphos (2001), Copenhagen (2002), Mumbai (2003), and Saint-Malo (2004), and the CoLogNet Workshops on Implementation Technology for Computational Logic Systems held in Madrid (2002), and Pisa (2003). Submission Information ---------------------- Authors are invited to submit papers written in English and not exceeding 12 pages. Submissions should contain full return mail, email address (if applicable) and fax number (if applicable) of the contact author. To speed up the process of refereeing, authors are requested to submit their paper in Postscript or PDF using a submission form located at the workshop web-page. In order to obtain homogeneous workshop proceedings, authors of accepted papers will be requested to send the sources to the organizers. We strongly encourage the use of LaTeX style files, both in the preparation of submissions and, specially, for the final version (please consult the template and style files located at the workshop web-page to prepare your paper). Authors who wish to prepare papers in formats other than LaTeX are kindly requested to contact the organization beforehand in order to make sure that we have available the right tools to process the files (if needed), or in order to receive detailed format instructions otherwise. Important Dates --------------- Submission deadline: July 1st Notification to authors: July 22nd Camera-ready copy due: August 5th Workshop: October 5th Organization ------------ Program Committee: ------------------ Bart Demoen K. U. Leuven, Belgium Christian Schulte Royal Institute of Technology, Sweden David S. Warren State University of New York, USA Enrico Pontelli New Mexico State Univeristy, USA Fernando Silva University of Porto, Portugal Inês Dutra Federal University of Rio de Janeiro, Brazil Manuel Carro Technical University of Madrid, Spain Mats Carlsson Swedish Institute of Computer Science, Sweden Ricardo Rocha University of Porto, Portugal Vitaly Lagoon University of Melbourne, Australia Warwick Harvey Imperial College, IC-Parc, UK Workshop Coordinators: ---------------------- Christian Schulte Royal Institute of Technology, Sweden Fernando Silva University of Porto, Portugal Ricardo Rocha University of Porto, Portugal Contact: Please address any question regarding the workshop organization to the address ciclops05(a)dcc.fc.up.pt.

1 0

functional dependency violation?
by Conal Elliott 21 May '05

21 May '05

The program below fails to compile under ghc 6.4, giving the following error message: c:/conal/Eros/Haskell/PTest.hs:13:0: Illegal instance declaration for `Path (PCompose po pi) a a' whole whole'' (the instance types do not agree with the functional dependencies of the class) In the instance declaration for `Path (PCompose po pi) a a' whole whole'' Failed, modules loaded: none. I'm stumped. Can anyone explain how this instance violates the functional dependencies? - Conal -- Experimenting with paths and type classes -- whole' is whole with a replaced by a' at p. pathApp applies a function -- at p in whole. class Path p a a' whole whole' | p a a' whole -> whole' , p whole whole' -> a a' where pathApp :: p -> (a -> a') -> whole -> whole' data PCompose a b = PC a b instance (Path pi a a' mid mid', Path po mid mid' whole whole') => Path (PCompose po pi) a a' whole whole' where pathApp (PC po pi) = pathApp po . pathApp pi -- ... other instances

2 1

CFP APLAS'05
by Kwangkeun Yi 21 May '05

21 May '05

Hi all, APLAS 2005's abstract and title submission due is next Saturday. [apologies if you receive this CFP multiple times] ------------------------------------------------------------------------------- CALL FOR PAPERS The Third Asian Symposium on Programming Languages and Systems (APLAS 2005) November 3-5, 2005 Tsukuba, Japan SUBMISSION DEADLINE Abstract & title: 28 May 2005 Full paper submission: 10 Jun 2005 HOMEPAGE: http://ropas.snu.ac.kr/aplas05 APLAS seeks original papers on all topics of programming languages and systems. APLAS aims at stimulating programming language research by providing an international forum for the presentation of original results and the exchange of ideas and experience. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The first two formal APLAS symposiums were successfully held in Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). TOPICS The symposium is devoted to all topics ranging from foundational to practical issues in programming languages and systems. Submissions are invited on, but not limited to, the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments for embedded and mobile codes PROGRAM APLAS technical program consists of paper presentations, invited talks, and a dedicated session for posters. During the poster session students and professionals can present their works-in-progress or very recent results and can get feedback from other colleagues. Before the symposium, all the poster authors are asked to read other posters' abstracts and give feedbacks beforehand. INVITED SPEAKERS: Patrick Cousot, Yoshihiko Futamura, Thomas Reps IMPORTANT DATES Paper Abstract & title: 28 May, 2005 Full paper submission: 10 Jun, 2005 Author notification: 05 Aug, 2005 Camera-ready copy: 26 Aug, 2005 Poster Abstract & title: 16 Sep, 2005 Feedback: 07 Oct, 2005 SUBMISSIONS INFORMATION - All submissions be submitted electronically online via the symposium web page http://ropas.snu.ac.kr/aplas05. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. - Paper or poster abstract submissions should not exceed 300 words. - Paper submissions should not exceed 15 pages in LNCS format, excluding bibliography and figures. - Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. - The work described should not have been previously published in a journal and conference proceedings. Authors must indicate if a closely related paper is also being considered for another conference or journal. - The proceedings of the symposium (papers and invited talks) will be published by Springer-Verlag's Lecture Notes in Computer Science series. GENERAL CHAIR Tetsu Ida (U. of Tsukuba, Japan) tetsuo.ida(a)acm.org PROGRAM CHAIR Kwangkeun Yi (Seoul National U., Korea) kwang(a)ropas.snu.ac.kr PROGRAM COMMITTEE Radhia Cousot (Ecole Polytechnique, France) Manuel Fahndrich (Microsoft Research, USA) Masami Hagiya (U. of Tokyo, Japan) Luddy Harrison (U. of Illinois at Urbana-Champaign, USA) Siau-Cheng Khoo (National U. of Singapore, Singapore) Naoki Kobayashi (Tohoku U., Japan) Oukseh Lee (Hanyang U., Korea) Peter Lee (Carnegie Mellon U., USA) Huimin Lin (Chinese Academy of Science, China) Soo-Mook Moon (Seoul National U., Korea) Alan Mycroft (U. of Cambridge, UK) Atsushi Ohori (Japan Advanced Inst. of Sci.& Tech., Japan) David Schmidt (Kansas State U., USA) Harald Sondergaard (U. of Melbourne, Australia) Martin Sulzmann (National U. of Singapore, Singapore) Wuu Yang (National Chiao-Tung U., Taiwan) Wang Yi (Uppsala U., Sweden) Kwangkeun Yi (chair) (Seoul National U., Korea) POSTER CHAIR Hongseok Yang (Seoul National U., Korea) LOCAL ARRANGEMENT Mircea Marin (U. of Tsukuba, Japan) -------------------------------------------------------------------------------

1 0

LOPSTR'05: Extended Deadline for Full Papers
by P M Hill 19 May '05

19 May '05

___________________________________________________________________ LOPSTR'05 EXTENDED DEADLINE FOR FULL PAPERS - 27th May 2005 Deadline for extended abstracts (unchanged) - 3rd June 2005 ___________________________________________________________________ Call for Papers: LOPSTR'05 International Symposium on Logic-based Program Synthesis and Transformation SEPTEMBER 7 - 9, 2005 : LONDON, UK. http://www.comp.leeds.ac.uk/lopstr05/ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development; the workshop is open to contributions in logic-based program development in any language paradigm. LOPSTR'05 will be held at Imperial College in London co-located with SAS 2005: The International Static Analysis Symposium (http://www.doc.ic.ac.uk/~clh/sas05.htm) LOPSTR has a reputation for being a lively, friendly forum for presenting new work and discussing work in progress, so it is a real workshop in the sense that it is also able to provide useful feedback to authors on their preliminary research. Formal proceedings of the workshop are produced only after the workshop, so that authors can incorporate this feedback in the published papers. Scope of LOPSTR --------------- We solicit extended abstracts and full papers. Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Papers describing applications such as those in the areas of verification and security are especially welcome. The following is a non-exhaustive list of topics: * specification * synthesis * verification * transformation * specialisation * analysis * optimisation * composition * reuse * applications and tools * proofs as programs * component-based software development * agent-based software development * software architectures * design patterns and frameworks * program refinement and logics for refinement Submission Guidelines --------------------- Authors can either submit extended abstracts describing work in progress or they can choose to submit full papers. Contributions should be written in English and should be submitted electronically in Postscript or PDF format. Authors are also asked to register with the online site and submit titles and abstracts of their intended submissions three days before the deadline. Prospective authors who have difficulties for the electronic submission may contact the chairman at hill(a)comp.leeds.ac.uk. Full papers should not exceed 16 pages (including references) in llncs format. These papers will be judged using ordinary conference quality criteria and accepted papers will have to be presented at the conference and will automatically appear in the pre-proceedings as well as in the final collection of papers, published in the LNCS series. The submission deadline for full papers is May 27th, 2005. Extended abstracts should not exceed 6 pages in llncs format and may describe work in progress. Promising abstracts relevant to the scope of LOPSTR will be selected for presentation at the conference. The submission deadline for extended abstracts is June 3rd, 2005. Accepted papers and abstracts will be collected in informal pre-proceedings which will be available at the conference. After the conference, authors of extended abstracts describing work judged to be mature enough for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures. All accepted full papers, both those accepted for the conference and those accepted full papers based on the extended abstracts will be published in the final collection of papers which is expected to be published in the Lecture Notes in Computer Science (see http://www.springer.de/comp/lncs/) series by Springer-Verlag. Note that the full papers accepted before the conference will automatically appear in that book; there will be no additional refereeing (although authors will be given a chance to revise their papers, if they so wish). Program Committee ----------------- * Maria Alpuente, * Roberto Bagnara, * Gilles Barthe, * Annalisa Bossi, * Giorgio Delzanno, * Michael Hanus, * Patricia M. Hill, (Program Chair) * John Gallagher, * Lindsay Groves, * Gopal Gupta, * Michael Leuschel, * Fabio Martinelli, * Fred Mesnard, * Maurizio Proietti, * Andreas Podelski, * German Puebla, * Abhik Roychoudhury, * C.R. Ramakrishnan, * Wim Vanhoof. Important dates --------------- * Submission of full papers: May 27, 2005 (extended deadline) * Submission of extended abstracts: June 3, 2005 * Notification: June 27, 2005 * Camera-ready: July 22, 2005 * Conference: September 7-9, 2005

1 0

(no subject)
by jcp＠cs.yale.edu 19 May '05

19 May '05

From: John Peterson <peterson-john(a)cs.yale.edu> To: haskell(a)haskell.org Subject: Blown disk on haskell.org Sorry for the downtime - haskell.org lost a disk today. Everything is back to normal (I hope). If you have software installed there, we upgraded to a new OS. Hope this doesn't break anything! John

1 0