- Haskell - Haskell.org

LOLA 2012: Call for Talk Proposals
by Amal Ahmed 04 Apr '12

04 Apr '12

============================================================ *** CALL FOR TALK PROPOSALS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in many aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: Typed assembly languages, Certified assembly programming, Certified and certifying compilation, Proof-carrying code, Program optimization, Modal logic and realizability in machine code, Realizability and double orthogonality in assembly code, Parametricity, modules and existential types, General references, Kripke models and recursive types, Continuations and concurrency, Implicit complexity, sublinear programming and Turing machines, Closures and explicit substitutions, Linear logic and separation logic, Game semantics, abstract machines and hardware synthesis, Monoidal and premonoidal categories, traces and effects. SUBMISSION INFORMATION: LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google)

1 0

HOPE 2012 (a new workshop co-located with ICFP): Call for Talk Proposals
by Amal Ahmed 04 Apr '12

04 Apr '12

CALL FOR TALK PROPOSALS HOPE 2012 The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 9, 2012 Copenhagen, Denmark (the day before ICFP 2012) http://hope2012.mpi-sws.org HOPE is a *new workshop* that is intended to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2012(a)mpi-sws.org. Deadline for talk proposals: June 8, 2012 (Friday) Notification of acceptance: July 1, 2012 (Sunday) Workshop: September 9, 2012 (Sunday) The submission website is now open: http://www.easychair.org/conferences/?conf=hope2012 --------------------- Workshop Organization --------------------- Program Co-Chairs: Amal Ahmed (Northeastern University) Derek Dreyer (MPI-SWS, Germany) Program Committee: Jim Laird (University of Bath) Rasmus Møgelberg (IT University of Copenhagen) Greg Morrisett (Harvard University) Aleks Nanevski (IMDEA Software Institute) David Naumann (Stevens Institute of Technology) Matthew Parkinson (Microsoft Research Cambridge) François Pottier (INRIA Rocquencourt) Amr Sabry (Indiana University) Eijiro Sumii (Tohoku University) Nikhil Swamy (Microsoft Research Redmond) Nobuko Yoshida (Imperial College London)

1 0

WING 2012: Final Call for Papers -- Extended Deadline
by Gudmund Grov 02 Apr '12

02 Apr '12

[Please post - apologies for multiple copies.] *** Submission deadline extended to April 13, 2012 *** ---------------------------------------------------- WING 2012 - 4th International Workshop on INvariant Generation http://cs.nyu.edu/acsys/wing2012/ June 30, 2012 Manchester, UK (a satellite Workshop of IJCAR 2012) ---------------------------------------------------- --- Final Call for Papers --- General ------- The ability to automatically extract and synthesize auxiliary properties of programs has had a profound effect on program analysis, testing, and verification over the last several decades. A key impediment for program verification is the overhead associated with providing, debugging, and verifying auxiliary invariant annotations. Releasing the software developer from this burden is crucial for ensuring the practical relevance of program verification. In the context of testing, suitable invariants have the potential of enabling high-coverage test-case generation. Thus, invariant generation is a key ingredient in a broad spectrum of tools that help to improve program reliability and understanding. As the design and implementation of reliable software remains an important issue, any progress in this area will have a significant impact. The increasing power of automated theorem proving and computer algebra has opened new perspectives for computer-aided program verification; in particular for the automatic generation of inductive assertions in order to reason about loops and recursion. Especially promising breakthroughs are invariant generation techniques by Groebner bases, quantifier elimination, and algorithmic combinatorics, which can be used in conjunction with model checking, theorem proving, static analysis, and abstract interpretation. The aim of this workshop is to bring together researchers from these diverse fields. Scope ----- We encourage submissions presenting work in progress, tools under development, as well as work by PhD students, such that the workshop can become a forum for active dialogue between the groups involved in this new research area. Relevant topics include (but are not limited to) the following: * Program analysis and verification * Inductive Assertion Generation * Inductive Proofs for Reasoning about Loops * Applications to Assertion Generation using the following tools: - Abstract Interpretation, - Static Analysis, - Model Checking, - Theorem Proving, - Theory Formation, - Algebraic Techniques * Tools for inductive assertion generation and verification * Alternative techniques for reasoning about loops Invited speaker ----------------- * Aditya Nori (Microsoft Research) Committee ----------------- Program Chairs: * Gudmund Grov (University of Edinburgh, UK) * Thomas Wies (New York University, USA) Program Committee: * Clark Barrett (New York University, USA) * Nikolaj Bjorner (Microsoft Research, USA) * Gudmund Grov (University of Edinburgh, UK) * Ashutosh Gupta (IST Austria) * Bart Jacobs (Katholieke Universiteit Leuven, Belgium) * Moa Johansson (Chalmers University of Technology, Sweden) * Laura Kovacs (Vienna University of Technology, Austria) * David Monniaux (VERIMAG, France) * Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) * Helmut Veith (Vienna University of Technology, Austria) * Thomas Wies (New York University, USA) Important Dates --------------- Submission deadline: April 13, 2012 Notification of acceptance: May 11, 2012 Final version due: June 08, 2012 Workshop: June 30, 2012 Submission ---------- WING 2012 encourages submissions in the following two categories: * Original papers: contain original research (simultaneous submissions are not allowed) and sufficient detail to assess the merits and relevance of the submission. Given the informal style of the workshop, papers describing work in progress, with sufficient detail to assess the contribution, are also welcome. Original papers should not exceed 15 pages. * Extended abstracts: contain preliminary reports of work in progress, case studies, or tool descriptions. These will be judged based on the expected level of interest for the WING community. They will be included in the CEUR-WS proceedings. Extended abstracts should not exceed 5 pages. All submissions should conform to Springer's LNCS format. Formatting style files can be found at http://www.springer.de/comp/lncs/authors.html Technical details may be included in an appendix to be read at the reviewers' discretion and to be omitted in the final version. Please prepare your submission in accordance with the rules described above and submit a pdf file via https://www.easychair.org/?conf=wing2012 Publication ----------- All submissions will be peer-reviewed by the program committee. Accepted contributions will be published in archived electronic notes, as a volume of CEUR Workshop Proceedings. A special issue of the Journal of Science of Computer Programming with extended versions of selected papers will be published after the workshop. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

(no subject)
by Mark Snyder 02 Apr '12

02 Apr '12

<a href="http://isukeworld.com/test/cat13/02efpk.html"> http://isukeworld.com/test/cat13/02efpk.html</a>

1 0

6th International School on Rewriting (ISR), July 16-20, 2012
by Santiago Escobar 02 Apr '12

02 Apr '12

Call for Participation ISR 2012 6th International School on Rewriting http://www.dsic.upv.es/~isr2012 July 16th - 20th Universitat Politecnica de Valencia Valencia, Spain Rewriting is a branch of computer science whose origins go back to the origins of computer science itself (with Thue, Church, Post, and many other prominent researchers). It has strong links with mathematics, algebra, and logic, and it is the basis of well-known programming paradigms like functional and equational programming, which are taught at the universitary level in many countries. In these programming paradigms and corresponding languages, the notions of reduction, pattern matching, confluence, termination, strategy, etc., are essential. Rewriting provides a solid framework for understanding, using, and teaching all these notions. Rewriting techniques are also used in many other areas of software engineering (scripting, prototyping, automated transformation of legacy systems, refactoring, web services, etc.) and are implemented in popular systems like Mathematica, Autocad, and others. Rewriting techniques play a relevant role in computing research, education, and industry. The International School on Rewriting is promoted by the IFIP Working Group 1.6 Term Rewriting. The school is aimed at master and PhD students, researchers, and practitioners interested in the study of rewriting concepts and their applications. Two tracks are offered, including the lectures and the courses: - Track A: for newcomers in the field, or just for people who want to obtain a new, updated exposure. * Jose Meseguer. Introduction to Term Rewriting * Albert Rubio. Termination of Rewriting: Foundations and Automation * Santiago Escobar. A Rewriting-Based Specification and Programming Language: Maude * Beatriz Alarcon & Raul Gutierrez. Exercises on Term Rewriting - Track B: for those who want to get deeper in the most recent developments and applications of rewriting. * Maria Alpuente: Narrowing Techniques and Applications * Temur Kutsia: Matching, unification, and generalizations * Pierre Lescanne: Lambda Calculus: extensions and applications * Narciso Marti-Oliet: Rewriting Logic and Applications * Georg Moser: Automated Complexity Analysis of Term Rewriting Systems * Albert Oliveras: SAT and SMT techniques in Proof and Verification * Sophie Tison: Tree Automata, Turing Machines and Term Rewriting * Xavier Urbain: Certification of Rewriting Properties * Andrei Voronkov: Automated Reasoning and Theorem Proving Registration fees: 250 euro (early registration, before June 15, 2012) 350 euro (late registration, after June 15, 2012) Visit our web site for more information about registration and accommodation. The registration will be open in few weeks. For more information, please visit our web site or contact isr2012(a)dsic.upv.es Organizing Committee: Salvador Lucas (chair) Beatriz Alarcon Santiago Escobar Marco A. Feliu Raul Gutierrez Sonia Santiago Alicia Villanueva

1 0

cabal-install and ghc compatibility
by briand＠aracnet.com 31 Mar '12

31 Mar '12

Hello, I've got ghc 7.2.2 installed. trying to install cabal-install-0.10.2 results in: Linking Setup ... Configuring Cabal-1.10.1.0... Setup: At least the following dependencies are missing: base >=4 && <3 && >=2 && <5, unix >=2.0 && <2.5 Error during cabal-install bootstrap: Configuring the Cabal package failed Do I need to be using development versions of cabal/cabal-install if I'm also going to be using newer versions of ghc ? How do I know which version of cabal are compatible with which versions of ghc without trying to install it and seeing if it works ? Thank you, Brian

2 1

DHD >>= UHac: Register by April 1 for the DHD
by Sean Leather 30 Mar '12

30 Mar '12

DHD >>= UHac will be held from Friday, April 20, to Sunday, April 22, 2012. The Dutch HUG Day (DHD) is on the first day. The Utrecht Hackathon (UHac) follows the DHD on Friday and continues through the weekend. http://www.haskell.org/haskellwiki/DHD_UHac *Please register for the DHD by Sunday, April 1.* Our sponsor for the DHD, Ordina, will use the registration to prepare the (free!) lunch and venue. If you're coming only to UHac and not the DHD, you can register by April 19. http://www.haskell.org/haskellwiki/DHD_UHac/Register See you in Utrecht! The Organizers: Sean Leather Jurriën Stutterheim Jurriaan Hage

1 0

Faça parte da minha rede no LinkedIn
by Carlos Camarao Figueiredo 29 Mar '12

29 Mar '12

LinkedIn ------------ Eu gostaria de adicioná-lo à minha rede profissional no LinkedIn. -Carlos Camarao Carlos Camarao Figueiredo Professor na UFMG Belo Horizonte e Região, Brasil Confirme que você conhece Carlos Camarao Figueiredo: https://www.linkedin.com/e/-y1615u-h0e41zcs-6/isd/6485083911/4PS7AfCQ/?hs=f… -- Você está recebendo convites de conexão por e-mail. Clique aqui para parar de recebê-los: http://www.linkedin.com/e/-y1615u-h0e41zcs-6/A5eR2FIG5M9-4jk43rQ4JqtVY2yX2K… (c) 2012 LinkedIn Corporation. 2029 Stierlin Ct, Mountain View, CA 94043 - EUA.

1 0

ANNOUNCE: haskell-src-exts-1.13.0
by Niklas Broberg 29 Mar '12

29 Mar '12

Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.13.0! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts It's been a *very short* while since the last update before this, and another (smallish) major release it is. Sorry about that (especially to Neil who was quick to update). The main update of this release is to add support for DoAndIfThenElse, which means haskell-src-exts at long last is compliant with Haskell2010. This is also the cause for the backwards-incompatible change: default parse mode is now to use Haskell2010 mode. In particular this means that NPlusKPatterns is no longer recognized by default. No old code using haskell-src-exts should fail to compile (unless really unlucky with clashing imports from L.H.E.Extension), but it may now fail to work on some Haskell98-compliant source files. Changelog: 1.12.0 --> 1.13.0 =============== * Add extensions DoAndIfThenElse and NPlusKPatterns to Language.Haskell.Exts.Extensions. * DoAndIfThenElse is now supported, at long last, making HSE compatible with Haskell2010 * Introduce haskell98 and haskell2010 extension groups, exported from Language.Haskell.Exts.Extensions. * Backwards-incompatible change: default parse mode is now to use haskell2010, which means the following features are recognized by default: DoAndIfThenElse, PatternGuards, ForeignFunctionInterface, EmptyDataDecls. NPlusKPatterns is no longer recognized by default. Cheers, /Niklas

4 4

CALL FOR PARTICIPATION: FLOPS 2012
by Peter Thiemann 29 Mar '12

29 Mar '12

CALL FOR PARTICIPATION: FLOPS 2012 ================================== Eleventh International Symposium on Functional and Logic Programming May 23-25, 2012 Takikawa Memorial Hall, Kobe University, Kobe, Japan http://www.org.kobe-u.ac.jp/flops2012/ *Early Registration: April 25 (Wed)* FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. The 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) and satellite workshops including WFLP 2012 will be held in the week after FLOPS at Nagoya, Japan. Invited Speakers @ FLOPS ================ - Tachio Terauchi (Graduate School of Information Science, Nagoya University). Automated Verification of Higher-order Functional Programs - Michael Codish (Department of Computer Science, Ben-Gurion University of the Negev). Programming with Boolean Satisfaction - Stephanie Weirich (School of Engineering and Applied Science, University of Pennsylvania). Dependently-typed programming in GHC See the full program at http://www.org.kobe-u.ac.jp/flops2012/program.html Register now at http://www.org.kobe-u.ac.jp/flops2012/index.html#REGISTRATION CONFERENCE ORGANIZERS GENERAL CHAIR ============= - Naoyuki Tamura (Kobe University, Japan) PROGRAM CO-CHAIRS ================= - Tom Schrijvers (Ghent University, Belgium) - Peter Thiemann (University of Freiburg, Germany) CONFERENCE SPONSORS =================== - Japan Society for Software Science and Technology (JSSST) SIGPPL - Information Science and Technology Center, Kobe University IN COOPERATION WITH =================== - ACM SIGPLAN - Asian Association for Foundation of Software (AAFS) - Association for Logic Programming (ALP)

1 0