October 2002 - Haskell

CSMR2003 - New Deadline for Submission
by csmr2003＠unisannio.it 09 Oct '02

09 Oct '02

Please note that the deadline for submitting papers to the European Conference on Software Maintenance and Reengineering has been extended to October 18, 2002. ======================================================================== (Apologies for multiple copies) Seventh European Conference on Software Maintenance and Reengineering Benevento, Italy March 26-28, 2003 http://rcost.unisannio.it/csmr2003 CALL FOR PAPERS CSMR is the premier European Conference on Software Maintenance and Reengineering. Its purpose is to promote both discussion and interaction about evolution, maintenance and reengineering. Topics of interest include, but are not restricted to: Evolution, maintenance and reengineering: + pattern languages + experience reports (successes and failures) + tools + enabling technologies + formal methods + system assessment + web-site Metrics and economics Software evolution and architecture recovery Migration and maintenance issues Dealing with legacy systems towards new technologies Wrapping and interfacing legacy systems Data reengineering Reverse engineering of embedded (control, mobile, ...) systems Evaluation and assessment of reverse engineering tools One of the basic intentions of this conference is to offer a European forum for discussion and exchange of experiences among researchers and practitioners. Therefore, besides academics, we kindly invite all those in companies developing maintenance tools, offering reengineering services or going through legacy systems migration experiences to contribute by submitting papers or presenting innovative tools, solutions or experience reports. This conference is not limited to European participants; authors from outside Europe are also welcomed. SUBMISSIONS: ============ IEEE Computer Society Press will publish the CSMR 2003 Proceedings. Two types of submissions will be accepted: full length papers (not exceeding 10 proceeding pages, IEEE Style) and short papers (not exceeding 4 proceeding pages, IEEE Style). All papers must be in English. Authors are requested to submit electronically a PostScript or PDF version of their papers. For submission details please look at the web site IMPORTANT DATES: ================ Deadline for submissions October 18, 2002 Author's notification November 27, 2002 Deadline for camera-ready of accepted papers December 20, 2002 SPECIAL SESSIONS: ================= Sessions of special interest proposed by delegates will be welcomed. Please send suggestions to the program chair before the submissions closing date. PROGRAM CHAIR: Mark van den Brand, CWI,The Netherlands e-mail: Mark.van.den.Brand(a)cwi.nl PROGRAM CO-CHAIR: Tibor Gyimóthy, University of Szeged, Hungary e-mail: gyimi(a)cc.u-szeged.hu GENERAL CHAIR: Gerardo Canfora, Research Centre on Software Technology, Italy e-mail: canfora(a)unisannio.it ========================================================================

1 0

Re: FW: quantum computing, monads, and FP in general
by Amr Sabry 09 Oct '02

09 Oct '02

Hi, I stopped reading the list for a while ... Simon Peyton Jones kindly forwarded the original message (and I re-subscribed to the list :-) Anyway, last summer I've played a little with modeling QC in Haskell using the high-level ideas you describe. I have nothing yet to show but meanwhile you might be interested in a paper by Shin-Cheng Mu and Richard Bird entitled "Functional Quantum Programming" which makes the connections to monads quite apparent: http://ropas.kaist.ac.kr/aplas/ My goal is to go much further than this paper though so perhaps in a few weeks (months!?), I'll post something here. --Amr

1 0

Re: Mondrian.Net (Ans: it is alive). Also: Haskell for .NET?
by N Perry 08 Oct '02

08 Oct '02

On Friday, Oct 04, 2002, at 11:43AM, isaac gouy <igouy(a)yahoo.com> wrote: >Does anyone know what happened to >www.mondrian-script.org? No idea, and I'm webmaster! It apparently disappeared for a short while, but the server itself was up, running, and happily humming to itself (didn't have anybody to serve). On a related subject, I'm considering dropping the Haskell for .NET based on GHC 4.08 (too much trouble) and maybe replacing it with a version based on some other Haskell compiler. Anybody else out there working on a Haskell for .NET? Cheers, Nigel

1 0

Expander2
by Prof. Dr. Peter Padawitz 08 Oct '02

08 Oct '02

Expander2: A Formal Methods Presenter and Animator ================================================== Expander2 has been designed as a multi-purpose workbench for interactive logical inference, constraint solving, data flow analysis and other procedures building up proofs or computation sequences. Moreover, several interpreters translate expressions into tailor-made two-dimensional representations that range from trees and term graphs to tables, fractals or other turtle-system-generated pictures. Expander2 has been implemented in O'Haskell}, an extension of Haskell with object-oriented features for reactive programming and a typed interface to Tcl/Tk for developing GUIs. Besides a comfortable GUI the design goals of Expander2 were to integrate testing, proving and visualizing deductive methods, to admit several degrees of interaction and to keep the system open for extensions or adaptations of individual components to changing demands. Proofs and computations performed with Expander2 follow the rules and the semantics of swinging types (ls5-www.cs.uni-dortmund.de/~peter/Swinging.html). Swinging types combine constructor-based visible types with state-based hidden types and have unique (Herbrand) models, which interpret relations as the least or greatest solutions of their axioms. All features of the system and their use are described in the manual ls5-www.cs.uni-dortmund.de/~peter/Expander2/Expander2.html (sorry, this is still a big file, it will be splitted soon; PostScript version: ../Expander2/Expander2.ps.gz). The paper ..Expander2/Chiemsee.ps.gz concentrates on the prover features. Download everything with ..Expander2.tar.gz. Please email comments, bugs, etc. to peter.padawitz(a)udo.edu. Peter

1 0

FMCO: Last Call and Final Program
by F.S.de.Boer＠cwi.nl 08 Oct '02

08 Oct '02

We apologize for the reception of multiple copies. **************************CALL FOR PARTICIPATION******************************* First International Symposium on FORMAL METHODS FOR OBJECTS AND COMPONENTS (FMCO 2002) http://fmco.liacs.nl/fmco02.html IMPORTANT DATES - The symposium will be held November 5-8, 2002. Place: Leiden, The Netherlands. - The deadline for REGISTRATION is October 15, 2002. For more information about participation and registration see the FMCO site http://fmco.liacs.nl/fmco02.html For further information consult F.S. de Boer (frb(a)cwi.nl) or M.M. Bonsangue (marcello(a)liacs.nl) **************************FMCO: PROGRAM*************************** TUESDAY 5th 8:45 - 9:00 Welcome 9:00 - 10:00 Tutorial: Bertrand Meyer (ETH Zurich and ISE) Trusted components: concepts and progress report 10:00 - 10:30 Break 10:30 - 11:15 Farhad Arbab (CWI) Abstract Behavior Types: a foundation model for components and their composition 11:15 - 12:00 Martin Wirsing (University of Munich) A calculus for mobile components and its final semantics 12:00 - 13:30 Lunch break 13:30 - 14:30 Tutorial: David Harel (The Weizmann Institute of Science) Specifying and executing behavioral requirements: the play-in/play-out approach 14:30 - 15:00 Break 15:00 - 15:45 Joseph Sifakis (Verimag) Composition for component-based design. 15:45 - 16:30 Amir Pnueli (The Weizmann Institute of Science) Title to be announced 16:30 - 16:45 Break 16:45 - 17:30 Jozef Hooman (University of Nijmegen) Formal reasoning about components of a distributed dataspace architecture WENSDAY 6th 9:00 - 10:00 Tutorial: Werner Damm (University of Oldenburg) A formal look at UML, understanding your model and learning to reason about it too. 10:00 - 10:30 Break 10:30 - 11:15 Rustan Leino (Microsoft Research) Extended Static Checking for Java 11:15 - 12:00 John Hatcliff (Kansas State University) Cadena: An Integrated Development, Analysis, and Verification Environment for Component-based Systems 12:00 - 13:30 Lunch break 14:30 - 15:15 Emil Sekerinski (McMaster University) Stepwise refinement of concurrent object-oriented programs 15:15 - 16:00 Kaisa Sere (Åbo Akademi University) Component-based circuit design using action systems 17:00 - 19:15 Social Event 19:30 - Dinner THURSDAY 7th 9:00 - 10:00 Tutorial: Clemens Szyperski (Microsoft Research) Components meet web services 10:00 - 10:30 Break 10:30 - 11:15 Oscar Nierstrasz (University of Bern) Towards a practical composition language 11:15 - 12:00 David Garlan (Carnegie Mellon University) Towards Reliable Self-Healing Systems 12:00 - 13:30 Lunch break 13:30 - 14:30 Tutorial: Manfred Broy (Technical University of Munich) Specification, composition, and decomposition of software components 14:30 - 15:00 Break 15:00 - 15:45 Ernst-Ruediger Olderog (University of Oldenburg) Specification with CSP and Object-Z 15:45 - 16:30 Leslie Lamport (Microsoft Research) High-Level Specifications: Lessons from Industry 16:30 - 16:45 Break 16:45 - 17:30 Ugo Montanari (Pisa University) HD-automata: foundations and implementation FRIDAY 8th 9:00 - 10:00 Tutorial: Perdita Stevens (Edinburgh University) Playing games with UML tools? 10:00 - 10:30 Break 10:30 - 11:15 Bernhard Rumpe (Technical University of Munich) Interplay of testing and refactoring within UML 11:15 - 12:00 Paul Klint (CWI) ToolBus: the next generation 12:00 - 13:30 Lunch break 13:30 - 14:30 Tutorial: Jos Warmer (Klasse Objecten) The role of OCL in the Model Driven Architecture 14:30 - 15:00 Break 15:00 - 15:45 Bart Jacobs (University of Nijmegen) WP-reasoning for Java 15:45 - 16:30 Gary Leavens (Iowa State University) Advances and issues in JML 16:30 - 16:45 Break 16:45 - 17:30 Erika Abraham-Mumm (Christian-Albrechts University) Verification for Java's monitor concept ORGANISING COMMITTEE F.S. de Boer (CWI) M.M. Bonsangue (LIACS-Leiden University) S. Graf (Verimag) W.-P. de Roever (CAU)

1 0

Re: Java representation in Haskell
by Ashley Yakeley 07 Oct '02

07 Oct '02

At 2002-10-06 22:30, Paulo Sequeira wrote: >Anyone knows of a module that provides data structures and functions for >representing and manipulating Java source code, so we don't have to start >from scratch? It would be wonderful if the module also includes some >"out-of-the-box" pretty-printing facilities for the representation. I have Haskell code for generating Java byte-code and class files, but that's not the same thing... -- Ashley Yakeley, Seattle WA

1 0

RE: GHCJNI
by KimWei Tay 06 Oct '02

06 Oct '02

Hello everyone, I'm new to the mailing list, and I don't really know how this works. But anyway, I'm working on a project that uses GCJNI. I'm running on a Windows2000, and I've got the following setup in my computer :- cynwin-20 ghc-5.04 greencard gcjni-1.2 But I can't even have it to compile anything at all ? Can someone help me with this ? KimWei Tay

1 0

Re: quantum computing, monads, and FP in general
by Bill Halchin 05 Oct '02

05 Oct '02

1 0

Re: quantum computing, monads, and FP in general
by Bill Halchin 05 Oct '02

05 Oct '02

1 0

quantum computing, monads, and FP in general
by Hal Daume III 04 Oct '02

04 Oct '02

Hi All, I realize most people are currently at PLI and that this might not be the most appropriate place to bring up such questions. Nevertheless, there are smarter and more knowledgable people on this mailing list than most other places I know of, so here it goes. Does anyone know if anyone has tried to model quantum computing in a monadic sense. What I mean is this: Let's say we had a quantum computer. This basically gives us a bunch of complex numbers on which we can perform calculations. Sort of an extreme SIMD situation, though the type of operations we can perform are only unitary matrix multiplications. Let's forget this for now. There are two primary characteristics of quantum computations: 1) once you observe the result, you lose everything else and can't say "well, let's go back" 2) observing the result is probabilistic. that is, each possible solution has an associated probability (it's squared amplitude) and the probability of getting a solution back is equal to this. This strikes me as a very monad-like setup. We can have a monad P, where a value of type 'P a' is a distribution over all elements of type a with associated probabilities. That is, 'P Bool' is a probability space with two elements, True and False, each with an associated probability. We need a bind operation. This is essentially associated with the sorts of unitary matrix multiplications we can perform. So, we can write something like 'a `bind` f' where a is a distribution over as and f is a function which takes some a to a distribution over bs. Then, the probability associated in the new distribution with a value x of type b is simply the sum over all possible way of getting to it. So, for instance, suppose we had a flat distribution of type P Bool; call it 'flat'. We then had a function of type 'Bool -> P Bool' which took a boolean and with 50% probability returned it as is and with 50% probability flipped its value. Call this function 'maybeFlip'. Now, 'flat `bind` maybeFlip' produces a new probability distribution equal to 'flat' (basically because there's a 50% probability of flat spitting out True, which gets to be True with 50% probability and False with 50% probability; similar reasoning if flat spits out False gives an overall probability for True of 50% and False of 50%). When we deal with actual complex numbers and can have negatives, things become more interesting, but the reasoning remains essentially the same. The 'return' funciton would simply return its argument with probability 1 and everything else with probability 0 (read probability = amplitude). Though I haven't formally verified it, I'm almost positive this obeys the monad laws (the only non-trivial verification is on the distributivity law, but I think it will work out). The only work I've seen regarding programming quantum computers is the 'Quantum Programming' paper from Sanders and Zuliani at MPC (I think) and they took an imperate approach, essentially augmenting Dijkstra's GCL programming language to pGCL by giving it probabilism. Perhaps it's just my personal bias, but functional programming seems to be a more natural fit. I also like the thin connection between lazy evaluation and the important role observation has in quantum computing. Obviously I don't know much about monads and I know even less about quantum computing. Does anyone know if anyone has taken the approach outlined above or anything similar or can point out that I'm just way off track.... Thanks! - 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

1 0