- Haskell - Haskell.org

ANN: shelltestrunner 1.3
by Simon Michael 28 Dec '12

28 Dec '12

I'm pleased to announce the release of shelltestrunner 1.3. New in this release: * support latest Diff, cmdargs, test-framework; tested with GHC 7.6.1 (Magnus Therning) * fix unicode handling on GHC >= 7.2 shelltestrunner tests command-line programs (or arbitrary shell commands.) It reads simple declarative tests specifying a command, some input, and the expected output, and can run them run in parallel, selectively, with a timeout, in color, and/or with differences highlighted. shelltestrunner has been tested on gnu/linux, mac and windows; projects using it include hledger, berp, cblrepo and eddie. shelltestrunner is free software released under GPLv3+. Home: http://joyful.com/shelltestrunner Install: $ cabal install shelltestrunner

1 0

ANN: Disciplined Disciple Compiler (DDC) 0.3.1
by Ben Lippmeier 23 Dec '12

23 Dec '12

The Disciplined Disciple Compiler Strike Force is pleased to announce the release of DDC 0.3.1. DDC is a research compiler used to investigate program transformation in the presence of computational effects. This is a development release. There is enough implemented to experiment with the core language, but not enough to write real programs. New Features ~~~~~~~~~~~~ * Compilation via C and LLVM for first-order programs. * Cross-module inlining. * An effect-aware rewrite rule framework. * Generation of LLVM aliasing and constancy meta-data. * More program transformations: Beta (substitute), Bubble (move type-casts), Elaborate (add witnesses), Flatten (eliminate nested bindings), Forward (let-floating), Namify (add names), Prune (dead-code elimination), Snip (eliminate nested applications). People ~~~~~~ The following people contributed to DDC since the last release: Tran Ma - LLVM aliasing and constancy meta-data. Amos Robinson - Rewrite rule system and program transforms. Erik de Castro Lopo - Build framework. Ben Lippmeier - Code generators, framework, program transforms. Full release notes: http://code.ouroborus.net/ddc/ddc-stable/RELEASE Further reading: http://disciple.ouroborus.net/ For the impatient: cabal update; cabal install ddc-tools

1 0

ANN: hsc3-process-0.8 and hsc3-server 0.5
by Stefan Kersten 20 Dec '12

20 Dec '12

I am happy to announce the release of version 0.8 of hsc3-process [1] and version 0.5 of hsc3-server [2], both providing additional features and abstractions for the excellent hsc3 interface [3] to the SuperCollider synthesis server [4]. hsc3-process allows to start external scsynth processes and run actions that communicate through the associated OpenSoundControl transport. hsc3-server builds on hsc3 and hsc3-process and adds the following features: * A `Server' monad for accessing synthesis server state from concurrent threads, * Resource ID allocators for nodes, buffers and buses, * A composable `Request' abstraction that allows to assemble synchronous and asynchronous server commands into OpenSoundControl bundles for efficient scheduling, * A type-safe interface to the SuperCollider synthesis server command set. hsc3-server has been in use internally for some time but this is the first release that is ready for consumption by the general public. Have a look at some examples here [5]. Any feedback welcome! Happy synthesis! [1] http://hackage.haskell.org/package/hsc3-process [2] http://hackage.haskell.org/package/hsc3-server [3] http://hackage.haskell.org/package/hsc3 [4] http://supercollider.sourceforge.net/ [5] https://github.com/kaoskorobase/hsc3-server/tree/master/examples

1 0

PLPV 2013 call for participation
by Andreas Abel 19 Dec '12

19 Dec '12

You are cordially invited to participate in the Seventh ACM SIGPLAN Workshop on Programming Languages meets Program Verification Date: 22 January 2013 Location: Rome, in conjunction with POPL 2013 Program : http://plpv.tcs.ifi.lmu.de/ Edwin Brady will talk at 10:30am on Idris: General Purpose Programming with Dependent Types Further, we have 7 contributed talks on verification of programming languages, complexity and security, and functional reactive programming. Early registration until 31 December 2012! Best regards, Andreas Abel and Tim Sheard -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich Oettingenstr. 67, D-80538 Munich, GERMANY andreas.abel(a)ifi.lmu.de http://www2.tcs.ifi.lmu.de/~abel/

1 0

CFP: EOOLT 2013
by Henrik Nilsson 19 Dec '12

19 Dec '12

Dear Haskellers, The included call for papers to the 5th international workshop on Equation-based Object-Oriented Languages and Tools (EOOLT) 2013 may be of interest to those interested in declarative domain-specific languages in the context of Haskell. EOOLT 2013 is now open for submission. Apologies for multiple copies! All the best, /Henrik -- Henrik Nilsson School of Computer Science The University of Nottingham nhn(a)cs.nott.ac.uk This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

TAP 2013: 2nd Call for Papers
by Achim D. Brucker 18 Dec '12

18 Dec '12

(Apologies if you receive this announcement multiple times.) **************************************************** *** *** *** TAP 2013 *** *** *** *** Abstract submission: January 25, 2013 *** *** Paper submission: February 1, 2013 *** **************************************************** *** TAP 2013 solicits both full papers and *** *** (industrial) experience/tool papers *** *** in combining proofs and (security) testing *** **************************************************** CALL FOR PAPERS 7th INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) http://www.spacios.eu/TAP2013 Budapest, Hungary, June 18-19, 2013 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security Important Dates: ================ Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 Program Chairs: =============== Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) Program Committee: ================== Paul Ammann Dirk Beyer Achim D. Brucker Robert Clarisò Marco Comini Catherine Dubois Gordon Fraser Angelo Gargantini Christoph Gladisch Martin Gogolla Arnaud Gotlieb Wolfgang Grieskamp Reiner Hähnle Bart Jacobs Thiérry Jeron Jacques Julliand Gregory Kapfhammer Nikolai Kosmatov Victor Kuliamin Michael Leuschel Karl Meinke Alexandre Petrenko Holger Schlingloff T.H. Tse Margus Veanes (co-chair) Luca Viganò (co-chair) Burkhart Wolff Fatiha Zaidi Submission: =========== Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Subject to final approval by Springer, accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP AG, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/

1 0

ANN: Haskell bindings for the igraph C library
by Nils Schweinsberg 17 Dec '12

17 Dec '12

Hi Haskellers, dear igraph community, I am pleased to announce the release of our (inofficial) Haskell bindings to the igraph C library. igraph is a powerfull library for creating and manipulating directed, undirected and weighted graphs. Our package offers a complete coverage of all functions on structural properties of graphs. Compared to the official packages for R and Python it is the first library that offers type level distinction between directed/undirected and weighted graphs. Haskells type system allows to keep track of the types of your nodes and whether or not your graph and its edges are directed or undirected, weighted or unweighted. Haskell graphs may contain any Haskell value as node values, kind of similar to Pythons attributes. igraph on hackage, the official package database for Haskell: http://hackage.haskell.org/package/igraph (requires the current igraph-0.6 C library) The official igraph website: http://igraph.sourceforge.net/index.html Until hackage generates the haddock documentation, the documentation is also available at: http://hs.nils.cc/igraph-0.1/html/index.html Any feedback is appreciated, - Nils Schweinsberg - George Giorgidze

2 2

ANN: JMacro 0.6 and JMacro-RPC, featuring cross-platform json-rpc, easy AJAX applications, evented reactive panels and more
by Gershom Bazerman 17 Dec '12

17 Dec '12

jmacro: http://hackage.haskell.org/package/jmacro jmacro-rpc: http://hackage.haskell.org/package/jmacro-rpc jmacro-rpc-snap: http://hackage.haskell.org/package/jmacro-rpc-snap jmacro-rpc-happstack: http://hackage.haskell.org/package/jmacro-rpc-happstack I'm happy to announce the release of JMacro 0.6 (0.6.3 actually) which brings a host of improvements. JMacro is a quasiquoted library for the programmatic generation of JavaScript code. It lets you write in a superset of JavaScript with haskell-like syntax and compile-time guarantees of syntactic correctness, and is intended to be used for both embedded javascript and compilers and libraries targeting JavaScript--where hygienic naming, proper scoping, and anti-quotation are especially important. Documentation is on the Haskell Wiki: http://www.haskell.org/haskellwiki/Jmacro This release brings a host of improvements to efficiency, driven largely by user-submitted patches and requests. Text is used more uniformly, as opposed to String, and JSON integration is provided via aeson rather than the json package. Additionally, nearly all of JavaScript is supported, including more obscure operators, as well as labels, and labeled break and continue. The big news, however, is JMacro-RPC, which provides multi-server tools for serving JSON-RPC 2.0 [1] remote procedure calls, as well as binding to them from both Haskell and JavaScript. On the Haskell side, rpc server functions and caller stubs are automatically generated by typeclasses. On the JavaScript side, which is less typed, a function is exposed to marshall javascript function arguments directly into RPC calls to a located URL. [1] http://jsonrpc.org/specification On top of these RPCs, JMacro-RPC provides the conversation page abstraction, which allows the easy creation of web-applications with server side state. The user simply provides a function from JavaScript -> Page that splices in some JavaScript, and a list of functions they wish to be accessible from the page. All JavaScript within the page then has access to these functions, which run, transparently, server-side, with access to page-invocation-local shared state. Backends exist for JMacro-RPC for Happstack and Snap, and can be easily written for any other server or framework. JMacro-RPC now also provides the Panels library, which is even higher-level, providing the convenience of continuation-style web development with no scaling hassle. On the server side, Panels are entirely stateless, storing no client-specific state (so requests can be sharded to multiple servers as well without worrying about session replication). Code is written with a set of combinators over Panels, which package up display and behavior simultaneously. Panels, inspired by FRP, can provide Signals, which are sampleable, Events, which are discrete and can trigger updates, and Sinks which can be bound to Signals (behaving similarly to FRP wormholes). Semantics, by virtue of client-server interaction, are necessarily evented rather than continuous. As such, this is properly a system for declarative, event-driven reactivity rather than genuine FRP. Such a system is impoverished compared to the richer continuous-time or fully stream-based discrete-time semantics provided by of real FRP libraries. However, it is more than powerful enough for the sorts of user interfaces Panels are designed to build, and holds the added advantage of being straightforward, tractable, and a tight fit for client-server interactions. While Signals are applicative and Sinks are contravariant functors, which exposes at least some flavor of FRP, simple Signals and Sinks which don't require server-side processing (and are safely distinguished as such by types) can be bound to one-another purely on the client-side, avoiding unnecessary round-trips. The Panels code combines concepts from FRP [1][2], Self-Adjusting Computation [3], ASP.NET update panels [4], and research in stable naming schemes for bound variables [5]. The JavaScript "rts" driving evented updates is designed to be reasonably efficient and leak-free. Between basic RPCs, Conversations, and Panels, JMacro-RPC is intended to provide the full "power scale" for writing robust AJAX web applications with complex server-side logic. Because it is designed to be usable from any Haskell web framework or server, it is suitable for widespread adaptation. Patches, bug-reports, contributions, feature requests, documentation, etc. all are very welcome. [1] http://www.haskell.org/haskellwiki/Functional_Reactive_Programming [2] http://stackoverflow.com/questions/1028250/what-is-functional-reactive-prog… [3] http://www.umut-acar.org/self-adjusting-computation [4] http://msdn.microsoft.com/en-us/library/bb399001(v=vs.100).aspx [5] http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.6645 ("I am not a number: I am a free variable", McBride and McKinna. See section four, on hierarchical names.) Cheers, Gershom

1 0

Second Call for Copy: Monad.Reader #21
by Edward Z. Yang 13 Dec '12

13 Dec '12

Second Call for Copy: The Monad.Reader - Issue 21 ------------------------------------------------- Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 21 will be: **Tuesday, January 1** Less than half a month away, but that's what Christmas break is for, right? :-) The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki- page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (ezyang(a)mit.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll work something out.

1 0

PEPM 2013: 2nd Call for Participation
by Shin-Cheng Mu 13 Dec '12

13 Dec '12

=== P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 21-22, 2013 Rome, Italy (Affiliated with POPL 2013) CALL FOR PARTICIPATION IMPORTANT DATES * Hotel reservation deadline: December 15, 2012 * Early registration deadline: December 31, 2012 VENUE PEPM'13 and all POPL'13 affiliated events will take place at the Parco dei Principi Hotel in Rome, Italy SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. INVITED TALKS: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations PROGRAM CHAIRS: Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PROGRAM COMMITTEE: * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia and IMDEA Software Institute, Spain)) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Beira Interior, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (Inria, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy G. Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden, and Rice University, USA) * Tarmo Uustalu (Institute of Cybernetics, Tallinn, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (Inria, France) PRELIMINARY PROGRAM Monday, January 21, 2013 Program Chairs' Report and Best Paper Award Announcement: 8:45 - 9:00 Invited Talk: 9:00 - 10:00 Session Chair: Shin-Cheng Mu * Zhenjiang Hu: Practical Aspects of Bidirectional Graph Transformations Coffee break 10:30 - 12:30 Session Chair: Samir Genaim * Jeroen Weijers, Jurriaan Hage and Stefan Holdermans: Security Type Error Diagnosis for Higher-Order, Polymorphic Languages * Axel Simon: Deriving a Complete Type Inference for Hindley-Milner and Vector Sizes using Expansion * Francisco Javier López-Fraguas and Enrique Martin-Martin: Typing as Functional-Logic Evaluation * Kostis Sagonas, Josep Silva and Salvador Tamarit: Precise Explanation of Success Typing Errors 14:30 - 16:00 Session Chair: Jeremy Siek * Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti: Verifying Programs via Iterated Specialization * Ryosuke Sato, Hiroshi Unno and Naoki Kobayashi: Towards a Scalable Software Model Checker for Higher-Order Programs * Michael Carbin, Deokhwan Kim, Sasa Misailovic and Martin Rinard: Verified Integrity Properties for Safe Approximate Program Transformations Coffee break 16:30 - 17:30 Session Chair: Bruno Oliveira * Marco Comini and Luca Torella: TRSynth: a Tool for Automatic Inference of Term Equivalence in Left-linear Term Rewriting Systems * Martin Sulzmann, Jürgen Nicklisch and Axel Zechner: Traceability and Correctness of EDSL Abstractions Tuesday, January 22, 2013 Invited Talk: 9:00 - 10:00 Session Chair: Elvira Albert * Peter Thiemann: Partially Static Operations Coffee break 10:30 - 12:30 Session Chair: Kazutaka Matsuda * Bruno Martinez, Marcos Viera and Alberto Pardo: Just Do It While Compiling!: Fast Extensible Records in Haskell * Bruno Oliveira and Andres Loh: Abstract Syntax Graphs for Domain Specific Languages * Dominique Devriese, Ilya Sergey, Dave Clarke and Frank Piessens: Fixing Idioms - A Recursion Primitive for Applicative DSLs * Álvaro García-Pérez and Pablo Nogueira: A Syntactic and Functional Correspondence between Reduction Semantics and Reduction-Free Full Normalisers 14:30 - 16:00 Session Chair: Roberto Giacobazzi * Marco Servetto and Elena Zucca: A Meta-Circular Language for Active Libraries * María Alpuente, Marco A. Feliú and Alicia Villanueva: Automatic Inference of Specifications using Matching Logic * Qiang Sun, Yuting Chen and Jianjun Zhao: Constraint-Based Locality Analysis for X10 Programs Coffee break 16:30 - 17:00 Session Chair: Jurriaan Hage * Baris Aktemur, Yukiyoshi Kameyama, Oleg Kiselyov and Chung‐ chieh Shan: Shonan Challenge for Generative Programming

1 0