February 2010 - Haskell

WGP 2010 Call for Papers
by Bruno Oliveira 11 Feb '10

11 Feb '10

6th ACM SIGPLAN Workshop on Generic Programming, 2010 Baltimore, Maryland, US Sunday, September 26th, 2010 http://osl.iu.edu/wgp2010 Goals of the workshop Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * polytypic programming, * programming with dependent types, * programming with type classes, * programming with (C++) concepts, * generic programming, * programming with modules, * meta-programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organisers: Co-Chair Bruno C. d. S. Oliveira, Seoul National University Co-Chair Marcin Zalewski, Indiana University Programme Committee: Alley Stoughton, Kansas State University Andrei Alexandrescu, Facebook Bruno C. d. S. Oliveira (Co-Chair), Seoul National University Doug Gregor, Apple Gilad Bracha, I am a Computational Theologist Emeritus Magne Haveraaen, Universitetet i Bergen Marcin Zalewski (Co-Chair), Indiana University Neil Mitchell, Standard Chartered Ralf Lämmel, University of Koblenz-Landau Shin-Cheng Mu, Academia Sinica Thorsten Altenkirch, University of Nottingham Ulf Norell, Chalmers University We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Sunday 2010-06-13 Notification of acceptance: Monday 2010-07-12 Final submission due: Tuesday 2010-07-27 Workshop: Sunday 2010-09-26 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP09 EasyChair instance by 13th of June 2010. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming This year: * Baltimore, Maryland, US 2010 (affiliated with ICFP10) Earlier Workshops on Generic Programming have been held in * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J Gibbons, R Hinze, P Jansson, J Jarvi, J Jeuring, B Oliveira, S Schupp and M Zalewski

1 0

Fun in the Afternoon, London, 17th Feb (next Wednesday)
by Neil Mitchell 10 Feb '10

10 Feb '10

Dear functional programmers, Standard Chartered Bank in London will be hosting the next Fun In The Afternoon event on Wednesday the 17th of February. The program of talks, with abstracts, is at the bottom of this email. Everyone is welcome! If you would like to come, please email me (ndmitchell -AT- gmail -DOT- com) with your name and affiliation by the 15th of Feb (late registrations will probably be accommodated, but we do need to print out name badges). Address: 1 Basinghall Avenue, London EC2V 5DD http://maps.google.co.uk/maps?q=standard+chartered+bank&ie=UTF8&hl=en&hq=st… Moorgate is the nearest tube station, but London Liverpool Street train/tube station and Bank tube station are easily walkable. Time: The event starts at 1:10pm and finishes at 4:30pm. As traditional, there will be beer/food afterwards. Schedule: 12:00-1:10, arrive at Standard Chartered. We'll find lunch somewhere nearby. Tell the reception you are attending "Fun in the Afternoon". If you have any difficulties getting there, or can't find anyone when you arrive, phone me on 07876 126 574 1:10-1:15, Introduction 1:15-2:00, Invited talk, TBC 2:00-2:15, break 2:15-2:45, Zhaohui Luo, On Subtyping for Type Theories with Canonical Objects 2:45-3:15, George Giorgidze, Declarative Hybrid Modelling and Simulation in Haskell 3:15-3:30, break 3:30-4:00, Dominic Orchard, Haskell Type Constraints Unleashed 4:00-4:30, Malcolm Wallace, Pointless fusion for pointwise application 4:30-6:00, Pub 6:00, Dinner Abstracts: == Zhaohui Luo, On Subtyping for Type Theories with Canonical Objects Two different notions of subtyping have been studied in the literature: subsumptive subtyping that employs the subsumption rule and coercive subtyping that uses implicit coercions. They are suitable for different kinds of type systems: subsumptive subtyping for type assignment systems such as the polymorphic calculi in programming languages and coercive subtyping for the type theories with canonical objects such as Martin-Lof's type theory implemented in proof assistants. In this talk, we explain that subsumptive subtyping is incompatible with the idea of canonical object and cannot be employed to reflect, for example, structural subtyping for inductive types in a type theory with canonical objects. Coercive subtyping, on the other hand, can be used in such type theories to deal with structural and non-structural subtyping relations satisfactorily and has interesting and useful applications. If time permits, we shall show how the formal relationship between these two notions of subtyping can be studied by demonstrating how a type system of dependent types with subsumptive subtyping can be transformed faithfully into one with coercive subtyping. == George Giorgidze, Declarative Hybrid Modelling and Simulation in Haskell Mathematical modelling and simulation of physical systems plays an important role in design, implementation and analysis of systems in numerous areas of science and engineering, e.g., electrical engineering, astronomy, particle physics, biology, climatology, automotive industry and finance (to mention just few). To cope with ever increasing size and complexity of real-world systems, a number of declarative domain specific languages (DSLs) have been developed for mathematical modelling and simulation. In the first half of the talk, I will give a brief overview of the state-of-the-art languages for modelling and simulation and identify their shortcomings with respect to reusability, composability and hybrid (mixed discrete and continuous time) simulation. Next, I will introduce a Haskell-embedded DSL for declarative modelling and simulation that addresses some of these shortcomings. The DSL features first-class implicitly formulated equational constrains allowing for higher-order modelling and simulation of highly structurally dynamic, hybrid systems that goes beyond what current languages can simulate. In particular, it allows repeated generation and just-in-time (JIT) compilation of updated equational constrains during the simulation, depending on the results thus far. The embedding approach that we use should be of general interest and usable in other domains as well. In the second half of the talk, I will describe the embedding approach in detail. I will show how to use mixed-level (combination of deep and shallow) embedding and LLVM JIT compiler to implement an iteratively staged DSL (characterised by repeated program generation, compilation and execution) efficiently in a host language that does not provide built-in multi-stage programming capabilities. == Dominic Orchard, Haskell Type Constraints Unleashed The popular Glasgow Haskell Compiler extends the Haskell 98 type system with several powerful features, leading to an expressive language of type terms. In contrast, constraints over types have received much less attention, creating an imbalance in the expressivity of the type system. We rectify the imbalance, transferring familiar type-level constructs, synonyms and families, to the language of constraints, providing a symmetrical set of features at the type-level and constraint-level. In this talk, the new features, constraint synonyms and constraint families, will be introduced along with examples of their increased expressivity for improving the utility of polymorphic EDSLs in Haskell, amongst other examples. == Malcolm Wallace, Pointless fusion for pointwise application Take a common real-world application: the visualisation of large-scale multi-dimensional scientific data held in arrays. Typical processing involves both structural transformations of the data (e.g. slice, downsample, transpose), and numerical calculation, the latter often involving pointwise arithmetic over transformed arrays. With extremely large datasets, it becomes ever more important to process them with space-efficiency in mind, as well as speed. We will show two kinds of fusion that can automatically eliminate temporary intermediate arrays. An appropriate choice of array representation can make structural transformations extremely cheap, whilst avoiding copying. This talk will however focus mostly on the second kind of fusion: to coalesce numerical array expressions into a single traversal of the inputs, generating a single output. Calculating a fused operation is akin to calculating the points-free version of the entire expression. We speculate that the resultant code will be suitable for highly-parallel multi-core and GPU targets.

1 0

*** FLOPS 2010: Call for Participation ***
by Matthias Blume 10 Feb '10

10 Feb '10

Call For Participation Tenth International Symposium on Functional and Logic Programming FLOPS 2010 April 19-21, 2010 Sendai, JAPAN http://www.kb.ecei.tohoku.ac.jp/flops2010/ ** Early registration ends on April 2, 2010 ** FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise (2008). VENUE The meeting will be held at the Aoba Memorial Hall, in the Aoba-yama Campus of the Tohoku University. REGISTRATION The registration is now open at the Symposium home page: http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registration PROCEEDINGS The proceedings will be published as volume 6009 of Lecture Notes in Computer Science, Springer, and distributed at the Symposium. INVITED SPEAKERS Brigitte Pientka (McGill University, Canada) Kostis Sagonas (National Technical University of Athens, Greece) Naoyuki Tamura (Kobe University, Japan) PROGRAM April 19 (Monday) 12:00-13:20 Registration and lunch 13:20-14:20 Invited talk Beluga: programming with dependent types and higher-order data Brigitte Pientka 14:40-16:10 Types - A Church-Style Intermediate Language for MLF Didier Remy, Boris Yakobowski - ΠΣ: Dependent Types without the Sugar Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh, Nicolas Oury - Haskell Type Constraints Unleashed Dominic Orchard, Tom Schrijvers 16:30-18:00 Program analysis and transformation - A Functional Framework for Result Checking Gilles Barthe, Pablo Buiras, César Kunz - Tagfree Combinators for Binding-Time Polymorphic Program Generation Peter Thiemann, Martin Sulzmann - Code Generation via Higher-Order Rewrite Systems Florian Haftmann, Tobias Nipkow April 20 (Tuesday) 09:00-10.00 Invited talk Using Static Analysis to Detect Type Errors and Race Conditions in Erlang Programs Konstantinos Sagonas 10:20-11:50 Foundations - A Complete Axiomatization of Strict Equality Javier Álvez, Francisco Javier López-Fraguas - Standardization and Böhm trees for Lambda-mu calculus Alexis Saurin - An Integrated Distance for Atoms Vicent Estruch, César Ferri, José Hernández-Orallo, M.José Ramírez-Quintana 11:50- Lunch, excursion, and banquet April 21 (Wednesday) 09:00-10:00 Invited talk Solving Constraint Satisfaction Problems with SAT Technology Naoyuki Tamura 10:20-11:50 Logic programming - A Pearl on SAT Solving in Prolog Jacob Howe, Andy King - Automatically Generating Counterexamples to Naive Free Theorems Daniel Seidel, Janis Voigtländer - Applying Constraint Logic Programming to SQL Test Case Generation Yolanda García-Ruiz, Rafael Caballero, Fernando Sáenz-Pérez 11:50-12:50 Lunch 12:50-14:20 Evaluation and normalization - Internal Normalization, Compilation and Decompilation for System F Stefano Berardi, Makoto Tatsuta - Normalization by Evaluation for the beta-eta Calculus of Constructions Andreas Abel - Defunctionalized Interpreters for Call-by-Need Evaluation Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny 14:40-16:10 Term rewriting - Complexity Analysis by Graph Rewriting Martin Avanzini, Georg Moser - Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus Jeroen Ketema, Jakob Grue Simonsen - Proving Injectivity of Functions via Program Inversion in Term Rewriting Naoki Nishida, Masahiko Sakai 16:30-18:00 Parallelism and control - Delimited Control in OCaml, Abstractly and Concretely. System Description Oleg Kiselyov - Automatic Parallelization of Recursive Functions using Quantiﬁer Elimination Akimasa Morihata, Kiminori Matsuzaki - A Skeleton for Distributed Work Pools in Eden Mischa Dieterle, Jost Berthold, Rita Loogen PC CO-CHAIRS Matthias Blume (Google, Chicago, USA) German Vidal (Technical University of Valencia, Spain) CONFERENCE CHAIR Naoki Kobayashi (Tohoku University, Sendai, Japan) PC MEMBERS Nick Benton (Microsoft Research, Cambridge, UK) Manuel Chakravarty (University of New South Wales, Australia) Michael Codish (Ben-Gurion University of the Negev, Israel) Bart Demoen (Katholieke Universiteit Leuven, Belgium) Agostino Dovier (University of Udine, Italy) John P. Gallagher (Roskilde University, Denmark) Maria Garcia de la Banda (Monash University, Australia) Michael Hanus (University of Kiel, Germany) Atsushi Igarashi (Kyoto University, Japan) Patricia Johann (Rutgers University, USA) Shin-ya Katsumata (Kyoto University, Japan) Michael Leuschel (University of Dusseldorf, Germany) Francisco Lopez-Fraguas (Complutense University of Madrid, Spain) Paqui Lucio (University of the Basque Country, Spain) Yasuhiko Minamide (University of Tsukuba, Japan) Frank Pfenning (Carnegie Mellon University, USA) Francois Pottier (INRIA, France) Tom Schrijvers (Katholieke Universiteit Leuven, Belgium) Chung-chieh "Ken" Shan (Rutgers University, USA) Zhong Shao (Yale University, USA) Jan-Georg Smaus (University of Freiburg, Germany) Nobuko Yoshida (Imperial College London, UK) LOCAL CHAIR Eijiro Sumii (Tohoku University, Sendai, Japan) SOME PREVIOUS FLOPS: FLOPS 2008, Ise: http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/ FLOPS 2004, Nara FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/ SPONSOR Japan Society for Software Science and Technology (JSSST), SIG-PPL Graduate School of Information Sciences, Tohoku University International Information Science Foundation IN COOPERATION with AAFS (Asian Association for Foundation of Software) ACM SIGPLAN ALP (Association for Logic Programming) INQUIRIES to flops2010(a)easychair.org

1 0

Haskell Weekly News: Issue 149 - February 08, 2010
by jfredett＠gmail.com 08 Feb '10

08 Feb '10

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100208 Issue 149 - February 08, 2010 --------------------------------------------------------------------------- Welcome to issue 149 of HWN, a newsletter covering developments in the [1]Haskell community. Hello Haskellers, this week's HWN was delayed a bit in the hopes of making it a bit more substantial. I hate putting up thin HWNs, but of course this must occasionally happen. We have several new CFPs for workshops this week, a new benchmarking package, and some fun quotes. Till next week, Haskellers, your Haskell Weekly News! Announcements Call for Papers: Haskell Symposium 2010. Jeremy.Gibbons [2]announced a call for papers for the 2010 ACM SIGPLAN Haskell Symposium 2010 in Baltimore, Maryland; on 30th September. 2nd CfP: LOPSTR 2010. Temur Kutsia [3]announced a second call for papers for the 20th International Symposium on Logic-Based Program Synthesis and Transformation, being held in Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010). PAR 2010: First CFP. Koen Claessen [4]announced a first call for papers for PAR'10, the Workshop on Partiality and Recursion in Interactive Theorem Provers. data-ordlist-0.2. Leon Smith [5]announced a new release of ordlist, including a change to the module name and bug fixes. progression-0.1. Neil Brown [6]announced Progression, a metalibrary which consolidates various existing tools for Haskell optimization (notably Criterion). HList darcs repo. Oleg He who inhabits all types, but is not _|_, has [7]announced a new darcs repo for HList (and OOHaskell) on community.haskell.org. Discussion a beginner question: decorate-op-undecorate. Aran Donohue [8]asked about how to write a function which can 'inspect' inside a datatype. Translation of Haskell type classes. Enrique Martin [9]talked about some experiments he's done with type classes, and asked some questions regarding optimization related to them. Category Theory woes. Mark Spezzano [10]asked about resources for learning about category theory. Blog noise [11]Haskell news from the [12]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Dan Piponi (sigfpe): [13]The Categorification of the Naturals. * Roman Cheplyaka: [14]hledger. * Luke Palmer: [15]Associative Alpha Blending. * Neil Brown: [16]Progression: Supporting Optimisation in Haskell. * Holumbus: [17]Hayoo! Webservice API. * apfelmus: [18]The Operational Monad Tutorial. * Dan Piponi (sigfpe): [19]Tagging Monad Transformer Layers. * Darcs: [20]darcs weekly news #53. * JP Moresmau: [21]EclipseFP 1.110 released, with debugging support. Quotes of the Week * lispy|web: This curses binding appears to be terminally broken * lispy: I did, 'cabal install mage' and it complains about curses * lament: Just use fix to find the least funny joke * copumpkin: A monad is just a lax functor from a terminal bicategory, duh. fuck that monoid in category of endofunctors shit About the Haskell Weekly News New editions are posted to [22]the Haskell mailing list as well as to [23]the Haskell Sequence and [24]Planet Haskell. [25]RSS is also available, and headlines appear on [26]haskell.org. To help create new editions of this newsletter, please see the information on [27]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [28]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17778 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17770 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17769 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70035 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69929 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69898 8. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69984 9. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69914 10. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69803 11. http://planet.haskell.org/ 12. http://haskell.org/haskellwiki/Blog_articles 13. http://blog.sigfpe.com/2010/02/decategorification-of-naturals.html 14. http://ro-che.blogspot.com/2010/02/hledger.html 15. http://lukepalmer.wordpress.com/2010/02/05/associative-alpha-blending/ 16. http://chplib.wordpress.com/2010/02/04/progression-supporting-optimisation-… 17. http://holumbus.fh-wedel.de/blog/?p=33 18. http://apfelmus.nfshost.com/articles/operational-monad.html 19. http://blog.sigfpe.com/2010/02/tagging-monad-transformer-layers.html 20. http://blog.darcs.net/2010/02/darcs-weekly-news-53.html 21. http://jpmoresmau.blogspot.com/2010/02/eclipsefp-1110-released-with-debuggi… 22. http://www.haskell.org/mailman/listinfo/haskell 23. http://sequence.complete.org/ 24. http://planet.haskell.org/ 25. http://sequence.complete.org/node/feed 26. http://haskell.org/ 27. http://haskell.org/haskellwiki/HWN 28. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

ICE 2010: First call for papers
by Alexandra Silva 08 Feb '10

08 Feb '10

[- Apologies for multiple copies -] 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html === Highlights === - Innovative selection procedure - Travel grants for young researchers === Important Dates === - Abstract submission: 22 March 2010 - Full paper submission: 29 March 2010 - Reviews, rebuttal and PC discussion: 30 March - 28 April 2010 - Notification to authors: 30 April 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and “by construction” techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past two editions of ICE, this considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of accepted papers, and the discussion during the workshop. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions which the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/) Depending on the quality of submissions a special issue in a journal will be considered. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/) Accepted papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (University of Pisa, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deniélou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to <ice2010(a)di.unipi.it> for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: – Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP’08 (http://ice08.dimi.uniud.it/) The post proceedings were published in ENTCS (vol.229-3). – Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR’09 (http://ice09.dimi.uniud.it/) The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) .

1 0

Call for Papers: Haskell Symposium 2010
by Jeremy.Gibbons＠comlab.ox.ac.uk 07 Feb '10

07 Feb '10

Haskell 2010 ACM SIGPLAN Haskell Symposium 2010 Baltimore MD, United States 30th September, 2010 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2010/ The ACM SIGPLAN Haskell Symposium 2010 will be co-located with the 2010 International Conference on Functional Programming (ICFP), in Baltimore, Maryland. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, Practice, and Experience, using Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth, as well as general experience with Haskell in education and industry. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Before 2008, the Haskell Symposium was known as the Haskell Workshop. The name change reflects both the steady increase of influence of the Haskell Workshop on the wider community, as well as the increasing number of high quality submissions. The selection process is highly competitive. After eleven Haskell Workshops between 1995 and 2007, the first Haskell Symposium was held in Victoria in 2008, and the second in Edinburgh in 2009. Submission Details * Submission Deadline: Monday, 14th June 2010, 15:00 UTC * Author Notification: Monday, 12th July 2010 * Final Papers Due : Monday, 2nd August 2010 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm) The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2010, the 2010 Haskell Symposium web page. * http://www.icfpconference.org/icfp2010, the ICFP 2010 web page. Programme Committee * Jeremy Gibbons, University of Oxford (chair) * James Cheney, University of Edinburgh * Duncan Coutts, Well-Typed LLP * Sharon Curtis, Oxford Brookes University * Fritz Henglein, Kobenhavns Universitet * Tom Schrijvers, Katholieke Universiteit Leuven * Chung-chieh Shan, Rutgers - The State University of New Jersey * Martin Sulzmann, Informatik Consulting Systems AG * Wouter Swierstra, Vector Fabrics * Peter Thiemann, Universitaet Freiburg * Andrew Tolmach, Portland State University * Malcolm Wallace, University of York

1 0

recursive definitions in Haskell (inductive and coinductive)
by Graham Hutton 06 Feb '10

06 Feb '10

> Is this the right story? One of my difficulties is that I'm having > trouble grasping what coinduction might mean for terms. The following tutorial paper may be helpful: http://www.cs.nott.ac.uk/~gmh/corecursion.pdf Best wishes, Graham +-----------------------------------------------------------------+ | Dr Graham Hutton Email : gmh(a)cs.nott.ac.uk | | Functional Programming Lab | | School of Computer Science Web : www.cs.nott.ac.uk/~gmh | | University of Nottingham | | Jubilee Campus, Wollaton Road Phone : +44 (0)115 951 4220 | | Nottingham NG8 1BB, UK | +-----------------------------------------------------------------+

1 0

recursive definitions in Haskell (inductive and coinductive)
by nr＠cs.tufts.edu 03 Feb '10

03 Feb '10

I'd appreciate a word from the experts to see if my understanding of recursive definitions in Haskell is correct---I would hate to be telling my students pernicious lies. Haskell permits recursive definitions at both the type level and the term level. Here's an example definition at the type level: data Intlist = Nil | Cons Integer Intlist If my understanding is correct, Haskell takes as the definition of `Intlist` the *greatest* solution to this recursion equation. That is, in a vaguely domain-theoretic way, Intlist is the greatest fixed point of the function f(S) = {Nil} union {Cons n ns | n in Integer, ns in S} It's this 'greatest fixed point' or coinductive definition that admits of infinite lists in the `Intlist` type. Right? Contrast this situation with recursion at the term level. Suppose I define evens :: Intlist evens = 0 `Cons` intmap (2+) evens where intmap f Nil = Nil intmap f (Cons n ns) = Cons (f n) (intmap f ns) Here the solution to the recursion equation is totally different---at the term level, the definition of `evens` is taken to mean the *least* fixed point of the function \e -> 0 `Cons` intmap (2+) e. In this case its not obvious that there's any difference, but if we consider strange :: Intlist strange = intmap (2*) strange then Haskell is very definitely going to make `strange` the least defined solution to this equation, which means `undefined` and not, for example, `Nil` or `Cons 0 Nil`, both of which also solve the recursion equation. Is this the right story? One of my difficulties is that I'm having trouble grasping what coinduction might mean for terms. For types/sets/domains, I've found Andy Gordon's very nice tutorial at http://research.microsoft.com/en-us/um/people/adg/publications/fp94.ps But I'm not sure what a greatest solution to an equation involving values might be, or even if such a thing exists (aside from adding an arbitrary top element to form a lattice of values, which seems most unsatisfying). Comments, corrections, and cues about good papers are all cheerfully solicited! Norman

5 5

2nd CfP: LOPSTR 2010
by Temur Kutsia 01 Feb '10

01 Feb '10

========================================================================= Call for papers 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate the feedback in the published papers. The 20th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2010) will be held in Hagenberg, Austria; previous symposia were held in Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2010 will be co- located with PPDP 2010 (12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in- the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation specialization inversion composition program/model manipulation certification security transformational techniques in SE applications and tools Survey papers that present some aspect of the above topics from a new perspective. Application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, publication of the formal post-conference proceedings in the Springer series Lecture Notes in Computer Science (LNCS) is envisaged. IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: March 25, 2010 Notification (for pre-proceedings): May 15, 2010 Camera-ready (for pre-proceedings): June 15, 2010 Symposium: July 23-25, 2010 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages, respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2010 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2010 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal post-proceedings. Papers should be submitted electronically via the submission page http://www.easychair.org/conferences/?conf=lopstr2010 They should be in PDF format and interpretable by Acrobat Reader. Invited Speakers: Bruno Buchberger RISC, Johannes Kepler University Linz, Austria Olivier Danvy University of Aarhus, Denmark Johann Schumann RIACS/NASA Ames Research Center, USA Program Committee: Maria Alpuente Tech. University of Valencia (Chair), Spain Sergio Antoy Portland State University, USA Gilles Barthe IMDEA Software, Madrid Manuel Carro Tech. University of Madrid, Spain Marco Comini University of Udine, Italy Danny De Schreye K.U.Leuven, Belgium Santiago Escobar Tech. University of Valencia, Spain Moreno Falaschi University of Siena, Italy Fabio Fioravanti University of Chieti - Pescara, Italy John Gallagher Roskilde University, Denmark Michael Hanus University of Kiel, Germany Patricia M Hill University of Parma, Italy Andy King University of Kent, UK Temur Kutsia Johannes Kepler University Linz, Austria Ralf L�mmel Universit�t Koblenz-Landau, Germany Michael Leuschel University of Southampton, UK Yanhong Annie Liu State University of New York at Stony Brook, USA Julio Mari�o Tech. University of Madrid, Spain Ricardo Pe�a University Complutense of Madrid, Spain Peter Schneider-Kamp University of Southern Denmark Alicia Villanueva Tech. University of Valencia, Spain Contacts Program Chair Maria Alpuente DSIC - Technical University of Valencia Camino de Vera s/n Apdo. 22.012 E-46022 Valencia (Spain) Email: alpuente(a)dsic.upv.es Conference Chair Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz Altenbergerstrasse 69 A-4040 Linz, Austria Email: kutsia(a)risc.uni-linz.ac.at

1 0

PAR 2010: First CFP
by Koen Claessen 01 Feb '10

01 Feb '10

(I am sending this on behalf of a colleague) [Papers dealing with partiality and termination using monadic programming or other functional programming techniques are welcome] Please distribute to those you might think are interested. ======================================================================== 1st Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop <http://www.cs.st-andrews.ac.uk/~ek/PAR-10/> ======================================================================== PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the PC for publication in the proceedings of the workshop. The final proceedings will be published after the workshop as a special issue of EPTCS and a preliminary version will be available during the workshop. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EPTCS macro package <http://style.eptcs.org/>. The web-based system EasyChair will be used for submission (<http://www.easychair.org/conferences/?conf=par10>). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 24 May 2010: Final version of accepted papers * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * TBA Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui

1 0