http://blog.gmane.org/gmane.comp.lang.haskell.general hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://permalink.gmane.org/gmane.comp.lang.haskell.general/16659 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM'09) January 19-20, 2009 Savannah, Georgia, USA http://clip.dia.fi.upm.es/Conferences/PEPM09 CALL FOR PARTICIPATION IMPORTANT DATES * Hotel reservation deadline: December 18, 2008 * Early registration deadline: December 19, 2008 VENUE PEPM'09 and all POPL'09 affiliated events will take place at the Hyatt Regency Savannah hotel. SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. PEPM is classified as category A in the CORE ranking of ICT conferences. INVITED TALKS: * Umut Acar. Toyota Technological Institute and Univ. of Chicago. Title: Self-Adjusting Computation * Cristina Cifuentes. Sun Microsystems Laboratories. Title: Program Analysis for Bug Detection using Parfait PROGRAM CHAIRS: German Puebla, Technical University of Madrid, Spain German Vidal, Technical University of Valencia, Spain PROGRAM COMMITTEE: David Binkley, Loyola College, USA Radhia Cousot, CNRS, France Silvia Crafa, University of Padova, Italy Stephen A. Edwards, Columbia University, USA Lidia Fuentes, University of Malaga, Spain John P. Gallagher, Roskilde University, Denmark Thomas Jensen, IRISA, France Yukiyoshi Kameyama, University of Tsukuba, Japan Siau Cheng Khoo, National University of Singapore, Singapore Julia Lawall, University of Copenhagen (DIKU), Denmark Shin-Cheng Mu, Academia Sinica, Taiwan Naoki Nishida, Nagoya University, Japan Maurizio Proietti, CNR, Italy Armin Rigo, University of Dusseldorf, Germany Simon Thompson, Kent University, UK Tarmo Uustalu, Tallinn University of Technology, Estonia Wim Vanhoof, Namur University, Belgium Joost Visser, Software Improvement Group, The Netherlands Janis Voigtlander, TU Dresden, Germany PRELIMINARY PROGRAM * MONDAY, January 19, 2009 ---------------------- ** Invited talk 9:00-10:00 Umut Acar. Toyota Technological Institute and University of Chicago. Title: Self-adjusting computation ---------------------- ** Static Analysis 10:30-12:30 *** Linear Logical Approximations Robert Simmons and Frank Pfenning *** Guided model checking for programs with polymorphism Neha Rungta and Eric Mercer *** Program Interpolation Andrew Moss and Dan Page *** Translation and Optimization for a Core Calculus with Exceptions Cristina David, Cristian Gherghina and Wei-Ngan Chin ---------------------- ** Partial Evaluation and Specialization 13:30-15:00 *** Is there a Fourth Futamura projection? Robert Glueck *** Type-based Specialization of XML Transformations Kazutaka Matsuda, Zhenjiang Hu and Masato Takeichi *** Partially evauated sensor networks Leon Evers and Jan Kuper ---------------------- ** Program Transformation I 15:30-17:00 *** Shortcut fusion rules for the derivation of circular and higher-order monadic programs Alberto Pardo, Joao Fernandes and Joao Saraiva *** A Flexible Framework for Programming with Non-deterministic Functions Francisco Javier Lopez-Fraguas, Juan Rodriguez-Hortala and Jaime Sanchez-Hernandez *** Program Transformation for Numerical Precision Matthieu Martel ---------------------- * TUESDAY, January 20, 2009 ---------------------- ** Invited talk 9:00-10:00 Cristina Cifuentes. Sun Microsystems Laboratories. Title: Program Analysis for Bug Detection using Parfait ---------------------- ** Types 10:30-12:30 *** Shifting the Stage: Staging with Delimited Control Yukiyoshi Kameyama, Oleg Kiselyov and Chung-chieh Shan *** Static Consistency Checking for Verilog Wire Interconnects Cherif Salama, Gregory Malecha, Walid Taha, Jim Grundy and John O'Leary *** Improving Type Error Messages for Generic Java Nabil El Boustani and Jurriaan Hage *** Bidirectional data-flow analyses, type-systematically Maria Joao Frade, Ando Saabas and Tarmo Uustalu ---------------------- ** Slicing and Profiling 13:30-15:00 *** CCCP - Complete Calling Context Profiling in Virtual Execution Environments Philippe Moret, Walter Binder and Alex Villazon *** CProf: Customizable Calling Context Cross-Profiling for Embedded Java Processors Philippe Moret, Walter Binder and Alex Villazon *** SOC: a Slicer for CSP Specifications Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit and Michael Leuschel ---------------------- ** Program Transformation II 15:30-17:00 *** Clone Detection and Removal for Erlang/OTP within a Refactoring Environment Huiqing Li and Simon Thompson *** From Spreadsheets to Relational Databases and Back Jacome Cunha, Joao Saraiva and Joost Visser *** Designing Aspects for Side-Effect Localization Kung Chen, Jia-Yin Lin, Shu-Chun Weng and Siau-Cheng Khoo ---------------------- G. Puebla and G. Vidal 2008-11-30T23:07:20 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16654 | However, preemptive multitasking operating systems offer support for waiting for multiple | "MVars", until *either* one of them returns (or timeouts). The standard way to do this is to spawn a thread for each MVar you are waiting for; the thread blocks on the MVar and, when it unblocks it fills a third MVar with the outcome. The original thread waits on this single MVar. See Section 5 of http://research.microsoft.com/users/simonpj/papers/concurrent-haskell.ps.gz Alternatively STM supports such multiple waiting directly http://research.microsoft.com/%7Esimonpj/papers/stm/index.htm#composble Simon | -----Original Message----- | From: haskell-bounces< at >haskell.org [mailto:haskell-bounces< at >haskell.org] On Behalf Of Peter | Verswyvelen | Sent: 26 November 2008 18:05 | To: haskell< at >haskell.org | Subject: [Haskell] Wait for *either* MVar to be set | | Maybe this is not the correct mailing list to ask this question, but as a similar question was | asked seemingly unanswered by Duncan Coutts in 2002 | (http://markmail.org/message/kftpnulks7mbz2ij), and as this most likely has to do with the GHC | runtime, I might have more luck to get an answer here... Sorry for the spam if this is | inappropriate; please say so and I will resubscribe to the Haskell Cafe mailing list, not | polluting this main list anymore... | | So here's my question. | | GHC provides MVar for nice lightweight concurrency synchronization. | | However, preemptive multitasking operating systems offer support for waiting for multiple | "MVars", until *either* one of them returns (or timeouts). | | I see no way of achieving this with GHC's MVar, unless using Conal Elliott's unamb package on | Hackage that emulates this by spawning and killing two threads (which might be an expensive | operation, I'm not sure) | | Am I wrong in this? If so, is this something that might be considered as a future enhancement | in the GHC libraries and runtime? | | Thanks very much, | Peter Verswyvelen | CTO - Anygma | | | | | _______________________________________________ | Haskell mailing list | Haskell< at >haskell.org | http://www.haskell.org/mailman/listinfo/haskell Simon Peyton-Jones 2008-11-27T08:48:28 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16653 Progress continues on Turbinado. Turbinado can be found at: http://www.turbinado.org The source can be found at: http://github.com/alsonkemp/turbinado/tree/master (see the /App directory for the code for www.turbinado.org) New in V0.2: * A better "Environment" type (rather than using Dynamics) (-> a 50% speed boost? That's unpossible!); * A functional early version of an ORM for PostgreSQL (note: still needs to handle updates; hdbc-postgresql has a bug with sensing nullable columns); * A prettier website; * Licensing -> BSD. Expect V0.3 in the next week or so with: * More view helpers; * An ORM which handles INSERT/UPDATE...; * A little CMS built using the ORM. Future release: * Separate the website out from the framework. For now, they're evolving together, so live together. Alson Kemp 2008-11-26T20:39:50 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16652 Maybe this is not the correct mailing list to ask this question, but as a similar question was asked seemingly unanswered by Duncan Coutts in 2002 (http://markmail.org/message/kftpnulks7mbz2ij), and as this most likely has to do with the GHC runtime, I might have more luck to get an answer here... Sorry for the spam if this is inappropriate; please say so and I will resubscribe to the Haskell Cafe mailing list, not polluting this main list anymore... So here's my question. GHC provides MVar for nice lightweight concurrency synchronization. However, preemptive multitasking operating systems offer support for waiting for multiple "MVars", until *either* one of them returns (or timeouts). I see no way of achieving this with GHC's MVar, unless using Conal Elliott's unamb package on Hackage that emulates this by spawning and killing two threads (which might be an expensive operation, I'm not sure) Am I wrong in this? If so, is this something that might be considered as a future enhancement in the GHC libraries and runtime? Thanks very much, Peter Verswyvelen CTO - Anygma Peter Verswyvelen 2008-11-26T18:04:57 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16649 The "else" should be replaced by "else do". Probably you'll also want the last line to be "return (c:cs)". By the way, questions like these might be more appropriate on haskell- beginners or haskell-cafe. -chris Chris Eidhof 2008-11-26T16:29:34 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16648 Hi Abdullah, On Wed, 2008-11-26 at 21:48 +0530, abdullah abdul Khadir wrote: a) you forgot a 'do' after 'else' b) your email would be answered quicker on haskell-beginners or haskell-cafe since haskell is mainly used for announcements. Axel. Axel Simon 2008-11-26T16:29:07 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16647 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell abdullah abdul Khadir 2008-11-26T16:18:49 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16646 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell abdullah abdul Khadir 2008-11-26T16:12:36 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16645 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell David Leimbach 2008-11-26T13:43:36 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16644 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell demis< at >dimi.uniud.it 2008-11-26T09:38:43 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16643 [Apologize if you receive multiple copies] Call for Papers TAP: Tests And Proofs 2009 The Third International Conference on Tests And Proofs (TAP) will be held at ETH Zurich, Switzerland on 2 and 3 July 2009. It will be co-located with TOOLS Europe 2009. The TAP conference is devoted to the convergence of proofs and tests. It combines ideas from both sides for the advancement of software quality. Purpose and Scope ----------------- To prove the correctness of a program is to demonstrate, through impeccable mathematical techniques, that it has no bugs; to test a program is to run it with the expectation of discovering bugs. The two techniques seem contradictory: if you have proved your program, it's fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on any hope to prove its correctness. Accordingly, proofs and tests have, since the onset of software engineering research, been pursued by distinct communities using rather different techniques and tools. And yet the development of both approaches leads to the discovery of common issues and to the realization that each may need the other. The emergence of model checking has been one of the first signs that contradiction may yield to complementarity, but 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 conference will include a mix of invited and submitted presentation, and a generous allocation of panels and informal discussions Topics ------- Possible topics include (as an indicative rather than exhaustive list): - Generation of test data, oracles, or preambles by deductive techniques such as o theorem proving, o model checking, o symbolic execution, o constraint logic programming, etc. - Generation of specifications by deduction - Verification techniques combining proofs and tests - Program proving with the aid of testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) - Automatic bug finding - Formal frameworks - Tool descriptions and experience reports - Case studies Invited speakers ---------------- Boutheina CHETALI Security Labs, Technology & Innovation Gemalto - France Sriram K. Rajamani Microsoft Research India Contributions ------------- Two kinds of contributions are expected: - Research papers: full papers of not more than 14 pages in LNCS format, which have to be original, unpublished and not submitted elsewhere. The research papers proceedings will be published in Springer's LNCS series. - Short presentations of work in progress, industrial experience reports and tool demonstrations. An extended abstract of not more than 3 pages is expected and will be reviewed. The accepted extended abstracts will be made available in supplementary proceedings. They will be presented during the cnference days. Important dates ---------------- * Submission deadline: 15 February 2009 * Notification of acceptance: 22 March 2009 * Submission of final camera-ready version: 15 April 2009 The dates are firm; no extension will be granted. Web site --------- http://tap.ethz.ch/2009 Call for Papers TAP: Tests And Proofs 2009 The Third International Conference on Tests And Proofs (TAP) will be held at ETH Zurich, Switzerland on 2 and 3 July 2009. It will be co-located with TOOLS Europe 2009. The TAP conference is devoted to the convergence of proofs and tests. It combines ideas from both sides for the advancement of software quality. Purpose and Scope ----------------- To prove the correctness of a program is to demonstrate, through impeccable mathematical techniques, that it has no bugs; to test a program is to run it with the expectation of discovering bugs. The two techniques seem contradictory: if you have proved your program, it's fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on any hope to prove its correctness. Accordingly, proofs and tests have, since the onset of software engineering research, been pursued by distinct communities using rather different techniques and tools. And yet the development of both approaches leads to the discovery of common issues and to the realization that each may need the other. The emergence of model checking has been one of the first signs that contradiction may yield to complementarity, but 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 conference will include a mix of invited and submitted presentation, and a generous allocation of panels and informal discussions Topics ------- Possible topics include (as an indicative rather than exhaustive list): - Generation of test data, oracles, or preambles by deductive techniques such as o theorem proving, o model checking, o symbolic execution, o constraint logic programming, etc. - Generation of specifications by deduction - Verification techniques combining proofs and tests - Program proving with the aid of testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) - Automatic bug finding - Formal frameworks - Tool descriptions and experience reports - Case studies Invited speakers ---------------- Boutheina CHETALI Security Labs, Technology & Innovation Gemalto - France Sriram K. Rajamani Microsoft Research India Contributions ------------- Two kinds of contributions are expected: - Research papers: full papers of not more than 14 pages in LNCS format, which have to be original, unpublished and not submitted elsewhere. The research papers proceedings will be published in Springer's LNCS series. - Short presentations of work in progress, industrial experience reports and tool demonstrations. An extended abstract of not more than 3 pages is expected and will be reviewed. The accepted extended abstracts will be made available in supplementary proceedings. They will be presented during the cnference days. Important dates ---------------- * Submission deadline: 15 February 2009 * Notification of acceptance: 22 March 2009 * Submission of final camera-ready version: 15 April 2009 The dates are firm; no extension will be granted. Web site --------- http://tap.ethz.ch/2009 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell Koen Claessen 2008-11-26T08:52:41 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16642 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell Donnie Jones 2008-11-26T07:29:05 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16641 Good evening - John Goerzen, Don Stewart and I are delighted to announce the availability of our book, "Real World Haskell". It is 710 pages long, and published by O'Reilly Media. This is the first book to comprehensively cover modern Haskell programming. From an introduction to functional programming, it focuses on teaching through many worked examples. We discuss the "awkward squad" of I/O, concurrency, and exceptions. We cover network programming, databases, and system hacking. We motivate and work with monoids, applicative functors, monads, and monad transformers. We show you how to debug code, and how to ship well-tested software. Better yet, the book is available under a Creative Commons license, so you can read as much of it as you please before you buy: http://book.realworldhaskell.org/ We developed this book with the enthusiastic and voluble support of the Haskell community, and we are proud to share our work in a fashion that will help newcomers to our field. And best of all, if you order now (at least in North America), you can have a copy of the book in your hands in a matter of days. Thank you from all of us to our friends in the Haskell world who have been so generous with their feedback and kind words! Bryan O'Sullivan 2008-11-26T05:15:54 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16640 ... I submitted my Habilitation thesis last week. The first few chapters of it try to give an introduction to Haskell with emphasis on types and reasoning principles. That might be an interesting read for some, so I made it accessible at http://wwwtcs.inf.tu-dresden.de/~voigt/habil.pdf. And yes, the November HCAR will also be coming. Rather soon now that this cause for delay is out of the way. Ciao, Janis. Janis Voigtlaender 2008-11-25T12:37:58 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16637 ------------------------------------------------------------------------ *PhD Student Positions in Programming Language-based Security* Dept. of Computer Science and Engineering Chalmers University of Technology, Sweden Application deadline: January 30, 2009 Full version of this announcement is at: http://www.chalmers.se/cse/EN/news/vacancies/positions/ph-d-positions-in ------------------------------------------------------------------------ *The Department* The department provides a strong, international, and dynamic research environment with about 75 faculty members. For more information, see http://www.chalmers.se/cse/EN/. ------------------------------------------------------------------------ *PhD Project* The PhD students will join a world-leading team of researchers on *programming language-based security*. Language-based security facilitates specifying and enforcing security policies at the level of programming languages early in the software design and construction phase. Drawing on the recent progress in this area, the goal of the positions is to pursue the following directions of work: * To design *rich security policies* for confidentiality and integrity, as demanded by practical applications (such as web applications). These security policies should be formal: they should operate at the level of programming-language semantics. * To develop *practical enforcement mechanisms* for these policies in expressive programming languages (such as web languages). These enforcement mechanisms may combine static (for example, type system-based) and dynamic (for example, execution monitoring-based) techniques. * To support the above with case studies in web-application security. In pursuing these goals, there are possibilities for collaboration with our high-profile academic and industrial partners. ------------------------------------------------------------------------ *Details about Employment* PhD student positions are limited to five years and will then normally include 20 per cent departmental work, mostly teaching duties. Salary for the position is as specified in Chalmers? general agreement for PhD student positions, currently around 23,000SEK a month before tax. The positions are intended to start in spring or fall 2009. ------------------------------------------------------------------------ *Suitable Background* Applicants must have a degree in Computing Science or in a related subject with a strong Computing Science component. They must also have a strong, documented interest in doing research. The ideal student for the project will have strong background in both programming languages and security. You may even apply if you have not yet completed your degree, but expect to do so before the position starts. In order to improve gender balance, Chalmers welcomes in particular applications from female candidates. ------------------------------------------------------------------------ *How to Apply* Application can be submitted electronically following the "Application details" and "Application procedure" guidelines at: http://www.chalmers.se/cse/EN/news/vacancies/positions/ph-d-positions-in Andrei Sabelfeld 2008-11-24T16:03:10 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16636 MLstate - currently in stealth mode - is an IT company, whose functional programming approach to SaaS and cloud computing has been recently recognized by the French Ministry of Research Innovation Award. We are research-oriented, we value technical excellence and innovation and we believe our technology has a potential to dramatically change the way web applications are being built. MLstate opens several new permanent positions to meet this challenge: - Senior Developers: Outstanding PhDs with at least 3 years of research experience in functional languages and/or formal verification and the ability to manage a small technical team. - Developers: PhDs with strong FP skills. Applications from PhD students defending their thesis soon and who should not be reading the caml list right now... are welcome. Jobs are based in Paris and include a competitive compensation package. Please send a (link to your) CV to julien.sylvestre< at >mlstate.com julien.sylvestre< at >mlstate.com 2008-11-24T11:21:10 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16635 | It's sad to see the OpenGL binding being dropped from GHC binary | installers starting from 6.10. Though this issue has been brought up | and discussed before, I'm sure a lot of people who based their work on | OpenGL would share the same sympathy. The plan (which we have perhaps not articulated as clearly as we should) is this: - We are trying to make the GHC release contain as few libraries as possible - Instead, you get the "batteries" for GHC (ie the libraries) from the Haskell Platform http://www.haskell.org/haskellwiki/Haskell_Platform This lets GHC HQ get out of the library business, and makes it easier to upgrade libraries independently from GHC. But it does mean that GHC without the batteries is a feeble thing. You really want to wait until the HP comes out. The HP will be released in source form, to be installed by cabal-install, of course. But I believe that the intention is that there should be a Windows installer for it too. Things I am less clear about - When will the first HP release compatible with GHC 6.10 appear? - How do users get cabal-install in the first place? Is there a windows installer for it? - Where can one find an up-to-date list of what packages are in HP? - Is there anyone who is actually planning to do the work of making a windows installer for the HP? The HP home page lists only Duncan and Don. I think it'd be good if it was easy to answer these questions from the HP home page. Simon Simon Peyton-Jones 2008-11-24T09:10:30 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16634 Nice except that: 1. The command cabal requires cabal-install package to be installed, is it already bundled with all GHC 6.10.1 distributions? 2. It still wouldn't work for the OpenGL package on Windows, because the configure scripts require a Unix-style built environment (MinGW/MinSys or Cygwin). Fair enough, a pitty that there is no rpm/emerge/macport equivalent for Windows. Paul L 2008-11-23T04:34:55 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16631 Hi everyone, It's sad to see the OpenGL binding being dropped from GHC binary installers starting from 6.10. Though this issue has been brought up and discussed before, I'm sure a lot of people who based their work on OpenGL would share the same sympathy. I'm not here to argue whether this decision by GHC dev team is right or wrong, but what's really causing the pain is that the OpenGL binding doesn't have its own binary installer for Windows, and compilation from source on this platform is non-trivial. I wouldn't recommend doing it for ordinary users. So my question is, are we going to see a binary installer for OpenGL binding provided separately from either HOpenGL site, or Hackage? Or even the GHC installation page? Paul L 2008-11-22T20:31:17 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16630 Hi, I tried to compile the following program by GHC {-# LANGUAGE CPP #-} module Packer where #define FLASH_APP_START 1 #define FLASH_APP_END 2 #define INSERT_SECTION(x) (#x, (FLASH_##x##_START, FLASH_##x##_END)) import qualified Data.Map as M import Data.Tuple import System.IO as Sys type Name = String type Boundary = (Int, Int) boundaryList = [INSERT_SECTION(APP)] main = Sys.print boundaryList But failed with test.hs:16:17: Not in scope: `#' test.hs:16:17: A section must be enclosed in parentheses thus: (# APP) test.hs:16:18: Not in scope: data constructor `APP' test.hs:16:24: Not in scope: data constructor `FLASH_' test.hs:16:30: Not in scope: `##' test.hs:16:32: Not in scope: data constructor `APP' test.hs:16:35: Not in scope: `##' Seems GHC does support macro like #x a##b. Is that true? If not, how to resolve? Thanks alot. Haihua haihualin 2008-11-22T09:33:38 http://permalink.gmane.org/gmane.comp.lang.haskell.general/16629 *** abstracts - November 28, full papers - December 5 *** LDTA: Workshop on Language Descriptions Tools and Applications http://www.ldta.info ===Call For Papers 2009=== This is the Call For Papers for the Ninth Workshop on Language Descriptions, Tools and Applications (LDTA 2009) LDTA is a two-day satellite event of ETAPS which takes on the 28th and 29th of March 2009 in York, England. Please submit your abstract and paper using http://www.easychair.org/conferences/?conf=ldta2009 ==Scope== LDTA is an application and tool oriented forum on meta programming in a broad sense. A meta program is a program that takes other programs as input or output. The focus of LDTA is on generated or otherwise efficiently implemented meta programs, possibly using high level descriptions of programming languages. Tools and techniques presented at LDTA are usually applicable in the context of "Language Workbenches" or "Meta Programming Systems" or simply as parts of advanced programming environments or IDEs. The applications areas include, but are not limited to: * Program analysis, transformation, generation and verification * Implementation of Domain Specific Languages (both visual and textual) * Reverse engineering and reengineering * Refactoring and other source-to-source transformations * Application modelling (MDE, MDA, Software Factories, Software product lines) * Grammar engineering / Grammarware * Language definition and language prototyping * Debugging, profiling and testing * IDE construction * Compiler construction LDTA is a well-established workshop next to other conferences and workshops on (programming) language engineering topics such as SLE and GPCE. LDTA is traditionally a forum where computer science theories are put to the test of real-world software engineering issues, for example by applying: * context-free grammars to parser generation for real programming languages, * attribute grammars to static analyzer and compiler generation, * term rewriting to source-to-source transformation, * action semantics to programming language implementation, * model checking to software verification. Note that LDTA solicits submissions from any technological or theoretical domain, as long as the paper is within the application scope. ==Submission Procedure and Publication== Submissions in the following categories are admissible: * research papers, * tool papers, * experience papers The final versions of accepted papers will probably(*) be published in Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier Science, and will be made available during the workshop. (*)Due to organizational changes at Elsevier, publication by ENTCS publication is provisional; another comparable venue will be found otherwise. Each submission must: * clearly and unambiguously state in which of the three categories it falls * be original, i.e. not published or submitted elsewhere, * contain a clear motivation, * contain a thorough analysis of the claimed contributions (for example by comparing to related work), * be written in less than 15 pages (research papers and experience reports), or less than 10 pages (tool papers) * use the ENTCS style. The authors of each submission are required to give a presentation at LDTA 2009. The authors of the tool papers are required to include an interactive demonstration in their presentations. The authors of the best papers will be invited to write a journal version of their paper which will be separately reviewed and, assuming acceptance, be published in journal form. As in past years, this will be done in a special issue devoted to LDTA 2009 of the journal Science of Computer Programming (Elsevier Science). The authors of the best tool papers will be invited to write a paper and submit the source of code of their tool, which will both be separately reviewed and, assuming acceptance, be published in the special issue on Experimental Software and Toolkits (EST) of the journal Science of Computer Programming (Elsevier Science). Please submit your abstract and paper using http://www.easychair.org/conferences/?conf=ldta2009 ==Program Committee== Jurgen Vinju, CWI, Amsterdam (co-chair) Torbjörn Ekman, Oxford, UK (co-chair) Erik Meijer, Microsoft, Redmond, USA Walid Taha, Rice University, Houston USA Bob Fuhrer, IBM TJ Watson, USA Susan Eisenbach, Imperial College, UK Jean-Marie Jacquet, FUNDP, Namur, Belgium Sibylle Schuppe, Chalmers, Sweden Elizabeth Scott, RHUL, UK Robert Grimm, NYU, USA Judith Bishop, Pretoria, South Africa Tudor Girba, Univ of Berne, Switzerland Marjan Mernik, University of Maribor, Slovenia Thomas Dean, Fondazione Bruno Kessler - IRST, Italy Martin Bravenboer, Univ. of Oregon, USA Pierre-Etienne Moreau, INRIA-LORIA, France Gabi Taentzer, Philipps-Universität Marburg, Germany Joao Saraiva, Universidade do Minho, Braga, Portugal Tijs van der Storm, CWI, The Netherlands Stephen Edwards, Columbia University, USA Peter Thiemann, Universität Freiburg, Germany ==Important Dates== Abstract submission deadline:Friday November 28th, 2008 Paper submission deadline:Friday December 5th, 2008 Notification of acceptance:Friday February 6th, 2009 Workshop date:28th and 29th of March, 2009 Torbjorn.Ekman< at >comlab.ox.ac.uk 2008-11-21T09:25:43 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.haskell.general