August 2002 - Haskell

SAS'02 Call for Participation -- Early Registration: * August 15 *
by Manuel Hermenegildo 05 Aug '02

05 Aug '02

[ Please Distribute -- Apologies for Receiving Multiple Copies ] [ CALL FOR PARTICIPATION REMINDER: Early Registration: * August 15 * ] -------------------------------------------------------------------------- CALL FOR PARTICIPATION SAS'02 The 9th International Static Analysis Symposium Madrid, Spain 17 - 20 September 2002 -------------------------------------------------------------------------- On-line Registration and Hotel Reservations: http://clip.dia.fi.upm.es/SAS02/ Early registration date is ** August 15, 2002 ** -------------------------------------------------------------------------- SAS'02 is Organized by: Department of Computer Science, Technical University of Madrid ---------------------------------------------------------------------- The Ninth International Static Analysis Symposium (SAS'02) will be held at the Technical University of Madrid (UPM), co-located with Logic-based Program Development and Transformation (LOPSTR'02), the APPIA-GULP-PRODE Joint Conference on Declarative Programming (AGP'02), and a number of workshops. Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification systems of high-level programming languages. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. Invited Talks include: Static Program Analysis via 3-Valued Logic Thomas Reps, University of Wisconsin Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges Robert J. Hall, AT&T Labs Research An Algebraic Approach to the Static Analysis of Concurrent Software Javier Esparza, University of Edinburgh Accepted papers: Static Analysis of the Numerical Stability of Loops Martel Matthieu Modular Control Flow Analysis for Libraries Christian Probst On termination of programs with real numbers computations Alexander Serebrenik and Danny De Schreye Polynomial Constants are Decidable Markus Müller-Olm and Helmut Seidl Normalizable Horn clauses, Strongly Recognizable Relations and Spi Flemming Nielson, Hanne Riis Nielson, and Helmut Seidl Detecting Optimal Termination Conditions of Logic Programs Fred Mesnard, Etienne Payet, and Ulrich Neumerkel Representing and approximating transfer functions in Abstract Interpretation of hetereogeneous datatypes Bertrand Jeannet Improving the Precision of Equality-Based Dataflow Analyses Erik Ruf >From Secrecy to Authenticity in Security Protocols Bruno Blanchet Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation Charles Hymans Refinement of LTL Formulas for Abstract Model Checking Maria del Mar Gallardo, Pedro Merino, and Ernesto Pimentel Making Abstract Model Checking Strongly Preserving Francesco Ranzato and Francesco Tapparo Static Confidentiality Enforcement for Distributed Programs Andrei Sabelfeld and Heiko Mantel More Precise Yet Efficient Type Inference for Logic Programs Claudio Vaucheret and Francisco Bueno A Few Graph-Based Relational Numerical Abstract Domains Antoine Mine' Pipeline Modeling for Timing Analysis Marc Langenbach, Stephan Thesing, and Reinhold Heckmann Compactly Representing First-Order Structures for Static Analysis R. Manevich, G.Ramalingam, J. Field, D. Goyal, and M. Sagiv Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties Damien Masse States vs. Traces in Model Checking by Abstract Interpretation Roberto Giacobazzi and Francesco Ranzato Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, and Westley Weimer Analysing Approximate Confinement under Uniform Attacks Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky Reuse of results in termination analysis of typed logic programs Maurice Bruynooghe, Michael Codish, Samir Genaim, and Wim Vanhoof Backward Type Inference Generalises Type Checking Lunjin Lu and Andy King Security Typings by Abstract Interpretation Mirko Zanotti Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill Reliable Optimization for Imperative Languages: Proving Nullspace Properties of Compilers Todd L. Veldhuizen and Andrew Lumsdaine Representation Analysis for Coercion Placement Karl-Filip Faxen Ensuring Termination of Offline Partial Evaluation in Polynomial Time (A New Finiteness Analysis) Chin Soon Lee Automated Verification of Concurrent Linked Lists with Counters Tuba Yavuz-Kahveci and Tevfik Bultan An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages John Whaley and Monica Lam An Improved Constraint-Based System for the Verification of Security Protocols Ricardo Corin and Sandro Etalle Nonuniform Alias Analysis of Recursive Data Structures and Arrays Arnaud Venet -------------------------------------------------------------------------- Organized by: ------------- Department of Computer Science, Technical University of Madrid Program Chair: Conference Chair: -------------- ----------------- Manuel Hermenegildo German Puebla Email: herme(a)fi.upm.es Email: puebla(a)fi.upm.es Program Committee ----------------- Manuel Hermenegildo Technical University of Madrid, Spain German Puebla Technical University of Madrid, Spain Radhia Cousot Ecole Polytechnique, France Saumya Debray The University of Arizona, USA Manuel Fahndrich Microsoft Research, USA Roberto Giacobazzi Univerity of Verona, Italy Chris Hankin Imperial College, UK Giorgio Levi Univerity of Pisa, Italy Kim Marriott Monash University, Australia Alan Mycroft Cambridge University, United Kingdom Ganesan Ramalingam IBM T.J. Watson Research Center, USA Martin Rinard Massachusetts Institute of Technology, USA Shmuel Sagiv Tel-Aviv Univerisity, Israel Reinhard Wilhelm Universitat des Saarlandes, Germany -------------------------------------------------------------------------- -- ----------------------------------------------------------------------------- 9th International Static Analysis Symposium SAS'02 17-20 September 2002, Madrid Spain Technical University of Madrid http://clip.dia.fi.upm.es/SAS02/ sas02(a)clip.dia.fi.upm.es -----------------------------------------------------------------------------

1 0

Haskell + automake?
by Andrew J Bromage 05 Aug '02

05 Aug '02

G'day all. Has anyone come up with some magic to let automake play nice with Haskell compilers (ghc 5 or nhc 98 preferred)? Thanks in advance, etc. Cheers, Andrew Bromage

2 1

Final CFP: JFP Special Issue on Functional Pearls
by Ralf Hinze 05 Aug '02

05 Aug '02

The deadline is approaching... Write a pearl today! ============================================================================ FINAL CALL FOR PAPERS Special Issue on Functional Pearls http://www.informatik.uni-bonn.de/~ralf/necklace.html [Deadline: 31 August 2002] ============================================================================ Wer die Perle in Händen hält, fragt nicht nach der Muschel. - Peter Benary A special issue of the Journal of Functional Programming will be devoted to Functional Pearls. The submission deadline is 31 August 2002. Scope ----- Do you have a paper that is small, rounded and enjoyable to read? Please consider submitting it to the Special Issue on Functional Pearls, as we intend to string a shiny necklace. If you don't have a pearl, write one today! Papers can be on any subject connected to functional programming. A pearl is typically around 8 pages, though there is no strict page limit. The special issue also welcomes tutorial or educational papers in a broad sense. Submission details ------------------ Manuscripts should be unpublished works and not submitted elsewhere. Revised and polished versions of papers published in conference proceedings that have not appeared in archival journals are eligible for submission. All submissions will be reviewed according to the usual standards of scholarship and judged by elegance of development and clarity of expression. One of the main reviewers will be Richard Bird, the editor of JFP's regular Functional Pearls column. Deadline for submission: 31 August 2002 Notification of acceptance or rejection: 30 November 2002 Revised version due: 31 January 2003 Submissions should be sent to the Guest Editor (see address below), with a copy to Nasreen Ahmad (nasreen(a)dcs.gla.ac.uk) Submitted articles should be sent in PDF or Postscript format, preferably gzipped and uuencoded. The use of the JFP style files is strongly recommended. In addition, please send, as plain text, title, abstract (if any), and contact information. The submission deadline is 31 August 2002. Authors will be notified of acceptance or rejection by 30 November 2002. Revised versions are due on 31 January 2003. For other submission details, please consult an issue of the Journal of Functional Programming or see the Journal's web page at http://www.dcs.gla.ac.uk/jfp/. Guest Editor ------------ Ralf Hinze Institut für Informatik III Universität Bonn Römerstraße 164 53117 Bonn, Germany Telephone: +49 (2 28) 73 - 45 35 Fax: +49 (2 28) 73 - 43 82 Email: ralf(a)informatik.uni-bonn.de WWW: http://www.informatik.uni-bonn.de/~ralf/ ============================================================================

1 0

CFP ACSC 2003
by Michael Oudshoorn 05 Aug '02

05 Aug '02

Please circulate the following Call for Papers as widely as possible. CALL FOR PAPERS - CALL FOR PAPERS - CALL FOR PAPERS - CALL FOR PAPERS Australasian Computer Science Conference Adelaide, South Australia 4 - 7 February, 2003 The Australasian Computer Science Conference (ACSC) series is an annual forum for exploring research, development and novel applications in computer science. It will be hosted by the South Australian Consortium of Information Technology in conjunction with the three Adelaide-based universities: Flinders University of South Australia, University of Adelaide, and the University of South Australia. ACSC is part of the Australasian Computer Science Week, which also includes: * the Australasian Database Conference (ADC2003), * Computing: The Australasian Theory Symposium (CATS2003), * the Australasian User Interface Conference (AUIC2003), * the Asia-Pacific Bioinformatics Conference (APBC2003), * the Australasian Information Security Workshop (AISW2003), and * the Australasian Comuting Education conference (ACE2003). These conferences will be held at the Exhibition Centre, Adelaide, South Australia from Tuesday 4th February to Friday 7th February, 2003. The proceedings for each conference will be made available through the ACM Digital Library. The conference is generously supported by: * Asian Office of Aerospace Research and Development * Australian Computer Society * Motorola Australia Software Centre * Tenix Defense * Defense Science and Technology Organisation We welcome papers describing original contributions in all fields of Computer Science and Software Engineering research and education. Each paper will be judged on its originality, significance, correctness and clarity. Its contribution should be clearly explained in both general and technical terms, and authors should make every effort to ensure that its technical content is understandable by a broad audience. Submissions of a paper should be regarded as an undertaking that, should the paper be accepted, at least one author will attend the conference to present the work. All areas of Computer Science research are appropriate for ACSC2003. Areas include (but are not limited to): * Algorithms * Artificial Intelligence * Communications * Compilers * Computer Architecture * Computer Vision * Concurrency * Databases * Data Structures * Distributed Systems * E-Commerce * Education * Embedded Systems * Fault Tolerance * Formal Methods * Functional Programming * Graphics * High Performance Computing * Human-Computer Interaction * Logic and Logic Programming * Multimedia * Natural Language * Object-Oriented Systems * Operating Systems * Persistence * Programming Languages * Real-time Systems * Reliabiliity * Robotics * Security * Scientific Computing * Simulation * Software Engineering * Speech * Theory * Trusted Systems * Visualisation Papers up to 10 pages in length conforming to the formatting instructions for the series Conferences in Research and Practice in Information Technology are invited. The deadline for submission is Friday 6th September, 2002. The proceedings of the conference will be published through the Australian Computer Society as the Australasian Computer Science Conference 2003 - Australian Computer Science Communications, Volume 25, Number 1. Each paper will be fully refereed. Complete instructions for authors regarding submission and formatting procedures can be found at http://www.csa.edu.au/acsw/acsw03/acsc/ IMPORTANT DATES Submission of papers: Friday 6 September 2002 Notification of acceptance: Friday 18 October 2002 Submission of camera-ready copy: Friday 15 November 2002 Author registration: Friday 15 November 2002 Conference: 4-7 February 2003 Program Committee Chair A/Prof. Michael Oudshoorn Department of Computer Science University of Adelaide E-mail: acsc2003(a)csa.edu.au Organising Committee Co-chairs Prof. John Roddick, Flinders University of South Australia Ms. Jenny Harvey, Motorola Australia Software Centre Address for All Paper Submissions and Correspondance Electronic submission of papers is preferred (in postscript or pdf). The web page http://www.csa.edu.au/acsw/acsw03/acsc/ contains all of the necessary details. Paper based submission to: ACSC2003 A/Prof. Michael Oudshoorn Department of Computer Science University of Adelaide Adelaide SA 5005 Australia Telephone: +61 8 8303 4478 Fax: +61 8 8303 4366 E-mail: acsc2003(a)csa.edu.au Web: http://www.csa.edu.au/acsw/acsw03/acsc The ACSC2003 web site is at http://www.csa.edu.au/acsw/acsw02/acsc/. CALL FOR PAPERS - CALL FOR PAPERS - CALL FOR PAPERS - CALL FOR PAPERS

1 0

freeTR.com Artist olmak icin evden kacan Turk kizlarinin Beyoglunda cekilmis Acik sacik Cinsel birlesme iceren Videolari Date: Sun, 04 Aug 2002 19:57:12 +0300
by mimi 04 Aug '02

04 Aug '02

http://www.freeTR.com Artist olmak icin evden kacan Turk kizlarinin Beyoglunda cekilmis Acik sacik Cinsel birlesme iceren Videolari icin: http://www.freeTR.com

1 0

HR, App. D.5, minor correction
by Ralf Hinze 04 Aug '02

04 Aug '02

Hi Simon, here is a minor correction to the May version of the HR. In appendix D.5 there is a table with an example for derived instances: for reasons of consistency the line showsPrec d (Leaf m) = showParen (d >= 10) showStr should be replaced by showsPrec d (Leaf m) = showParen (d > app_prec) showStr Cheers, Ralf

1 0

Haskell Wiki is down, could someone fix it?
by Shae Matijs Erisson 03 Aug '02

03 Aug '02

As the subject says, the Haskell Wiki is showing blank pages again, could someone fix it? Thanks, -- Shae Matijs Erisson - http://www.webwitches.com/~shae/

1 0

idiom for different implementations of same idea
by Hal Daume III 02 Aug '02

02 Aug '02

Hi all, I'm looking for some advice on what's the cleanest way to implement something. The basic idea is that I have a task to solve, T. There are many steps to solving this task, but they can be broken down into a small list of elementary steps: - prepareData - initialize - doThingOne - doThingTwo - getResults where the main driver does something like: prepareData initialize iterate until converged doThingOne doThingTwo getResults As is standard in my field (statistical natural langauge processing), I have several models defined to perform task T (though only the first, most basic one is implemented). Call these Model0, Model1, Model2, and so on. All of these models, since they're solving the same basic task, have the same basic types on their functions, something like (a bit simplified, but): prepareData :: Data () -> Data markup initialize :: Data markup -> ST s table doThingOne :: Data markup -> table -> ST s alignments doThingTwo :: Data markup -> alignments -> ST s table getResults :: Data markup -> table -> alignments -> String Simple enough. Now, say I have three models (0-2) which implement these functions with varying complexities (also of varying complexities in terms of the types of 'markup', 'table' and 'alignments'). Each model has a different idea of what these three types are. Now, I want in my executable my user to be able to say "-model=0" and so on in the command line and for it to use the appropriate model. Each of these models will go in a separate module. One way to do this would be to import all of the models qualified and then if they choose Model0, pass to the "go" function Model0.prepareData, Model0.initialize, etc. This is fine, simple, good. But it doesn't enforce at all the types of the functions. Another way to go would be to make a class, something like: class Model model markup table alignments | model -> markup, table, alignments where prepareData :: model -> Data () -> Data markup initialize :: model -> Data markup -> ST s table doThingOne :: model -> Data markup -> table -> ST s alignments doThingTwo :: model -> Data markup -> alignments -> ST s table getResults :: model -> Data markup -> table -> alignments -> String where the model type/parameter is essentially a dummy to tie everything together. This could be implemented a bit more cleaning with the definition: data T a and then the first parameter for all of those class functions changing from "model" to "T model". Each model module would then have it's own datatype, something like: > (in module Model0:) > data Model0 > > instance Model Model0 Int Table Al where > ... This is another option; however I don't think it's very clean for two reasons: - there are a lot of fundeps; in the actual application there are a few more type variables than I presented here, and it gets very long :) - the model parameter is used only to determine which model we're using and doesn't actually do anything other than satisfy the typechecker There are probably a plethora of alternatives I haven't considered, but I'm sure people have done something similar to this before and I'm curious how they handled it... Thanks for reading this far :) - Hal -- Hal Daume III "Computer science is no more about computers | hdaume(a)isi.edu than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume

4 6

Re: slightly ot: data structure question
by George Russell 02 Aug '02

02 Aug '02

Andrew Bromage wrote > On Mon, Jul 29, 2002 at 02:50:55PM -0700, Hal Daume III wrote: > > > I need a data structure which is a map from Ints to Doubles; the > > distribution of the Ints is in the range say 0-20000 and a map will > > contain somewhere around 100-200 elements. I need to be able to query > > *very* quickly, insert *quite* quickly, and iterate through the elements > > very quickly. I'm thinking hash tables, but I'm not sure. Does anyone > > have any thoughts on this? > > How about this? > > http://citeseer.nj.nec.com/briggs93efficient.html > > Another paper which might be useful: > > Aasa, A., Holstrom, S. and Nilsson, C. (1988), > "An Efficiency Comparison of Some Representations of Purely > Functional Arrays". BIT 28(3):490--503. You aren't doing sparse matrix computations are you? In that case there are specialised storage techniques around, which are probably better than any general solution. If you ask on sci.math.num-analysis you'll probably get more references than you know what to do with. The method in the first paper effectively has one array of length 20000 allowing you to query *very* quickly, plus a smaller array listing the elements. I think the main problem with this would be the array of 20000 elements. Apart from the cost of memory (which is probably pretty insignificant), you have the problem that 20000 elements is 160kB which is quite a lot to all keep in cache at once. If the elements are uniformly distributed it seems to me you might get better performance by, say, using a closed hash table with size say 1024 and indexing just by some selection of 10 bits from the integers. (Of course if the integers are not uniformly distributed you will need a better hash function.) Then in 80-90% of cases you will get a positive/negative answer to the query in just one lookup; if it's a don't know (there is a different element at this position) you will only have to scan through the same cache line (almost certainly) until you get the right answer. You can also dispense with the first paper's auxiliary array this way by setting the integers in the array to out-of-range values (or by using signalling NaN's for the doubles); iterating through the array checking all the integers shouldn't take too long.

1 0

how to catch GHC "no threads to run" exception?
by paul＠theV.net 02 Aug '02

02 Aug '02

My program runs 3 threads, and after a few minutes' execution all threads come to a state that they all wait on some MVars, then the program halts with an error: test: no threads to run: infinite loop or deadlock? (test is my program name) My problem is that this behavior is actually desired, but how do I catch this exception and do some bookkeeping (closing external IO, etc.) and then a proper exit? Thanks in advance! Regards, .paul.

3 3