- Haskell - Haskell.org

PHI ¿ Python Haskell Interface
by Gottfried F. Zojer 21 Aug '05

21 Aug '05

Hello, Is anybody aware about the development status of PHI Python Haskell Interface Any time when I want to access I get a timeout http://page-208.caltech.edu/phi/ Any feedback welcomed Rgds Gottfried

3 2

Random matrices
by Scherrer, Chad 21 Aug '05

21 Aug '05

I'm doing some statistical calculations, and I decided to try this out in Haskell to see how it goes. I'm really enjoying using the language, so I hope I can straighten this out so I can keep using it at work. I keep getting stack overflows, so I think my code must be too lazy somewhere (that's what that means, right?) Here is my code to build random vectors and matrices. ------------------------------------------------------------------------ -------- type Vector = UArray Int Float type Matrix = DiffArray Int Vector -- Generate a random number from the unit interval randomEntry :: State StdGen Float randomEntry = do g <- get (x, g') <- return $ randomR (0,1) g put g' return x -- Build an array of n random things randomArray :: (IArray arr a) => Int -> State StdGen a -> State StdGen (arr Int a) randomArray n x = mapState arr . sequence $ replicate n x where arr (a,s) = (array (1,n) $ zip [1..n] a, s) -- A random vector is an array of random entries randomVector :: Int -> State StdGen Vector randomVector n = randomArray n randomEntry -- a random matrix is an array of random vectors. randomMatrix :: Int -> Int -> State StdGen Matrix randomMatrix i j = randomArray i $ randomVector j ------------------------------------------------------------------------ -------- I decided to write a tester function to see whether building the random matrices is the root of my problem. tester :: Int -> [Matrix] tester n = fst $ runState vals $ mkStdGen 1 where vals = sequence . repeat $ randomMatrix n n Then if I do main = print $ ((tester 10)!!10000)!5 with ghc -O, I get a stack overflow. So all main is trying to do is build an infinite list of 10x10 random matrices, extract the 10000th one, and then look at row 5. Stack overflows like this have given me trouble before. I thought using unboxed arrays might help, since they're forced to be strict, but I haven't had any luck with them. Are there any general guidelines I'm overlooking? I think Haskell can be very useful in my work, but I have to get beyond this hurdle. I just figured out the State monad yesterday, so maybe I'm not using it as it's intended? I dunno. Thanks, Chad Scherrer

2 2

PLID 2005 call for participation
by David Clark 19 Aug '05

19 Aug '05

CALL FOR PARTICIPATION Second International Workshop on Programming Interference and Dependence (PLID) Affiliated with SAS and LOPSTR September 6 2005 Imperial College London UK http://www.dcs.kcl.ac.uk/events/PLID05 INVITED TALK Mobile Computing, Types and Security. Nobuko Yoshida (UK) VENUE PLID 2005 is co-located with SAS'05 and LOPSTR'05 at Imperial College, London, UK REGISTRATION At the SAS conference web site: http://www.doc.ic.ac.uk/~sas2005/registration.html SHORT TALKS Participants are offered the opportunity to present one or more five minute talks on current research ideas. PROGRAM the program of talks can be found at http://www.dcs.kcl.ac.uk/events/PLID05/program.html WORKSHOP THEME Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and recently in systems biology, where the problem of controlling interference between pathways in complex molecular networks is recognized as a major challenge. Refining dependence analysis is the main task to achieve this goal. This requires new theories, models and semantics for interference and dependence, algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. -- _______________________________________________________ David Clark, room 2F, Department of Computer Science, King's College London, The Strand, London, WC2R 2LS, UK. ph: +44 20 7848 2472

1 0

PEPM 2006: Call for Papers -- ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation
by John Hatcliff 19 Aug '05

19 Aug '05

C A L L F O R P A P E R S === P E P M 2006 === ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation (Affiliated with POPL 2006) http://www.cis.ksu.edu/santos/pepm06 January 9-10, 2006 Charleston, South Carolina The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. The 2006 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation. This year, a concerted effort will be made to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM will be broadened to cover manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'06 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, and type systems. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking in a wide variety of domains including source code manipulation, domain-specific language implementations, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and web-based programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. Submission Categories, Guidelines, and Proceedings: Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style, and authors will be expected to present a live demonstration of the described tool at the workshop. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM'06 Web-site. Papers should be submitted electronically via the workshop web site. We plan to publish the workshop proceedings in ACM SIGPLAN Notices (with full papers appearing in the ACM Digital Library) and selected papers will be invited for a journal special issue dedicated to PEPM'06. Important Dates: Submission........: October 7, 2005 Apia, 11:59pm, Samoan time (firm deadline, no extensions) Notification......: November 18, 2005 Camera-Ready Paper: December 16, 2005. Workshop co-Chairs: John Hatcliff, Kansas State University, USA (hatcliff(a)cis.ksu.edu) Frank Tip, IBM T.J. Watson Research Center, USA (ftip(a)us.ibm.com) PEPM 2006 Program Committee: Krzysztof Czarnecki University of Waterloo Gary Daugherty Rockwell Collins Advanced Technology Center Tom Dean Queen's University Mangala Gowri Nanda IBM India John Hatcliff (co-chair) Kansas State University Nevin Heintze Agere Systems Jaakko Järvi Texas A & M University Jens Krinke University of Hagen Shriram Krishnamurthi Brown University Julia Lawall University of Copenhagen (DIKU) Oege de Moor Oxford University Germán Puebla Technical University of Madrid Peter Sestoft Royal Veterinary and Agricultural University (Denmark) Gregor Snelting University of Passau Frank Tip (co-chair) IBM T.J. Watson Research Center Eelco Visser Universiteit Utrecht -- ---------------------------------------------------------------------------- John Hatcliff Phone: 785-532-6350 Professor Fax..: 785-532-7353 Department of Computing and Information Sciences Email: hatcliff(a)cis.ksu.edu 234 Nichols Hall WWW..: http://www.cis.ksu.edu/~hatcliff Kansas State University Manhattan, KS 66506 ----------------------------------------------------------------------------

1 0

ACM SAC 2006 CFP: Software Verification Track
by Lunjin Lu 17 Aug '05

17 Aug '05

------------------------------------------------------------------------ -------- CALL FOR PAPERS Software Verification Track ACM Symposium on Applied Computing April 23-27, 2006, Dijon, France http://www.cs.wmich.edu/~zijiang/sac2006/ ------------------------------------------------------------------------ -------- 1. SAC 2006 For the last twenty years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2006 is sponsored by the ACM Special Interest Group on Applied Computing, and is hosted this year by Bourgogne University, Dijon, France. 2. Technical track on software verification In the next decade the software industry will have to face its responsibility imposed by a computer-dependent society. Since software is increasing deployed in safety critical applications, correctness and reliability are becoming issues of utmost importance. Consequently, software verification will be a grand challenge for both academic world and computer industry. The track will focus on theoretical foundations, practical methods as well as case studies for verification of conventional and embedded software. We welcome papers that describe work on combinations of formal verification and program analysis techniques. Tool papers and case studies which report on advances in verifying large software systems are particularly sought. The list of topics includes but not limited to . Tools, and case studies for large scale software verification . Static analysis/Abstract interpretation for verification . Model checking and deductive techniques for software verification . Role of declarative programming languages (such as Prolog) for infinite state software verification. . Proof techniques for verifying specific classes of software . Integration of testing and run-time monitoring with formal techniques . Validation of UML diagrams, and/or�requirement specifications . Software certification and proof carrying code . Integration of formal verification into software development projects 3. Guidelines for paper submission Each paper must not exceed 4,000 words and should not be more than 15 pages long using 11 point font and 1 inch margins on all four sides on letter size paper. Papers that fail to comply with length limitations risk rejection. Each submitted paper will be fully referenced and undergo a blind review process. Author(s)�must not be identified in the submissions, either explicitly or by implication. Before submitting paper,�author(s) should submit a separate cover page that includes title, abstract, list of keywords, and list of authors with full names and postal addresses, telephone numbers, fax numbers, and e-mail addresses. One of the authors must be designated as the primary contact person. Please upload the cover page via http://milo.cs.iupui.edu/sac2006/SubmitAbstract.aspx?TrackID=62. A confirmation email with further instructions on paper submission will be sent to the contact author. Please contact track chairs or Jeff Allen (jallen(a)cs.iupui.edu) for any problems with submission. Authors of accepted papers must submit an editorial revision of their papers that must fit within five two-column pages following the ACM proceedings format (an extra three extra pages may be available at additional cost to the authors). At least one of the authors of an�a ccepted paper must register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2006 proceedings. 4. Important dates . Electronic submission of full papers: September 3, 2005 . Notification of paper acceptance: October 15, 2005 . Camera-ready copy of accepted paper due: November 5, 2005 5. Program Committee . Franjo Ivancic, NEC Labs America, Inc, U.S.A. . Radu Grosu, SUNY-Stony Brook, U.S.A. . Francesco Logozzo, Ecole Polytechnique, France . Lunjin Lu(Co-Chair), Oakland University, U.S.A. . Madhusudan Parthasarathy, UIUC, U.S.A. . Robby, Kansas State University, U.S.A. . Abhik Roychoudhury, National Univ. Singapore . Fausto Spoto, Univ. di Verona, Italy . Frank Stomp, Wayne State University ,U.S.A. . Zijiang Yang(Co-Chair), Western Michigan University, U.S.A. . Tian Zhao, University of Wisconsin-Milwaukee, U.S.A

1 0

ICTCS'05 Call for Participation
by g. michele pinna 17 Aug '05

17 Aug '05

***** apologies for multiple copies ***** Ninth Italian Conference on Theoretical Computer Science (ICTCS'05) Certosa di Pontignano (Siena), Italy October 12 - 14, 2005 http://ictcs05.dsmi.unisi.it Call for Participation The Ninth Italian Conference on Theoretical Computer Science will take place at the Certosa di Pontignano (Siena), Italy. There will be three invited speakers: Luca Cardelli (Microsoft Research, Cambridge, United Kingdom) Giuseppe Castagna (LIENS - École Normale Supérieure, Paris, France) Nicola Santoro (School of Computer Science, Carleton University, Ottawa, Canada) Program Committee: Michele Bugliesi (Venezia), Mario Coppo (Torino, Co-Chair), Pierluigi Crescenzi (Firenze), Giulia Galbiati (Pavia) Luisa Gargano (Salerno), Giorgio Ghelli (Pisa), Roberto Grossi (Pisa), Benedetto Intrigila (L'Aquila), Nicola Leone (Cosenza), Elena Lodi (Siena, Co-Chair), Flaminia Luccio (Trieste), Andrea Masini (Verona), Giancarlo Mauri (Milano), Corrado Priami (Trento), Geppino Pucci (Padova), Davide Sangiorgi (Bologna). Preliminary program: Wednesday, October 12: 08,45 - 09,00 Welcome 09,00 - 10,00 L. Cardelli: Biological System as Reactive Systems 10,00 - 11,00 B. DasGupta, S. Ferrarini, U. Gopalakrishnan, N. Paryani: Inapproximability Results for the Lateral Gene Transfer Problem S. Mantaci, A. Restivo, G. Rosone, M. Sciortino: A new combinatorial approach to sequence comparison 11,00 - 11,20 coffee break 11,20 - 13,20 M. Bartoletti, P. Degano, G. L. Ferrari: Checking Risky Events is Enough for Local Policy B. Aziz, D. Gray, G. Hamilton: A Static Analsis of PKI-Based Systems R. Medel, A. Campagnoni, E. Bonelli: A Typed Assembly Language for Non-interference L. Bettini, V. Bono, S. Likavec: Safe Object Composition in the Presence of Subtyping 13,20 - 15,00 Lunch 15,00 - 17,00 L. A. Hemaspaandra, J. Rothe, A. Saxena: Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory J. Fiala, J. Kratochvil: On the computational complexity of the L(2,1)-labeling problem for regular graphs B. Escoffier, J. Monnot, V. T. Paschos: Weighted coloring: further complexity and approximability results V. Raman, S. Saurabh, S. Sikdar: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems 17,00 - 17,20 coffee break 17,20 - 19,20 S. van Bakel, U. de' Liguoro: Subtyping Object and Recursive Types Logically J. Schwinghammer: A Typed Semantics of Higher Order Store and Subtyping W. Jamroga, J. Dix: Model Checking Strategic Abilities of Agents under Incomplete Information S. Heymans, D. Van Nieuwenborgh, D. Vermeir: Synthesis from Temporal Specifications using Preferred Answer Set Programming 20,00 - Dinner Thursday, October 13: 09,00 - 10,00 N. Santoro: Mobile Agents Computing: Security Issues and Algorithmic Solutions 10,00 - 11,00 T. Kuboyama, K. Shin, T. Miyahara, H. Yasuda: A Theoretical Analysis of Alignment and Edit Problems for Trees L. Anderegg, M. Cieliebak, G. Prencipe: Efficient Algorithms for Detecting Regular Point Configurations 11,00 - 11,20 coffee break 11,20 - 13,20 R. Statman: Two Variables are Not Enough S. van Bakel, S. Lengrand, P. Lescanne: The language X: Circuits, Computations and Classical Logic C. Bertolissi: The Graph Rewriting Calculus: confluence and Expressiveness N. Busi, G. Zavattaro: Reachability Analysis in Boxed Ambients 13,20 - 15,00 Lunch 15,15 - 17,15 G. De Marco, M. Pellegrini, G. Sburlati: Faster Deterministic Wakeup in Multiple Access Channels M-C. Costa, F. Jarray, C. Picoleau: Reconstructing an alternate periodical binary matrix from its orthogonal projections S. Fung, F. Chin, C. K. Poon: Laxity helps in broadcast scheduling Y. Asahiro, E. Miyano, S. Shimoirisa: Pickup and Delivery for Moving Objects on Broken Lines 17,30 - Excursion to Siena 18,00 - 20,00 EATCS Italian Chapter Annual Meeting (at the Dipartimento di Scienze Matematiche e Informatiche "R. Magari" 20,30 - Social dinner Friday, October 14: 09,00 - 10,00 G. Castagna: Semantic Subtyping: challenges, perspectives and open problems 10,00 - 11,00 G. Castagna, D. Colazzo, A. Frish: Error Mining for Regular Expressions Patterns M. Macchetti, M. Caironi, L. Breveglieri, A. Cherubini: A Complete Formulation of Generalized Affine Equivalence 11,00 - 11,30 coffee break 11,30 - 13,00 T. Kopelowitz, E. Porat: Improved Algorithms for Polynomial Time-Decay and Time-Decay with Additive error S. Fenner, Y. Zhan: Quantum Algorithms for a Set of Group Theoretic Problems G. Franco: A polymerase based algorithm for SAT 13,00 - 13,20 End of the Conference 13,20 Lunch Registration Register online until September 10 and receive an early registration discount. The registration form is available at http://ictcs05.dsmi.unisi.it/registration.html Further informations are available at the conference web pages or can be obtained writing to ictcs05(a)unisi.it

1 0

Haskell Weekly News: August 16, 2005
by John Goerzen 16 Aug '05

16 Aug '05

Haskell Weekly News: August 16, 2005 Greetings, and thanks for reading the third issue of HWN, a weekly newsletter for the Haskell community. Each Tuesday, new editions will be posted (as text) to [1]the Haskell mailing list and (as HTML) to [2]The Haskell Sequence. 1. http://www.haskell.org/mailman/listinfo/haskell 2. http://sequence.complete.org/ New Releases * gtk2hs 0.9.9. Axel Simon [3]announced the latest version of this binding to GTK, primarily containing bugfixes. * h4sh. Donald Bruce Stewart [4]announced the new Haskell for shell scripts package. It exposes the Haskell Data.List library for use in shell scripting. * c2hs 0.14.3. Manuel M. T. Chakravarty [5]released version 0.14.3 of c2hs. Improvements over 0.14.1 include support for cross-compilation, gcc's asm construct, better support for hierarchical module syntax, and new name translation functions. * magic-haskell. John Goerzen [6]announced the availability of magic-haskell, a binding to C's libmagic. With it, you can determine the type of a file by looking at its contents rather than its name. * AVL 2.2. Adrian Hey [7]released AVL 2.2. It introduces new set manipulation functions, a new type of zipper, and optimizations for functions that don't modify a tree. 3. http://article.gmane.org/gmane.comp.lang.haskell.general/11971 4. http://article.gmane.org/gmane.comp.lang.haskell.general/11970 5. http://article.gmane.org/gmane.comp.lang.haskell.glasgow.user/8566 6. http://www.haskell.org/pipermail/haskell/2005-August/016288.html 7. http://article.gmane.org/gmane.comp.lang.haskell.libraries/3631 Discussion HWN format changes this week. Based on reader feedback, the New Releases section has been moved to the top of HWN. Please let me know what you think. Before you ask, the Darcs and Quotes of the Week sections are missing because there was no news for them this week. Static typing. Minh Thu started a [8]discussion about the pros and cons of static typing and side effects. 8. http://thread.gmane.org/gmane.comp.lang.haskell.general/11950 Language version pragmas. Bulat Ziganshin [9]proposed a way to specify what language version and options are used in Haskell sources. 9. http://thread.gmane.org/gmane.comp.lang.haskell.general/11944 About Haskell Weekly News Want to continue reading HWN? Please help us create new editions of this newsletter. Please see the [10]contributing information, or send stories to hwn -at- complete -dot- org. There is also a Darcs repository available. 10. http://sequence.complete.org/hwn-contrib

1 0

ANN: magic-haskell
by John Goerzen 16 Aug '05

16 Aug '05

Hello, I have packaged up a Haskell binding to libmagic, a library that guesses the type of a file by looking at its contents instead of its name. This is a working full binding. darcs get --partial http://darcs.complete.org/magic-haskell Proper tarballs and unit tests will be following shortly. -- John

1 0

LECTURERSHIP IN COMPUTER SCIENCE, UNIVERSITY OF DURHAM
by Susan Bates 16 Aug '05

16 Aug '05

The Department of Computer Science at the University of Durham is advertising for a Lectureship available from 1 October 2005 or as soon as possible thereafter to candidates with a high research portfolio or demonstrable potential of such. Candidates should have research interests related to those of the Department. Appointment will be made on the Lecturer A or Lecturer B scale depending on individuals' qualifications and current level of experience. Closing date: 21 September 2005 Vacancy Reference Number: 0956 Further details of the post and an application form are available on the University's website (https://jobs.ac.uk) or telephone 0191 334 6499; fax 0191 334 6495 -- Susan Bates Secretary Department of Computer Science University of Durham Science Laboratories South Road Durham DH1 3LE Tel: 0191 334 1757 Fax: 0191 334 1701 E-mail: susan.bates(a)durham.ac.uk -- Susan Bates Secretary Department of Computer Science University of Durham Science Laboratories South Road Durham DH1 3LE Tel: 0191 334 1757 Fax: 0191 334 1701 E-mail: susan.bates(a)durham.ac.uk

1 0

Gtk2Hs 0.9.9 released
by Axel Simon 15 Aug '05

15 Aug '05

Dear all, A new release for Gtk2Hs, namely version 0.9.9 is now available. This is a bug-fix release which is meant to fix various issues in the 0.9.8 release. The tarball is available from at Sourceforge. The md5 checksum is 3276545190248d40c683cd42f51a1b6e. Changes since 0.9.8: * many documentation fixes * documentation builds with the new haddock 0.7 * fixed an intolerant parser in c2hs, the C header-file scanner * fixed segfaults when disconnecting signal handlers * fixed segfaults in signals that pass TextIters * add Pixmap from Gdk (not gtk_pixmap which is deprecated) * added ChildAttributes to all containers * minor fixes to our Makefile Please report any problems with this release to our emailing list, gtk2hs-users(a)lists.sourceforge.net . Axel (on behalf of the Gtk2Hs team).

1 0