April 2013 - Haskell - Haskell.org

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

2nd CFP: SCSS 2013
by Temur Kutsia 18 Sep '13

18 Sep '13

[Please post - apologies for multiple copies.] Second Call for Papers SCSS 2013 Symbolic Computation in Software Science 5th International Symposium Castle of Hagenberg, Austria, July 5-6, 2013 Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz http://www.risc.jku.at/conferences/scss2013/ Scope -------- The purpose of SCSS 2013 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2013 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Joel Ouaknine (Oxford University, UK) Program Chair -------------- Laura Kovacs (Vienna University of Technology, Austria and Chalmers University of Technology, Sweden) Program Committee ------------------ María Alpuente (Technical University of Valencia, Spain) Serge Autexier (DFKI, Germany) Nikolaj Bjorner (Microsoft Research) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Iliano Cervesato (Carnegie Mellon University — Qatar Campus) Horatiu Cirstea (Loria, France) Jürgen Giesl (RWTH Aachen, Germany) Tetsuo Ida (University of Tsukuba, Japan) Paul Jackson (University of Edinburgh, UK) Tudor Jebelean (RISC, Johannes Kepler University Linz, Austria) Cezary Kaliszyk (University of Innsbruck, Austria) Fairouz Kamareddine (Heriot-Watt University, UK) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Stephan Merz (INRIA Lorraine, France) Ali Mili (New Jersey Institute of Technology, USA) Yasuhiko Minamide (University of Tsukuba, Japan) Pierre-Etienne Moreau (INRIA-LORIA Nancy, France) André Platzer (Carnegie Mellon University, USA) Stefan Ratschan (Czech Academy of Sciences) Rachid Rebiha (University of Lugano, Switzerland and IC Unicamp, Brazil) Enric Rodríguez Carbonell (Technical University of Catalonia, Spain) Sorin Stratulat (University of Lorraine, Metz, France) Thomas Sturm (Max Planck Institute for Informatics, Germany) Symposium Chair --------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Important Dates --------------- April 30, 2013: Abstract submission deadline May 3, 2013: Paper submission deadline June 3, 2013: Notification of acceptance June 17, 2013: Camera-ready copy deadline July 5-6, 2013: SCSS 2013, Castle of Hagenberg, Austria Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2013. Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings of SCSS 2013 will be published as a RISC technical report. After the symposium, authors of accepted papers at SCSS 2013 will be invited to submit an extended version of their paper to the special issue of the Journal of Symbolic Computation on SCSS. Submitted papers to the JSC special issue will undergo an additional reviewing.

2 1

[ANN] Hac Phi 2013
by Daniel Wagner 23 May '13

23 May '13

Hac Phi 2013, a Haskell hackathon/get-together, will be held June 7-9 at the University of Pennsylvania in Philadelphia. The hackathon will officially kick off at 2:30 Friday afternoon, and go until 5pm on Sunday (with breaks for sleep, of course). Last year's Hac Phi was a lot of fun, drawing more than 30 Haskellers, and many people have already expressed interest in coming back this year. Everyone is welcome - you do not have to be a Haskell guru. Helping hack on someone else's project could be a great way to increase your Haskell-fu. If you plan on coming, please officially register [1]. Registration, travel, lodging and many other details can be found on the Hac Phi wiki [2]. This year, we are making a public list of attendees' names and nicks - please let us know if you'd prefer not to be listed when you register. We're also looking for a few people interested in giving short (15-20 min.) talks, probably on Saturday afternoon. Anything of interest to the Haskell community is fair game - a project you've been working on, a paper, a quick tutorial. If you'd like to give a talk, add it on the wiki [3]. Hope to see you in Philadelphia! - The Hac Phi team Brent Yorgey (byorgey) Daniel Wagner (dmwit) Chris Casinghino (ccasin) [1] http://www.haskell.org/haskellwiki/Hac_%CF%86/Register [2] http://www.haskell.org/haskellwiki/Hac_%CF%86 [3] http://www.haskell.org/haskellwiki/Hac_%CF%86/Talks

1 1

BayHac '13
by Mark Lentczner 04 May '13

04 May '13

Please join us for a weekend of Haskell hacking: *BayHac '13* *May 17th ~ 19th, 2013* *Hacker Dojo* *Mountain View, CA* Full details on the Haskell Wiki: BayHac '13<http://www.haskell.org/haskellwiki/BayHac2013> - Mark

1 1

Summer school on Applied Functional Programming at Utrecht University; deadline for registration May 15
by Doaitse Swierstra 02 May '13

02 May '13

Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous four occasions students were all very happy with the school and we plan to repeat this success this year. Among the intended audience are prospective master students who gained an interest in Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In previous years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/USCS/ -- on this page you can find the poster you can print and hang somewhere (why not your office door): Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra, Atze Dijkstra and Johan Jeuring

2 1

Haskell T-Shirts
by Jeremy Wright 28 Apr '13

28 Apr '13

A friend of mine designed some T-Shirts. http://www.cafepress.com/haskellfunctionallazyhttp://www.cafepress.com/hask…

1 0

FHPC 2013: Call for papers
by Jost Berthold 26 Apr '13

26 Apr '13

===================================================================== CALL FOR PAPERS FHPC 2013 The 2nd ACM SIGPLAN Workshop on Functional High-Performance Computing Boston, Massachusets September 23, 2013 http://www.hiperfit.dk/fhpc13.html Co-located with the International Conference on Functional Programming (ICFP 2013) Submission Deadline: June 14, 2013 (anywhere on earth) ===================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. Such computations would typically -- but not necessarily -- involve execution on highly parallel systems ranging from multi-core multi-processor systems to graphics accelerators (GPGPUs), reconfigurable hardware (FPGAs), large-scale compute clusters or any combination thereof. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. Each FHPC workshop proposes a particular theme for applications where high-performance computing and/or functional programming technology can be applied. For FHPC 2013, the theme is "Large-Scale Simulation", traditionally one of the main driving forces behind supercomputing. A large fraction of compute cycles in supercomputers worldwide is spent on simulation tasks, for various engineering tasks, drug design and other medical simulations, and in different natural science domains. Declarative languages have potential to radically change development practice and workflow for simulation software in these areas. Hence, we particularly encourage submission of application-oriented contributions in the area of simulation. As a general rule, while proposing the theme, the workshop welcomes submissions from all relevant application domains as well as those describing general work on the theory and practice of declarative high-performance computing. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submission Deadline: 14 June 2013 (anywhere on earth) * Author Notification: 11 July 2013 * Final Papers Due : 25 July 2013 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (double column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. The page limit is 12 pages. Submission deadlines and page limit are firm. The FHPC workshops adhere to the ACM SIGPLAN policies regarding programme committee contributions and republication. Any paper submitted must adhere to ACM SIGPLAN's republication policy. PC member submissions are welcome, but will be reviewed to a higher standard. http://www.sigplan.org/Resources/Policies/Review http://www.sigplan.org/Resources/Policies/Republication Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm) Programme Committee: ==================== Umut Acar (co-chair), Carnegie Mellon U., PA, USA Arvind, MIT, MA, USA Jost Berthold (co-chair), U. of Copenhagen, Denmark Guy Blelloch, Carnegie Mellon U., PA, USA Hassan Chafi, Oracle Labs, CA, USA Dan Spoonhower, Google, CA, USA Sergei Gorlatch, U. Münster, Germany Clemens Grelck, U. of Amsterdam, Netherlands Vinod Grover, NVidia, USA Torsten Grust, U.Tübingen, Germany Zhenjiang Hu, National Inst. of Informatics, Tokyo, Japan Gabriele Keller, U.New South Wales, Sydney, Australia Jens Palsberg, U.California, CA, USA Leaf Peterson, Intel, USA Mike Rainey, MPI-SWS,Kaiserslautern, Germany Suresh Jaganathan, Purdue U., USA Sven-Bodo Scholz, Heriot-Watt U., Edinburgh, UK Guy Steele, Oracle Labs, Burlington, MA, USA Yaron Minsky, Jane Street Capital, NY, USA General Chairs: ==================== Clemens Grelck, University of Amsterdam, NL Fritz Henglein, University of Copenhagen, DK

1 0

MEMOCODE 2013: Call for papers
by Emil Axelsson 26 Apr '13

26 Apr '13

CALL FOR PAPERS - MEMOCODE 2013 Eleventh ACM/IEEE International Conference on Formal Methods and Models for Codesign http://www.memocode-conference.com 18-20 October 2013, Portland, Oregon, USA Co-located with DIFTS and FMCAD SCOPE The eleventh ACM/IEEE MEMOCODE conference focuses on research and developments in methods, tools, and architectures for the design of hardware/software systems. MEMOCODE seeks submissions that present novel formal methods and design techniques to create, refine, and verify complex hardware/software systems and to tackle the tight constraints on timing, power, costs, reliability and security that these systems face. We also invite application-oriented papers, and especially encourage submissions that highlight the tools and design perspective of formal methods and models, including success as well as failure stories, constructive analysis thereof, and demonstrations of hardware/software codesign. Techniques may range from formal verification to simulation-based verification technologies, and from languages to design paradigms that unify hardware and software codesign. Architectures may range from cloud computing and multi-core platforms to networks on chip. Applications and demonstrators may address values ranging from productivity and reuse to performance and quality. PAPER SUBMISSIONS Paper submissions must be accepted through the EasyChair review system on our web site. Papers must be 10 pages or less, and must be formatted following IEEE Computer Society guidelines. Submissions must be written in English, describe original work, and not substantially overlap papers that have been published or are being submitted to a journal or another conference with published proceedings. Abstract submission deadline: May 8 Paper submission deadline: May 15 Notification of acceptance: June 19 Final version for Papers: July 17 DESIGN CONTEST MEMOCODE 2013 is proud to organize its traditional Design Contest. The conference will sponsor at least one prize with a significant monetary award. Each team delivering a complete and working solution will be invited to prepare a 2-page abstract to be published in the proceedings and to present it during a dedicated poster session at the conference. The winning teams may contribute a 4-page short paper for presentation in the conference program. Further information will be made available on our website. Design Contest start: May 15 Design submission deadline: June 12 Notification of design results: June 19 Final version for abstracts: July 17 PUBLICATION Conference proceedings will be published by the IEEE Computer Society. Besides conference proceedings, we are planning a special journal issue with the very best 2013 papers of MEMOCODE, DIFTS, and FMCAD.

1 0

Haskell training in San Francisco Bay Area and New York
by Duncan Coutts 25 Apr '13

25 Apr '13

Well-Typed are offering Haskell courses in the San Francisco Bay Area and New York in early June. They are for professional developers who want to learn Haskell or improve their skills. There is a 2-day introductory course and a 2-day advanced course. Full course and registration details: http://www.well-typed.com/services_training Well-Typed are running these courses in partnership with FP Complete and Skills Matter. Locations, dates ================ San Francisco Bay Area * Introductory Course: June 4-5th, 2013 * Advanced Course: June 6-7th, 2013 New York * Introductory Course: June 10-11th, 2013 * Advanced Course: June 12-13th, 2013 * Early bird discount before April 29th -- Duncan Coutts, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0