- Haskell - Haskell.org

CFP: 25th Int'l Conf. on Compiler Construction (CC) - Final Call
by Manuel Hermenegildo 22 Nov '15

22 Nov '15

[ Please forward. Apologies for any duplicates. ] ********************************************************************** FINAL CALL FOR PAPERS 25th International Conference on Compiler Construction (CC 2016) March 17-18 2016, Barcelona, Spain Co-located with CGO, HPCA, PPoPP, and EuroLLVM http://cc2016.eew.technion.ac.il/ ********************************************************************** Important dates --------------- Abstracts due: 23 November 2015 Papers due: 30 November 2015 (any time zone) Author notification: 27 January 2016 Camera ready versions: 10 February 2016 Conference: 17-18 March 2016 Information ----------- The International Conference on Compiler Construction (CC) is interested in work on processing programs in the most general sense: analyzing, transforming or executing input that describes how a system operates, including traditional compiler construction as a special case. Original contributions are solicited on the topics of interest which include, but are not limited to: - Compilation and interpretation techniques, including program representation, analysis, and transformation; code generation and optimization; - Run-time techniques, including memory management, virtual machines, and dynamic and just-in-time compilation; - Programming tools, including refactoring editors, checkers, verifiers, compilers, debuggers, and profilers; - Techniques for specific domains, such as secure, parallel, distributed, embedded or mobile environments; - Design and implementation of novel language constructs and programming models. CC 2016 is the 25th edition of the conference. It will be co-located with CGO, HPCA, PPoPP, and EuroLLVM on March 17-18 2016, in Barcelona, Spain. Submission ---------- Papers should be submitted electronically via EasyChair at https://easychair.org/conferences/?conf=cc2016. Papers must be written in English and be submitted in pdf in ACM SIGPLAN proceedings format (http://www.sigplan.org/Resources/Author/, using the default 9pt font size). The proceedings will be published in the ACM Digital Library and will be made available freely for the period around the conference. Both regular papers (up to 11 pages) and tool papers (up to 2 + 3 pages), are invited. In tool papers the first part (2 pages) should describe the tool and the second (3 pages) explain the contents of the demo that will be presented with examples and screenshots. Submissions must adhere strictly to the page limits, including bibliography, figures, or appendices. Submissions that are clearly too long may be rejected immediately. Additional material intended for reviewers but not for publication in the final version ( listings, data, proofs) may be included in a clearly marked appendix. Submitted papers must be unpublished and not be submitted for publication elsewhere. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Organizers ---------- General Chair Ayal Zaks Intel and Technion, Israel Program Committee Chair Manuel Hermenegildo IMDEA SW Institute and Technical U. of Madrid, Spain Program Committee Raj Barik, Intel Labs, Santa Clara, CA Uday Bondhugula, IIS Bangalore Matthew Flatt U. of Utah Maria Garzaran, U. of Illinois UC and Intel Laurie Hendren, McGill U. Manuel Hermenegildo, IMDEA and T.U. Madrid Xavier Leroy, INRIA Ondrej Lhotak, U of Waterloo Francesco Logozzo, Facebook Antoine Mine, Ecole Normale Superieure, Paris Jose Morales, IMDEA SW Diego Novillo, Google Jens Palsberg, UCLA Xipeng Shen, North Carolina State University Vijay Sundaresan, IBM Walid Taha, Halmstadt U. Zheng Wang, Lancaster U. Steering Committee Koen De Bosschere, Ghent U. Bjoern Franke, U. of Edinburgh Michael O'Boyle, U. of Edinburgh Albert Cohen, INRIA Web site http://cc2016.eew.technion.ac.il/

1 0

SIGPLAN John C Reynolds Doctoral Dissertation Award
by Jeremy Gibbons 22 Nov '15

22 Nov '15

Dear All, I would like to draw your attention to the SIGPLAN John C. Reynolds Doctoral Dissertation Award. If you are (or will be) a 2015 PhD graduate with a great thesis or a supervisor of such a graduate can I suggest you consider applying? Obtaining such an award makes a person stand out when applying for positions. The nomination process is straightforward and nominations are due on the 5th of January. Details of the award can be found at http://www.sigplan.org/Awards/Dissertation/ . If you have any questions, please contact Susan Eisenbach (CC'd). Cheers, Jeremy Jeremy.Gibbons(a)cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/

1 0

NNOUNCE: Haskell Communities and Activities Report (29th ed., November 2015)
by Mihai Maruseac 21 Nov '15

21 Nov '15

On behalf of all the contributors, we are pleased to announce that the Haskell Communities and Activities Report (29th edition, November 2015) is now available, in PDF and HTML formats: http://haskell.org/communities/11-2015/report.pdf http://haskell.org/communities/11-2015/html/report.html Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. We hope you will find it as interesting a read as we did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline) to the call. The editors collect all the contributions into a single report and feed that back to the community. When we try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ======================================== End of March 2015: target deadline for contributions to the May 2015 edition of the HCAR Report ======================================== Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editors for a simple e-mail reminder in March (you could point us to them as well, and we can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Mihai Maruseac <hcar at haskell.org> -- Mihai Maruseac (MM) "If you can't solve a problem, then there's an easier problem you can solve: find it." -- George Polya

1 0

ANN: cacophony 0.4.0, pipes-cacophony 0.1.2
by John Galt 20 Nov '15

20 Nov '15

cacophony[1] is a library which implements the Noise[2] protocol. Noise is a framework for cryptographic protocols based on ECDH key agreement authored by Trevor Perrin. pipes-cacophony[3] builds on cacophony to provide pipes that facilitate key agreement and secure messaging (in conjunction with, for example, pipes-network). -- John [1] http://hackage.haskell.org/package/cacophony [2] https://github.com/trevp/noise/blob/master/noise.md [3] http://hackage.haskell.org/package/pipes-cacophony

1 0

Re: [Haskell] [Coq-Club] ANN: linearscan, linearscan-hoopl 1.0.0
by John Wiegley 20 Nov '15

20 Nov '15

>>>>> Beta Ziliani <bziliani(a)famaf.unc.edu.ar> writes: > I'd be interested to know what was the outcome of the project from the point > of view of BEA Systems. Is there any report about it? >From BAE's point of view, we gained some industrial perspective. Separately, I have prepared an experience report that is currently seeking a venue. John

1 0

On Hiatus Until January 2016: Haskell Weekly News
by Kim-Ee Yeoh 20 Nov '15

20 Nov '15

Regrettably, I must announce that Haskell Weekly News will go on hiatus until the new year. I recognize that the last issue was back in September. It's been said that "The more a man possesses over and above what he uses, the more careworn he becomes." In my case, mundane possessions have indeed insisted on being attended to. I wish every reader a fine holiday season. -- Kim-Ee Editor of Haskell Weekly News

1 0

ANN: linearscan, linearscan-hoopl 1.0.0
by John Wiegley 20 Nov '15

20 Nov '15

linearscan[1] is a linear scan register allocator[2], written in Coq[3], and extracted to Haskell, as a library for Haskell programs that need to allocate registers. It may also be used directly from Coq. This project is the result of a year-long effort, funded by BAE Systems[4], to explore the application of dependent-types and mathematical verification to a typical engineering task. During the course of construction, several hundred theorems about the code were proven -- although exhaustive coverage was not, in the end, achievable given our time constraints. To remedy this, and as a test of the extraction to Haskell, an optional runtime verifier was built to certify the resulting allocations. Coq 8.5b2[5] was used, as well as the ssreflect[6] library created for that version[7]. linearscan further relies on another library, coq-haskell[8], that I created to facilitate inter-operation between Haskell and Coq. For those using Hoopl[9] to represent program graphs, incorporating linearscan is quite easy: provide an instance of NodeAlloc using the linearscan-hoopl[10] library. Examples of doing so are provided in the test suite for that library. The allocation algorithm implemented by this library was first written in Java by Hanspeter Mössenböck and Michael Pfeiffer[11], and later improved upon by Christian Wimmer[12], whose master's thesis provided the specification for our implementation. John Wiegley BAE Systems Footnotes: [1] http://hackage.haskell.org/package/linearscan [2] http://www.cs.ucla.edu/~palsberg/course/cs132/linearscan.pdf [3] https://coq.inria.fr/ [4] http://www.baesystems.com/en-us/our-company/inc-businesses/electronic-syste… [5] https://coq.inria.fr/news/125.html [6] http://ssr.msr-inria.inria.fr/ [7] http://ssr.msr-inria.inria.fr/FTP/ [8] https://github.com/jwiegley/coq-haskell [9] https://hackage.haskell.org/package/hoopl [10] http://hackage.haskell.org/package/linearscan-hoopl [11] http://dl.acm.org/citation.cfm?id=647478.727924 [12] http://www.christianwimmer.at/Publications/Wimmer04a/

1 0

Call for papers: PLACES 2016
by Dominic Orchard 20 Nov '15

20 Nov '15

PLACES 2016 – Call for papers http://places16.by.di.fc.ul.pt 9th Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software Co-located with ETAPS 2016, Eindhoven, The Netherlands *********************************************************** Modern hardware platforms, from the very small to the very large, increasingly provide parallel computing resources which software may use to maximise performance. Many applications therefore need to make effective use of tens, hundreds, and even thousands of compute nodes. Computation in such systems is thus inherently concurrent and communication centric. Effectively programming such applications is challenging; performance, correctness, and scalability are difficult to achieve. Various programming paradigms and methods have emerged to aid this task, including structured imperative concurrent programming, stream-based programming, parallel skeletons, concurrent functions with asynchronous message passing, automatic parallelisation, and the use of types to describe communications and data structures (such as session and linear types), to name but a few. To fully exploit a (possibly heterogeneous) parallel computing environment often requires these approaches to be combined, depending on the shape of the data and control flow. All the while, the underlying runtime environment must ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for this increasingly parallel landscape therefore demands exploration and understanding of a wide variety of foundational and practical ideas. This workshop offers a forum where researchers from different fields can exchange new ideas on this key challenge to modern and future programming- where concurrency and distribution are the norm rather than a marginal concern. Submissions are invited in the general area of programming language approaches to concurrency, communication and distribution, ranging from foundational issues, through language implementations, to applications (such as scientific computing) and case studies. Specific topics include, but are not limited to: * Design and implementation of programming languages with first class support for concurrency and communication * Behavioural types, including session types * Concurrent data types, objects and actors * Verification and program analysis methods for concurrent and distributed software * Runtime systems for scalable management of concurrency and resource allocation * High-level programming abstractions addressing security concerns in concurrent and distributed programming * Multi- and many-core programming models, including methods for harnessing GPUs and other accelerators * Memory models for concurrent programming on relaxed-memory architectures * Integration of sequential and concurrent programming techniques * Use of message passing in systems software * Interface languages for communication and distribution * Novel programming methodologies for sensor networks * Programming language approaches to web services * Concurrency and communication in event processing and business process management Papers are welcome which present novel and valuable ideas as well as experiences. Submissions should be (at most) 6-page extended abstracts in EPTCS format and can also include an appendix of up to 4 pages. An abstract should be registered via the EasyChair submission site (https://easychair.org/conferences/?conf=places16) by January 8th with the paper submitted by January 15th (anywhere-on-Earth). There will be a post-proceedings special issue in JLAMP (Journal of Logic and Algebraic Methods) after the workshop which will be open to anyone (with a further round of reviewing). Abstract submission: 8 January 2016 Paper submission: 15 January 2016 Notification: 12 February 2016 Camera-ready copy: 24 February 2016 ETAPS early-registration deadline: 1 March 2016 PLACES workshop: 8 April 2016 Submission deadlines are anywhere on Earth. Website: http://places16.by.di.fc.ul.pt Programme chairs: Dominic Orchard, Nobuko Yoshida Programme committee: * Francisco Martins, University of Lisbon * Heather Miller, EPFL * Fabrizio Montesi, University of Southern Denmark * Dominic Orchard, University of Cambridge / Imperial College London (co-chair) * Josef Svenningsson, Chalmers * Francesco Tiezzi, University of Camerino * Bernardo Toninho, Imperial College London * Steven Wright, University of Warwick * Nobuko Yoshida, Imperial College London (co-chair) * Lukasz Ziarek, University at Buffalo Organising committee: Simon Gay, Alan Mycroft, Vasco T. Vasconcelos, Nobuko Yoshida

1 0

Registration now open: Haskell in Leipzig (Germany) December 4/5
by Johannes Waldmann 13 Nov '15

13 Nov '15

Register now - for Amazing Talks and Thrilling Tutorials: HaL-10 Haskell in Leipzig December 4/5 http://nfa.imn.htwk-leipzig.de/HAL2015/ Opens with an invited talk by Joachim Breitner on MonadFix, closes with a presentation of Liquid Haskell by Michael Beaumont. - Johannes Waldmann. PS: HaL-1 (in 2006, on quite the same day) also had a MonadFix talk. Well of course, this has something to do with recurrence...

1 0

Leuven Haskell User Group: Season 2
by Tom Schrijvers 09 Nov '15

09 Nov '15

Dear Haskellers, Season 2 of the Leuven Haskell User Group starts on November 17. Join us for an introductory talk on type classes. Everyone is welcome. For more information: http://www.meetup.com/Leuven-Haskell-Users-Group/ http://groups.google.com/forum/#!forum/leuven-haskell See you there! -- prof. dr. ir. Tom Schrijvers Research Professor KU Leuven Department of Computer Science Celestijnenlaan 200A 3001 Leuven Belgium Phone: +32 16 327 830 http://people.cs.kuleuven.be/~tom.schrijvers/

1 0