December 2012 - Haskell

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

Haskell stars in experimental film
by Simon Peyton-Jones 02 Jan '13

02 Jan '13

Friends You may enjoy this weird 2-minute video: http://www.youtube.com/watch?v=WtfvoiqLZrs&feature=youtu.be It stars our cat (who is called Haskell at my children's insistence) in an "experimental concrete music video", created by a Cambridge undergrad music student. Enjoy! (What is concrete music, btw?) Simon

4 3

ANNOUNCE: graphviz-2999.15.0.0
by Ivan Lazar Miljenovic 31 Dec '12

31 Dec '12

After much prodding and poking by end-users for the past few months, I'm finally able to announce a GHC-7.6.1 compatible release of my Haskell bindings to the Graphviz graph visualisation toolkit: http://hackage.haskell.org/package/graphviz-2999.15.0.0 (It took me so long to release a version that allowed bytestring-0.10.* as I was waiting for upstream to get back to me about an inconsistency I found; in the end I decided to just try and cope with how it seems to work.) The list of changes since the last release are: * The repository is now hosted at http://hub.darcs.net/ivanm/graphviz, and using the bug-tracker there. * Updates to various `Attribute` definitions: - The list of available shapes has been expanded to take into account the new synthetic biology shapes. - The `Size` and `FontNames` attributes now have specified data types. - The optional start and end points for `Spline`s were previously the wrong way round; this has now been fixed. - Explicitly only print 2-dimensional `Point` values for `Rect` and `DPoint` (previously only 2-dimensional values where parsed, but it was possible to print a 3-dimensional value). - HTML-like labels previously disallowed empty textual label components when parsing; spotted by Daniel Hummel. * `GraphvizParams` now lets you specify whether a "cluster" is actually a cluster or a sub-graph. Requested by Gabor Greif. * Fixed an error where printing edges whose attributes contained a `ColorScheme` attribute, that attribute would stay in the state and the old color scheme would override the _parent's_ state. * Previously, some malformed attributes were accepted when being parsed as they silently became parsed as an `UnknownAttribute`. Now, attributes where the attribute name and the equal sign are successfully parsed **but** the value of the attribute is _not_ successfully parse will throw an unrecoverable error. **Note**: this does mean that some Dot graphs that are accepted by Graphviz (as they separate tokenizing from parsing; as such something like `"0.1"` is successfully accepted as an integer, specifically `0`) are no longer accepted when parsing them in. * Miscellaneous parsing improvements: - Whilst not specified anywhere, Graphviz seems to treat empty quotes as values for attributes expecting a number as their default; as such, this is now taken into account when parsing. - `DPoint` values can now parse an optional `+` prefix. - Whitespaces after commas in HSV colors are now accepted. * Error messages from parsing are improved to help you track down where the parsing error occurred (in that it's easier to find which attribute failed to parse, etc.). -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

1 0

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