November 2015 - Haskell

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

Call for Papers (UTP 2016)
by Huibiao Zhu 07 Nov '15

07 Nov '15

Call for Papers UTP 2016 6th International Symposium on Unifying Theories of Programming June 45, 2016, Reykjavík, Iceland, Co-located with iFM 2016 http://utp2016.ecnu.edu.cn Overview Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent years. The theories define, in various different ways, many common notions, such as abstraction, refinement, choice, termination, feasibility, locality, concurrency and communication. Despite these differences, such theories may be unified in a way which greatly facilitates their study and comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artifacts of software development in a seamless, logically consistent way. Hoare and He's Unifying Theories of Programming (UTP) is widely acknowledged as one of the most significant such unification approaches. Based on their pioneering work, the aims of the UTP Symposium series are to reaffirm the significance of the ongoing UTP project and to stimulate efforts to advance. The Symposium provides a focus for the sharing of results by those already actively contributing, and raises awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. To this end the Symposium welcomes contributions on all the themes that can be related to the Unifying Theories of Programming. Venue and Event UTP 2016 will be held at Reykjavík, Iceland on 4 - 5 June 2016, co-located with iFM 2016. Important Dates Abstracts due: 19 February, 2016 Papers due: 4 March, 2016 Author notification: 15 April, 2016 Camera-ready for pre-proceedings: 29 April, 2016 Symposium: 4-5 June, 2016 Invited Speakers Tony Hoare (Microsoft Research, Cambridge, UK) Jifeng He (East China Normal University, China) PC Chairs Jonathan Bowen (London South Bank University) Huibiao Zhu (East China Normal University) Programme Committee: Ana Cavalcanti, University of York, United Kingdom. Yifeng Chen, Peking University, China. Andrew Butterfield, Trinity College Dublin, Ireland. Jeremy Gibbons, University of Oxford, United Kingdom. Lindsay Groves, Victoria University of Wellington, New Zealand. Walter Guttmann, University of Canterbury, New Zealand. Ian Hayes, University of Queensland, Austria. Jeremy Jacob, University of York, United Kingdom. Zhiming Liu, Birmingham City University, United Kingdom. David Naumann, Stevens Institute of Technology, USA. Marcel Oliveira, Universidade Federal do Rio Grande do Norte, Brazil. Shengchao Qin, Teesside University, United Kingdom. Georg Struth, University of Sheffield, United Kingdom. Jun Sun, Singapore University of Technology and Design, Singapore. Meng Sun, Peking University, China. Burkhart Wolff, University of Paris-Sud, France. Naijun Zhan, Chinese Academy of Sciences, China. Yongxin Zhao, East China Normal University, China. Frank Zeyda, Teesside University, United Kingdom. Submissions Papers may be up to 20 pages in length and should be prepared using LaTeX in Springer LNCS paper format. Submissions should be made through the UTP 2016 EasyChair site, https://www.easychair.org/conferences/?conf=utp2016 . Publication Symposium post-proceedings will appear in Springer's Lectures Notes in Computer Science, as in past editions of the Symposium. (To be confirmed.) Previous UTP Symposia UTP 2016 is the 6th symposium in the UTP series. The past UTP symposia were successfully held in Durham ('06), Dublin ('08), Shanghai ('10), Paris ('12), Singapore ('14).

1 0

CFP: 25th Int'l Conf. on Compiler Construction (CC) - *new deadline*
by Manuel Hermenegildo 03 Nov '15

03 Nov '15

[ Please forward. Apologies for any duplicates. ] ********************************************************************** 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 (updated) Papers due: 30 November 2015 (updated) 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

ANN: dimensional-1.0 for statically checked physical dimensions
by Douglas McClean 02 Nov '15

02 Nov '15

Hello Haskellers, Björn Buckwalter and I are pleased to announce the release to Hackage of version 1.0 of the dimensional library, which statically tracks physical dimensions in Haskell code, as in the example below, preventing dimensional mistakes and requiring explicit documentation of units where raw values are exchanged with external systems. {-# LANGUAGE NoImplicitPrelude #-} module Example where import Numeric.Units.Dimensional.Prelude import Numeric.Units.Dimensional.NonSI -- a function that computes with dimensional values escapeVelocity :: (Floating a) => Mass a -> Length a -> Velocity a escapeVelocity m r = sqrt (two * g * m / r) where two = 2 *~ one g = 6.6720e-11 *~ (newton * meter ^ pos2 / kilo gram ^ pos2) >>> let re = 6372.792 *~ kilo meter >>> let me = 5.9742e24 *~ kilo gram >>> let ve = escapeVelocity me re >>> ve -- Show defaults to SI base units 11184.537332296259 m s^-1 >>> showIn (mile / hour) ve -- but we can show in other units "25019.09746845083 mi / h" >>> let vekph = ve /~ (kilo meter / hour) -- and extract raw values when needed 40264.33439626653 This version is a major upgrade, consolidating features from the classic dimensional package and the dimensional-tf package. It takes advantage of the DataKinds and ClosedTypeFamilies extensions in GHC 7.8 to offer even safer types with a nearly identical interface. Also included: - Units carry names which can be combined by multiplication, division, and (only where appropriate) application of metric prefixes. You can use expressions like: showIn (milli meter / second) timeTravelSpeed to get "39339.52 mm / s" - Exact conversion factors between units are available, even when those conversion factors involve multiples of pi, thanks to the exact-pi library - The dimensionally-polymorphic siUnit term represents the coherent SI base unit of any dimension, which can be convenient for wrapping and unwrapping quantities in some contexts. - Storable and Unbox instances for Quantity types are available thanks to the efforts of Alberto Valverde González. - The Numeric.Units.Dimensional.Dynamic module offers types for safely manipulating quantities and units whose dimensions are not known statically. Also available is a term-level representation for dimensions. - Several other missing instances have been provided, including Bounded, Data, and Typeable instances. - New commonly used US customary units have been added, including US fluid measures and the knot. We have several other development efforts underway, including a type-checker plugin inspired by Adam Gundry's work, and on which he has provided valuable advice, which we hope will lead to a clean library for dimensionally typed linear algebra. Comments and contributions are welcome at http://github.com/bjornbm/dimensional-dk. (The repository name is a carryover from the name we were using while developing this version.) One particularly welcome contribution would be assistance with developing a patch for GHC issue 10391 <https://ghc.haskell.org/trac/ghc/ticket/10391>. Cheers, Doug McClean

1 0

ANN: cereal-0.5.0.0
by Trevor Elliott 02 Nov '15

02 Nov '15

Hi Everyone, I'm happy to announce the release of version 0.5.0.0 of the cereal serialization library. This release comes with two breaking changes: * The encoding of Float and Double has switched from using `encodeFloat` to using the Data.Serialize.IEEE754 module * The Builder module has been removed in favor of the implementation in bytestring Happy hacking! --trevor

1 0