- Haskell - Haskell.org

Haskell Report (again)
by Simon Peyton-Jones 17 Jul '01

17 Jul '01

Folks Apart from a recent hiatus over module qualified names, the revised Haskell report is done. I sent round a message about the module-name question, which elicited no complaints, so I have incorporated the changes (see the bugs page, items dated [July 2001]). As ever, the draft is at http://research.microsoft.com/~simonpj/haskell98-revised I'm really hoping this is the final version, but experience suggests that whenever I say that someone discovers an entirely new question! So I'm putting it out again for you to pick over. Comments please. If I hear nothing by end July I'll freeze it then. Simon

2 1

FLOPS 2002, First Call for Papers
by Zhenjiang Hu 15 Jul '01

15 Jul '01

We apologize, if you receive this message more than once. ********************************************************************* * * * CALL FOR PAPERS * * * * Sixth International Symposium on Functional and Logic Programming * * (FLOPS 2002) * * (Co-located with ACM SIGPLAN Aisa-PEPM 2002) * * * * University of Aizu, Aizu, Japan * * September 15--17, 2002 * * * * http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ * * * ********************************************************************* Background ========== The symposium is a forum for research on all issues concerning functional programming and logic programming. In particular, it wants to stimulate the cross-fertilization as well as integration of the two paradigms. The symposium takes place about every 1.5 years in Japan. Previous FLOPS meetings were held in Fuji Susuno (1995), Shonan Village (1996), Kyoto(1998), Tsukuba (1999), and Tokyo (2001). Topics ====== The Sixth International Symposium on Functional and Logic Programming (FLOPS 2002) solicits original papers in all areas of functional and logic programming, including (but not limited to): * Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing * Foundations: semantics, rewrite systems and narrowing, type theory, proof systems * Implementation: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism * Applications: case studies, real-world applications, graphical user interfaces, internet applications, database connection, formal methods and model checking Submissions =========== Submissions must be unpublished and not submitted for publication elsewhere. Submissions should fall into one of the following two categories: 1. Regular research papers: they should describe new results and will be judged on originality, correctness and significance. 2. System descriptions: they should contain a link to a working system and will be judged on originality, usefulness and design. All submissions must be written in English. Regular research papers can be up to 15 proceedings pages long, system descriptions will be up to 4 pages long. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html The title page should indicate the submission category. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accesible otherwise (e.g. a link to a web page, or an appendix). Submission is Web-based. In order to submit a paper, authors should fill in the submission form available at http://www.ucm.es/info/flops2002/www/submit.html where more detailed instructions are given. If submission through the Web is not possible, five hard copies may be sent to Mario Rodriguez-Artalejo Universidad Complutense de Madrid Departamento de Sistemas Informaticos y Programacion Edificio Fac. Matematicas Av. Complutense s/n 28040 Madrid, Spain Publication and presentation of accepted contributions ====================================================== The Proceedings of FLOPS 2002 will be published by Springer Verlag in the LNCS series. They will be available at the conference. One author of each accepted contribution is expected to attend the Symposium in order to present it. Presentations of regular research papers will be scheduled for 30 minutes, including questions from the audience. System presentations will be scheduled for 15 minutes. Important Dates =============== Submission Deadline: March 1, 2002 Notification: May 21, 2002 Final Version: June 25, 2002 Symposium: September 15--17, 2002 Program Co-Chairs ================= Zhenjiang Hu University of Tokyo, Japan Mario Rodriguez-Artalejo Universidad Complutense, Madrid, Spain E-Mail: flops2002(a)ucm.es Program Committee ================= Maria Alpuente Technical University of Valencia, Spain Wei-Ngan Chin National University of Singapore, Singapore Pierre Deransart INRIA-Rocquencourt, France Moreno Falaschi University of Udine, Italy Michael Hanus University of Kiel, Germany Zhenjiang Hu (Co-Chair) University of Tokyo, Japan Jan Maluszynski Linkoeping University, Sweden Aart Middeldorp University of Tsukuba, Japan Gopalan Nadathur University of Minnesota, USA Susumu Nishimura Kyoto University, Japan Catuscia Palamidessi The Pennsylvania State University, USA Mario Rodriguez-Artalejo (Co-Chair) Universidad Complutense, Madrid, Spain Francesca Rossi University of Padova, Italy Harald Sondergaard The University of Melbourne, Australia Kazunori Ueda Waseda University, Japan Kwangkeun Yi KAIST, Korea Local Arrangements Chair ======================== Taro Suzuki University of Aizu, Japan Sponsors ======== Sponsored by: Japan Society of Software Science and Technology (JSSST), Special Interest Group on Principles of Programming. In cooperation with: Association for Logic Programming (ALP).

1 0

Re: Need help
by Ashley Yakeley 14 Jul '01

14 Jul '01

At 2001-07-14 01:08, Shirley Widyaningsih wrote: >In the book, it's said "in front of a terminal >screen, we'll see a displaying prompt sign "?", but in my terminal screen, >there's no ? prompt sign execpt the PRELUDE> prompt sign. That's correct. It means the Prelude (standard library sort of thing) was the last thing that successfully loaded, and that it's ready to interpret stuff. If you pass the name of a Haskell file to Hugs, it should load the Prelude and then load the file you gave it. -- Ashley Yakeley, Seattle WA

1 0

Need help
by Shirley Widyaningsih 14 Jul '01

14 Jul '01

--------------------------------------------- WANT A NEW JOB? THEN LET THE JOB FIND YOU Visit www.ecruit.com.au and register your profile. Then the headhunters can find you. --------------------------------------------- Get your own free email account at http://www.freemail.com.au/ now part of the Webuser.com.au independent portal. Visit at http://www.webuser.com.au ---------------------------------------------

1 0

Need help
by Shirley Widyaningsih 14 Jul '01

14 Jul '01

Hi, i've got some problem here. I'm a beginner in Haskell and i've already download haskell 98 <hugs98-feb2001>, but unfortunetly, i've bought books that used hugs 1.3 version. In the book, it's said "in front of a terminal screen, we'll see a displaying prompt sign "?", but in my terminal screen, there's no ? prompt sign execpt the PRELUDE> prompt sign. So could you all help me? do i have to set the hugs library or other after i downloading? my OS is windows 98. Thank you. Regards, Shirley --------------------------------------------- WANT A NEW JOB? THEN LET THE JOB FIND YOU Visit www.ecruit.com.au and register your profile. Then the headhunters can find you. --------------------------------------------- Get your own free email account at http://www.freemail.com.au/ now part of the Webuser.com.au independent portal. Visit at http://www.webuser.com.au ---------------------------------------------

1 0

Post-doc Positions Available at Stevens
by Adriana Compagnoni 13 Jul '01

13 Jul '01

We apologize if you have received multiple copies of this message. ---------------------------------------------------------------------- http://www.cs.stevens-tech.edu/Lab/SecureSystems_Lab/JoinUs.htm Post-Doctoral Positions Available Laboratory for Secure Systems Department of Computer Science Stevens Institute of Technology The Laboratory for Secure Systems at the Computer Science Department of Stevens Institute of Technology invites applications for Post-doctoral positions. The Lab has been recently created, and its mission is to pioneer new technologies for high-assurance and secure systems and prototype tools that can provide guarantees that a system will not exhibit unpredictable behavior in a hostile environment. Our objective is to consolidate and organize research already under way at Stevens. We are taking several approaches to language-based tools for high-assurance, secure systems. Language-based automated analysis can be used to check components during development and also at the point of deployment. Such analyses can complement trust-based approaches to security of mobile components and enhance performance by reducing overhead of run-time checking. Language-based tools fit the programming environments of professional practice, along side other tools like test-generators and performance profilers. Type-based analyses can prevent leakage of privileged data even with dynamic linking and replacement of libraries at run-time. New abstractions are being developed for fault-tolerant computation in wide area networks. Verification techniques can check correctness of implementations of security protocols. Much interest already exists in furthering the technologies, as demonstrated by collaborations of the faculty amongst themselves, with other academic institutions (e.g., with the Secure Internet Programming Laboratory at Princeton, with the FLINT project at Yale, with the University of Edinburgh), and with industrial partners (e.g., Lucent Technologies). Our work has current funding from industrial partners, through multiple grants from the National Science Foundation and the New Jersey Commission of Science and Technology. Successful applicants will be enthusiastic team players with a strong commitment to academic excellence. A PhD in Computer Science or Applied Mathematics or equivalent education is required. Preference will be given to applicants with experience in at least one of the following areas: *Type theory *Static program analysis *Formal verification *Semantics of programming languages *Higher-order programming languages *Implementation of programming languages Post-docs will participate in state of the art research in collaboration with other members of the Lab; they will produce technical reports to document their findings, and participate in building proof of concept software systems to experiment with research advances. The positions are initially for two years, renewable for a third year upon performance and availability of funds. Positions are expected to start with the new academic year in September 2001, but the starting date is flexible. Applicants should send a CV, a statement of research interests, and arrange for three letters of recommendation to be sent to: Adriana Compagnoni Department of Computer Science Stevens Institute of Technology Castle Point on Hudson Hoboken, NJ 07030 U. S. A. e-mail: abc(a)cs.stevens-tech.edu For more information contact Adriana Compagnoni (abc(a)cs.stevens-tech.edu) Dominic Duggan (dduggan(a)cs.stevens-tech.edu) or David Naumann (naumann(a)cs.stevens-tech.edu) Stevens Institute of Technology is an Equal Opportunity Employer. Laboratory for Secure Systems (http://www.cs.stevens-tech.edu/Lab/SecureSystems_Lab/) Computer Science Department (http://www.cs.stevens-tech.edu/) LocalWords: http www SecureSystems JoinUs htm docs initially CV dduggan LocalWords: Naumann

1 0

(no subject)
by Nelson 13 Jul '01

13 Jul '01

unsubscribe luti(a)linkexpress.com.br

1 0

RE: infelicity in module imports
by Simon Peyton-Jones 12 Jul '01

12 Jul '01

Folks It seems that I forgot to send this message a couple of weeks ago. Assuming that silence meant assent, I implemented the proposal below in the report I put out yesterday. But in this case silence meant you hadn't been asked (an excellent way to reach consensus that I must remember for the future). So here's the message anyway. I don't think it's controversial, since it's the outcome the cognoscenti were seeking, and no one else will care. Well, so I hope! Simon | > In short, an import *always* brings the entire *qualified* | > set of names into scope. Hiding and revealing applies only | > to unqualified names. I must say that I thought GHC implemented | > this rule; if not I should fix it. | | That's not my reading of the report, and it's not what GHC implements. | | import A (f) | | brings only f and A.f into scope. How embarassing. Now I look at it (yet) again, the report is certainly ambiguous about whether import A(f) imports A.g as well. But SimonM is right to say that the implication is that it does *not* (contrary to my earlier message). But if it does not, then the treatment of hiding and explicit-listing is inconsistent, which is a Bug. There are two consistent positions 1. Every import of module A (no matter how constrained) imports all of A's exports with qualified names. Import of qualified names is unaffected by both hiding clauses and the explicit entity list 2. The explicit entity list, or hiding clause, for an import determines which entities are imported. The qualified names of all these entities are brought into scope; in addition, for an unqualified import the unqualified names are brought into scope too. Everyone who has spoken favours (2), and indeed GHC implements it. So I propose to change the report to say that much more explicitly. Any objections? Simon

5 5

RE: infelicity in module imports
by Simon Peyton-Jones 12 Jul '01

12 Jul '01

| Even with option 2, there is scope for confusion. "Import" | without "qualified", imports both qualified and unqualified | names, but adding the word "qualified" doesn't make any | difference to the position of qualified names, but instead | silently fails to import unqualified names. True | There is still a | strange asymmetry, too. Whereas adding "qualified" to "import | Modname ( a, b, c)" doesn't change which entities are | imported, just the ability to refer to them by unqualified | names, adding qualified" to "import Modname hiding ( a, b, | c)" has the effect of importing everything that was previously hidden. Not so. I hope the Report now unambiguously states that import M hiding (a,b,c) import qualified M hiding(a,b,c) imports exactly the same entities (namely all that M exports except a,b,c), only in the latter case only the qualified names are brought into scope. Can you suggest a way I could state it more clearly in the Report? | Personally, I think the right solution is to import entire | modules (the exported parts) qualified, and optionally to | allow unqualified reference to some or all names, with a syntax like | import modid [as modid] [unqualifying ( [all except] | impspec] | all) | | but it's probably too late for this. Dead right! Simon

3 2

Another question wrt hiding imports
by Wolfgang Lux 12 Jul '01

12 Jul '01

After the recent discussion import hiding clauses in import declarations, I was wondering what the meaning of hiding clauses is in the case of algebraic data types (or classes). For instance if a have module A where data T = A | B which entities are imported when I include the declaration import A hiding(T) in a module? The report is not clear about this but I would expect that this imports data constructors A and B into the current module but not the type constructor T -- otherwise, what would be the meaning of import A hiding(T(B))? However, if this is true it is possible to export data constructors without their type via module B(module A) where import A hiding(T) which contradicts the statement in section 5.2 on p.64, that the form module m is equivalent to listing all entities imported from that module, because I cannot list a data constructor (without its type) in an export specification. Wolfgang -- Wolfgang Lux Phone: +49-251-83-38263 Institut fuer Wirtschaftinformatik FAX: +49-251-83-38259 Universitaet Muenster Email: wlux(a)uni-muenster.de

3 3