- Haskell - Haskell.org

Call for Participation -- SICSA Summer School on Formal Reasoning & Representation of Complex Systems
by Gudmund Grov 19 Feb '10

19 Feb '10

Call for Participation ----------------------- SSFRR 2010 SICSA Summer School on Formal Reasoning & Representation of Complex Systems 14-15 August 2010 -- Heriot-Watt University campus -- Edinburgh Satellite summer school of VSTTE 2010 http://dream.inf.ed.ac.uk/events/ssfrr-2010/ ---------------------- ABOUT --------- The summer school will give a broad overview of software verification techniques, addressing both bottom-up and top-down approaches with a strong focus on the formal representation and reasoning themes. The school consists of eight introductory lectures, each concentrating on an unique aspect of one or both of the overall themes. The topics of the lectures include inductive theorem proving; SAT and SMT solving; proof planning and rippling; rely/guarantee conditions; separation logic; operating system verification; BiGraphs and formal analysis of security. The school is intended for PhD students and researchers working within one or both of these themes, however familiarity with any of the techniques is not a prerequisite. All lectures are meant to be introductory. PRESENTERS --------- The following will present at the summer school: * Robert Atkey (University of Strathclyde) & Ewen Maclean (Heriot-Watt University) * Alan Bundy & Lucas Dixon (University of Edinburgh) * Cliff Jones (University of Newcastle) * Gerwin Klein (National ICT Australia) * Robin Milner (University of Cambridge/Edinburgh) * J Strother Moore (University of Texas at Austin) * Natarajan Shankar (SRI) * Graham Steel (INRIA) PRELIMINARY PROGRAM --------- The summer school has the following preliminary program (timing and titles may still change): Saturday: * 09:00: Registration * 09:30: J Moore -- Machines Reasoning about Machines - 39 Years and Counting * 11:00: Coffee break * 11:30: Gerwin Klein -- Specification and Refinement in Operating System Verification * 13:00: Lunch * 14:00: Bob Atkey/Ewen Maclean -- Amortised Resource Analysis and Functional Correctness with Separation Logic * 15:30: Coffee break * 16:00: Alan Bundy/Lucas Dixon -- Proof-planning, inductive reasoning, and beyond * 17:30: End Sunday: * 09:30: Natarajan Shankar -- Verification using SAT and SMT solvers * 11:00: Coffee break * 11:30: Graham Steel -- Formal Analysis of Security * 13:00: Lunch * 14:00: Cliff Jones -- Tackling concurrency by reasoning explicitly about inference * 15:30: Coffee break * 16:00: Robin Milner -- BiGraphs: a Model for Mobile Agents * 17:30: End VENUE --------- The summer school is a satellite event of VSSTE 2010 (see http://www.macs.hw.ac.uk/vstte10/) and will be held the two days before the main event: Saturday 14th and Sunday 15th August 2010. Like VSTTE 2010, it will be held at the Edinburgh campus of Heriot-Watt University. REGISTRATION --------- The registration fee is £110, which also covers materials and lunches. We will offer campus accommodation at £42.50 (incl. VAT and breakfast) per night, which will be possible to book during registration. This is highly recommended since the summer school will coincide with several of the famous Edinburgh festivals -- where hotel prices in town tend to be very inflated. SICSA will cover registration and two nights campus accommodation for SICSA students (students from most Scottish Universities -- see http://www.sicsa.ac.uk/ to check if you are eligible). The number of SICSA students is limited, and a decision on ranking if this number is exceeded will only be taken if necessary. The registration will be joint with the VSTTE conference and will open shortly. However, due to a limited number of places, we can now offer pre-registration by emailing your details to ssfrr-2010(a)inf.ed.ac.uk. Places will be allocated on a first-come-first-serve basis. Please include the following in your email: * your name * your institution and country * if you are a SICSA student (matriculation number in case you are) * your research area/topic ORGANISERS --------- The summer school is jointly organised by The School of Informatics at Edinburgh University and The School of Mathematical and Computer Sciences at Heriot-Watt University by: * Lucas Dixon (Edinburgh) * Gudmund Grov (Edinburgh) * Ewen Maclean (Heriot-Watt) CONTACT --------- The organisers can be contacted at the following email address: ssfrr-2010(a)inf.ed.ac.uk. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

ANNOUNCE: vty-ui 0.3
by Jonathan Daugherty 19 Feb '10

19 Feb '10

I'm happy to announce the release of vty-ui 0.3. Get it from Hackage: http://hackage.haskell.org/package/vty-ui Or get the source with darcs: http://repos.codevine.org/vty-ui Project homepage: http://codevine.org/vty-ui/ This version of vty-ui features a richer rendering engine, generalized text transformations, and a more functional style. If you've written any applications to use vty-ui, your type signatures and usage of a few of the built-in widget types will need to change but the API is largely the same. In particular, the largest change was a refactoring inspired by Luke Palmer's blog post, "Haskell Antipattern: Existential Typeclass," which targeted vty-ui (among other libraries) in its treatment of the topic: http://lukepalmer.wordpress.com/2010/01/24/haskell-antipattern-existential-… Here's a summary of changes: General * Replace Widget type class with a concrete Widget type * Move text widget into Graphics.Vty.Widgets.Text * Add support for generalized text "formatters" * Replace WrappedText widget type with a text-wrapping formatter * Provide a regex-based text-highlighting formatter (see the demo for an example) * Refactor the rendering engine to provide "address" information so you can get coordinates and size for rendered widgets * Add a few QuickCheck tests (and related fixes) Enjoy! -- Jonathan Daugherty

1 0

Fwd: TFP 2010 - Call for Papers and Participation
by Simon Marlow 18 Feb '10

18 Feb '10

[ forwarding on behalf of Rex Page <page(a)ou.edu> ] TFP 2010: 11th SYMPOSIUM ON TRENDS IN FUNCTIONAL PROGRAMMING May 17-19, 2010 University of Oklahoma http://www.cs.ou.edu/tfp2010/ TFP 2010 is an international forum for researchers with interests in any aspect of functional programming. SUBMISSION and REGISTRATION DEADLINES April 2: Submission deadline April 16: Early registration deadline ($350, $200 for students) May 7: Late registration deadline ($425) May 17-19: TFP Symposium POST-SYMPOSIUM PROCEEDINGS Springer series: Lecture Notes in Computer Science Details about the event schedule, symposium scope, submissions, and registration may be found on the symposium website. http://www.cs.ou.edu/tfp2010/ (Web browser key "tfp 2010") Submitted papers and extended abstracts are reviewed for presentation at the symposium, and a formal refereeing process after the symposium selects the best presentations for publication the Springer series, Lecture Notes in Computer Science. We invite you to participate in TFP 2010. - Rex Page, University of Oklahoma, Program Chair - Viktia Zs and Zolt Horvath, Ev Lord University, Symposium Co-Chairs Sponsors: Erlang Solutions Ltd and The University of Oklahoma

1 0

ANN: iteratee-parsec 0.0.1
by Maciej Piechotka 18 Feb '10

18 Feb '10

Iteratee-parsec is a library which allows to have a parsec (3) parser in IterateeG monad. It contains 2 implementations: - John Lato's on public domain. It is based on monoid and design with short parsers in mind. - Mine on MIT. It is based on single-linked mutable list. It seems to be significantly faster for larger parsers - at least in some cases - but it requires a monad with references (such as for example IO or ST). Regards

1 0

Bug in opengl...
by Manuel Hernandez 18 Feb '10

18 Feb '10

Hi! This was so ugly...: ----- mh@dsktp:/media/VENUS/python$ ghc -package GLUT HelloWorld.hs -o HelloWorld Binary: Int64 truncated to fit in 32 bit Int ghc: panic! (the 'impossible' happened) (GHC version 6.10.4 for i386-unknown-linux): Prelude.chr: bad argument Please report this as a GHC bug: http://www.haskell.org/ghc/reportabug ---- First program in: http://blog.mikael.johanssons.org/archive/2006/09/opengl-programming-in-has… Why, why? Warm regards, Manuel.

1 0

ANN: concurrent-extra-0.1
by Roel van Dijk 17 Feb '10

17 Feb '10

Hello, We would like to announce the release of concurrent-extra [1]. A library which offers a few extra synchronization primitives. These primitives are found in the standard libraries of languages like Java and Python, but not in Haskell. Quick overview: * Lock: Enforce exclusive access to a resource. Also known as a mutex or a binary semaphore. * RLock: A lock which can be acquired multiple times by the same thread. Also known as a reentrant mutex. * Event: Wake multiple threads by signaling an event. Includes both pessimistic and optimistic versions. * ReadWriteLock: Multiple-reader, single-writer locks. Used to protect shared resources which may be concurrently read, but only sequentially written. * ReadWriteVar: Concurrent read, sequential write variables. Plug & Play: cabal install concurrent-extra Darcs: darcs get http://code.haskell.org/~roelvandijk/code/concurrent-extra/ Thanks to Neil Brown and Simon Marlow for an initial review. Comments are still more than welcome! Regards, Roel & Bas van Dijk [1] http://hackage.haskell.org/package/concurrent-extra

1 0

Parsec operator issue
by Adam Crume 17 Feb '10

17 Feb '10

I have a parser with a prefix "-" and an infix "=". When I try to parse "x=-1", it fails. Does anyone know how to fix this? I stripped my code down as much as possible. It parses "x=1" and "-1", but fails for "x=-1". import Text.Parsec import qualified Text.Parsec.Expr as PE import qualified Text.Parsec.Language as L import qualified Text.Parsec.Token as T lexer = T.makeTokenParser L.emptyDef {T.reservedOpNames = ["=", "-"]} reservedOp = T.reservedOp lexer integer = T.integer lexer >> return "" symbol = T.identifier lexer expression = PE.buildExpressionParser table (integer <|> symbol) where table = [ [ PE.Prefix (reservedOp "-" >> return (\x-> "")) ], [ PE.Infix (reservedOp "=" >> return (\x-> \y->"")) PE.AssocRight ] ] input = do e <- expression eof return e testParse s = case (parse input "(unknown)" s) of Left f -> putStrLn $ s ++ "\n" ++ show f Right f -> putStrLn s main = do testParse "x=1" testParse "-1" testParse "x=-1" _________________________________________________________________ Hotmail: Free, trusted and rich email service. http://clk.atdmt.com/GBL/go/201469228/direct/01/

3 3

CMCS 2010: Call for Short Submissions & Call for Participation
by Alexandra Silva 16 Feb '10

16 Feb '10

------------------------------------------------------------------------ CMCS 2010 Call for Short Submissions & Call for Participation ------------------------------------------------------------------------ The 10th International Workshop on Coalgebraic Methods in Computer Science 26-28 March 2010, Paphos, Cyprus (co-located with ETAPS 2010) <http://event.cwi.nl/cmcs10/> Aims and scope ------------------------- The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. Over the last two decades, coalgebra has developed into a field of its own, presenting a mathematical foundation for various kinds of dynamical systems, infinite data structures, and logics. Coalgebra has an ever growing range of applications in and interactions with other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). An anniversary: the 10th CMCS --------------------------------------------- CMCS took place for the first time when ETAPS started, in 1998. Since then, it has always been collocated with ETAPS, becoming bi-annual since the start of CALCO (Conference on Algebra and Coalgebra) in 2005. In 2010, we will celebrate the 10th edition of CMCS, by inviting a number of specialists in the field to present overviews of both obtained results and future challenges. Invited Speakers ------------------------- At this tenth meeting the following invited speakers will present overviews of important subareas. * Venanzio Capretta: Coalgebra in functional programming and type theory * Bartek Klin: Operational semantics coalgebraically * Dirk Pattinson: Logic and coalgebra * Ana Sokolova: Probabilistic systems coalgebraically Short contributions ----------------------------- Apart from the presentation of regular papers (see list below) and invited contributions, some time has been reserved for *short contributions* . These will not be published in the proceedings but will be bundled in a CWI technical report. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. The instructions for submitting short contributions can be found at: <http://event.cwi.nl/cmcs10/submission.html> Important dates ------------------- * 27 February 2010: strict submission deadline short contributions * 28 February 2010: deadline normal registration * 6 March 2010: notification short contributions * 26-28 March 2010: the workshop List of accepted regular papers --------------------------------------------- * Jan Komenda . Coinduction in concurrent timed systems * Jiri Adamek, Stefan Milius and Jiri Velebil . Recursive Program Schemes and Context-Free Monads * Bartek Klin . Structural operational semantics and modal logic, revisited * Hauhs Michael and Baltasar Tranc n y Widemann . Applications of Algebra and Coalgebra in Scientific Modelling: Illustrated with the Logistic Map * Kazuyuki Asada and Ichiro Hasuo . Categorifying Computations into Components via Arrows as Profunctors * Corina Cirstea . Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics * Vincenzo Ciancia, Alexander Kurz and Ugo Montanari . Families of symmetries for the semantics of programming languages * Jiho Kim . Higher-order algebras and coalgebras from parameterized endofunctors * Bart Jacobs . From Coalgebraic to Monoidal Traces * Adriana Balan and Alexander Kurz . On coalgebras over algebras Programme Committee ---------------------------------- Jiri Adamek (Braunschweig) Alexandru Baltag (Oxford) Luis Barbosa (Braga) Marcello Bonsangue (Leiden) Corina Cirstea (Southampton) Robin Cockett (Calgary) Andrea Corradini (Pisa) Neil Ghani (Glasgow) Peter Gumm (Marburg) Furio Honsell (Udine) Bart Jacobs (Nijmegen, co-chair) Bartek Klin (Cambridge) Clemens Kupke (London) Alexander Kurz (Leicester) Marina Lenisa (Udine) Stefan Milius (Braunschweig) Ugo Montanari (Pisa) Larry Moss (Bloomington) Milad Niqui (Amsterdam) Dirk Pattinson (London) Dusko Pavlovic (Oxford) John Power (Edinburgh) Horst Reichel (Dresden) Grigore Rosu (Urbana) Jan Rutten (Amsterdam, co-chair) Davide Sangiorgi (Bologna) Lutz Schr der (Bremen) Alexandra Silva (Amsterdam) Hendrik Tews (Nijmegen) Tarmo Uustalu (Tallinn) Yde Venema (Amsterdam) Hiroshi Watanabe (Osaka) James Worrell (Oxford) Organising Committee -------------------------- Bart Jacobs, Milad Niqui (co-chair, CWI), Jan Rutten, Alexandra Silva (co-chair, CWI). Contact ---------- cmcs10(a)cwi.nl .

1 0

ANN: vector 0.5
by Roman Leshchinskiy 15 Feb '10

15 Feb '10

Hi everyone, I am pleased to announce the release of version 0.5 of package vector, a high-performance Haskell array library with a powerful loop fusion framework. The main highlights compared to previous versions are: * DPH-style unboxed vectors (in Data.Vector.Unboxed) which use associated types to select the appropriate unboxed representation depending on the type of the elements. * A redesigned interface between mutable and immutable vectors. In particular, the popular unsafeFreeze primitive is now supported for all vector types. * Many new operations on both immutable and mutable vectors. * Significant performance improvements. The library comes with a fairly complete testsuite (mainly thanks to Max Bolingbroke) and is quite stable by now. Barring various disasters, I expect to release version 1.0 in the next 3 to 4 months. The release is accompanied by a new version of the NoSlow array benchmark suite. A few quite meaningless preliminary benchmarks are available at: http://unlines.wordpress.com/2010/02/15/vector-0-5-is-here-2 Both vector and NoSlow are on Hackage. Hackers can get the darcs repos from http://code.haskell.org/vector and http://code.haskell.org/NoSlow Enjoy! Roman

1 0

CHR 2010: Second Call for Papers
by Van Weert Peter 15 Feb '10

15 Feb '10

========================================================================= Second Call for Papers Seventh International Workshop on Constraint Handling Rules CHR 2010 http://www.cs.kuleuven.be/~dtai/CHR/CHR2010/ Edinburgh (Scotland), July 20, 2010 (co-located with ICLP 2010, part of FLoC 2010) ========================================================================= News * Submission deadlines are about two weeks earlier than first announced! (due to FLoC 2010 requirements) * Invited speaker: We are privileged to announce a distinguished invited speaker this year: Mark Proctor, lead of the thriving, innovating JBoss Drools project (http://www.jboss.org/drools/) He will introduce the Drools Business Logic integration Platform, a fully featured business rule engine and management system that seamlessly integrates powerful Complex Event Processing and workflow capabilities. Introduction The CHR 2010 Workshop will be held July 20, 2010 in Edinburgh (Scotland) at the occasion of the 26th International Conference on Logic Programming (ICLP 2010), the premier international venue for presenting research in logic programming. This year, ICLP is held as part of the Fifth Federated Logic Conference (FLoC 2010). More information on the venue and co-located conferences can be found on the FLOC website (http://www.floc-conference.org/) The Constraint Handling Rules (CHR) language has become a major declara- tive specification formalism and implementation language for constraint reasoning algorithms and applications. Algorithms specified using infe- rence rules, rewrite rules, sequents, proof rules, or logical axioms can often be directly written in CHR. Its clean semantics facilitates pro- gram design, analysis, and transformation. For more information, please visit the CHR website (http://www.cs.kuleuven.be/~dtai/projects/CHR/) The aim of the CHR workshop series is to stimulate and promote interna- tional research and collaboration on topics related to the CHR language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous Workshops on Constraint Handling Rules were organized in 2004 in Ulm (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice (Italy) at ICALP, in 2007 in Porto (Portgual) at ICLP, in 2008 in Hagen- berg (Austria) at RTA, and in 2009 in Pasadena (California, US) at ICLP. Topics of Interest The workshop calls for contributions on all aspects of CHR, including topics such as: - (Operational) semantics - Program analysis (confluence, termination, ...) - Comparisons with related approaches - Expressivity and complexity - Language extensions (negation, modules, ...) - Constraint solvers - Implementation and optimization - Concurrency & parallelism - Program transformation and generation - Programming environments (debugging, confluence checking, ...) - Programming pearls Application papers that describe experience with (industrial) applications, are especially welcome. Important dates - Abstract submission deadline: March 29, 2010 - Paper submission deadline: April 5, 2010 - Notification of acceptance: May 1, 2010 - Final version due: May 17, 2010 (tentative) - Workshop date: July 20, 2010 Submission Information The four broad categories for submissions are: 1. technical papers for describing technically sound, innovative ideas that can advance the state of the art of CHR 2. application papers, where the emphasis will be on the use of CHR in the application, on the impact on the application domain, and the lessons learned from this application 3. system and tool papers, empasising the novelty, practicality, usability and general availability of the systems and tools described 4. short papers, for ongoing work not yet ready for full publication and research project overviews. All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. They must be written in English. Technical papers must not exceed 15 pages. The limit for short papers is 7 pages, as is the standard page limit for application papers, and system and tool papers. However, particularly strong contributions in the latter two areas may be submitted as technical paper as well. All papers must be in the Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS home page (http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0) Submissions must be made via the EasyChair submission system, available at http://www.easychair.org/conferences/?conf=chr10 Programme Committee - Sebastian Brand, National ICT Australia, and the University of Melbourne, Victoria, Australia - Henning Christiansen, Roskilde University, Denmark - Vernica Dahl, Simon Fraser University, Canada - Leslie De Koninck, Victoria Research Laboratory, NICTA, Australia (co-chair) - Thom Fruehwirth Ulm University, Germany - Marco Gavanelli, University of Ferrara, Italy - Remy Haemmerle, Universidad Politecnica de Madrid, Spain - Maria-Chiara Meo, "Gabriele d'Annunzio" University, Italy - Paolo Pilozzi K.U.Leuven, Belgium - Frank Raiser, Ulm University, Germany - Peter Van Weert, K.U.Leuven, Belgium (co-chair) - Jairson Vitorino, Federal University of Pernambuco, Brazil - Armin Wolf, Fraunhofer FIRST, Germany Workshop Coordinators Contact: chr2010(a)easychair.org Peter Van Weert Department of Computer Science, K.U.Leuven Leuven, Belgium http://www.cs.kuleuven.be/~petervw/ Leslie De Koninck Victoria Research Laboratory, NICTA Melbourne, Australia Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

1 0