December 2007 - Haskell

Mathematics of Program Construction 2008: Call for papers
by Jeremy Gibbons 14 Dec '07

14 Dec '07

I don't believe that has been sent to the Haskell mailing list before, but apologies if it has. This CFP has been around since October; the submission deadline is 14th Jan (abstracts). Jeremy * CALL FOR PAPERS 9th International Conference on Mathematics of Program Construction (MPC'08) Marseille (Luminy), France, July 15-18th 2008 http://mpc08.lri.fr BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST '04) and Kuressaare, Estonia (2006, colocated with AMAST '06). The 2008 conference will be held in Marseille, France at the International Center for Mathematical Meetings (http://http://www.cirm.univ-mrs.fr/web.ang) INVITED SPEAKERS To be announced. IMPORTANT DATES * Submission of abstracts: 14 January 2008 * Submission of full papers: 21 January 2008 * Notification of authors: 10 March 2008 * Camera-ready version: 10 April 2008 TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. Some typical areas are type systems, program analysis and transformation, programming-language semantics, program logics. Theoretical contributions are welcome provided their relevance for program construction is clear. Reports on applications are welcome provided their mathematical basis is evident. SUBMISSION Submission is in two stages. Abstracts (plain text) must be submitted by 14 January 2008. Full papers (pdf) adhering to the llncs style must be submitted by 21 January 2008. There is no official page limit, but authors should strive for brevity. The web-based submission system will open in early December 2007. Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. The proceedings of MPC'08 will be published in the Lecture Notes in Computer Science series of Springer-Verlag. After the conference, the authors of the best papers will be invited to submit revised versions to a special issue of the Science of Computer Programming journal of Elsevier. PROGRAMME COMMITTEE Christine Paulin-Mohring INRIA-Université Paris-Sud, France (chair) Philippe Audebaud Ecole Normale Supérieure Lyon, France (co-chair) Ralph-Johan Back Abo Akademi University, Finland Eerke Boiten University of Kent, UK Venanzio Capretta University of Nijmegen, Netherlands Sharon Curtis Oxford Brookes University, UK Jules Desharnais Université Laval, Québec, Canada Peter Dybjer Chalmers University of Technology, Sweden Jeremy Gibbons University of Oxford, UK Lindsay Groves Victoria University of Wellington, New Zealand Ian Hayes University of Queensland, Australia Eric Hehner University of Toronto, Canada Johan Jeuring Utrecht University, Netherlands Dexter Kozen Cornell University, USA Christian Lengauer Universität Passau, Germany Lambert Meertens University of Utrecht, Netherlands Bernhard Möller Universität Augsburg, Germany Carroll Morgan University of New South Wales, Australia Shin-Cheng Mu Academia Sinica, Taiwan Jose Nuno Oliveira Universidade do Minho, Portugal Tim Sheard Portland State University, USA Tarmo Uustalu Institute of Cybernetics Tallin, Estonia VENUE The conference will be held in Marseille, the second largest city in France next to Paris. Its port is the most important in France, and opens the city to the world through the Mediterranean Sea. MPC'08 will be hosted by the International Center for Mathematical Meetings. The center is located inside the Campus of Luminy Faculty. It is close to the "Calanques", an astounding wild coastline composed of creeks stretching from Marseille to Cassis. LOCAL ORGANIZERS MPC 2008 is organized with the support of INRIA. The local organizers are Philippe Audebaud and Christine Paulin-Mohring. Enquiries regarding the programme (submission etc.) should be addressed to mpc08(at)lri.fr

1 0

Genuine shift/reset in Haskell98
by oleg＠okmij.org 12 Dec '07

12 Dec '07

This message announces the Haskell98 implementation of Asai and Kameyama's polymorphic delimited continuations, with effect typing, full soundness (well-typed terms don't give any run-time exceptions), answer-type modification and polymorphism. Thanks to parameterized monads the implementation is the straightforward translation of the rules of the calculus. Parameterized monads seem to have proven their claim for syntactic sugar. http://okmij.org/ftp/Haskell/ShiftResetGenuine.hs Delimited control operators shift/reset are, fortunately, becoming popular. Alas, all widely available implementations suffer deficiencies: for example, the type system does not prevent attempts to execute shift outside the dynamic scope of reset, which leads to a run-time error. Furthermore, the implementations do not permit modifications of the answer-type, and so make impossible many elegant applications of shift/reset such as fully typed sprintf. In particular, shift id (or, shift return, in the monadic form), so often used in linguistics, are not typeable in any widely available implementation of delimited continuations. Related to the first issue, implemented calculi of delimited continuations are not strongly normalizing. That fact has been known for some time; it has been shown recently that the calculus of multi-prompt delimited continuations -- the DC calculus of the DDBinding paper, implemented in the DelimCC Haskell library -- expresses the fix-point combinator and emulates general recursive types, and so is, in fact, Turing complete. http://okmij.org/ftp/Computation/Continuations.html#delimcc-rectype Back in 1989 Danvy and Filinski recognized that ensuring strong type soundness (aka, control decency: no naked shift) requires a type-and-effect system. They proposed a (monomorphically typed) type system with answer-type modifications. Alas, it has not been implemented in any widely available language (or even formally published for that matter: the only source is the DIKU Technical Report). In the recent APLAS 2007 paper, Asai and Kameyama have developed a polymorphically typed calculus of delimited continuations with answer type modifications. They have proven greatly desirable properties of their calculus: strong type soundness, principal types, the existence of a type inference algorithm, preservation of types and equality through CPS translation, confluence, strong normalization for the subcalculus without fix. http://logic.cs.tsukuba.ac.jp/~kam/paper/aplas07.pdf http://pllab.is.ocha.ac.jp/~asai/papers/aplas07slide.pdf The particularly elegant application of their calculus is typed sprintf: sprintf format_expression arg1 arg2 .... The type system ensures that the number and the types of format specifiers in format_expression agree with the number and the types of arg1, etc. Provided control operators supporting both answer-type modification and polymorphism, sprintf is expressible as a regular function (and a very simple one: the entire solution takes only four lines). This problem is described in more detail in http://pllab.is.ocha.ac.jp/~asai/papers/tr07-1.ps.gz Alas, Asai and Kameyama's calculus has only been implemented in a privately modified version of mini-ML. This link at the beginning points to the complete, short implementation, including the sprintf example. The implementation is in Haskell98; contrary to the popular belief, the latter is still a capable language. Thus the genuine control operators have become practically available for the first time. We rely on parameterized monads, Robert Atkey, Parameterised Notions of Computation, Msfp2006 http://homepages.inf.ed.ac.uk/ratkey/param-notions.pdf see also http://www.haskell.org/pipermail/haskell/2006-December/018917.html To be more precise, we represent the the effectful expression e, whose type is characterized by the judgment Gamma; a |- e:tau; b as a parameterized monad C a b tau. We represent an effectful function type sigma/a -> tau/b of the calculus as an arrow type sigma -> C a b tau. We greatly benefit from two lucky circumstances. First, the rule 'app' of Asai and Kameyama (Fig 3 of their paper) turns out to be expressible as a composition of two binds in the parameterized monad. Second, the existing type inference of Haskell matches unbelievably well with the let-rule of Asai and Kameyama: the type of only pure expressions can be generalized. Indeed, impure expressions have the type C a b tau and can be meaningfully used only with bind, which forces the monomorphic treatment. Pure expressions such as functions, numbers, etc. can be applied without the assistance of bind; luckily, Haskell generalizes the type in their definitions automatically. The rest of the implementation is the trivial transcription of the types in Fig 3 and the derivation of the corresponding proof terms. The sprintf test has the following form (slightly less elegant compared to ML) stest1 = run $ sprintf (ret "Hello world") -- "Hello world" stest2 = run $ sprintf (ret "Hello " ^ fmt str ^ ret "!") $$ "world" -- "Hello world!" stest3 = run $ sprintf (ret "The value of " ^ fmt str ^ ret " is " ^ fmt int) $$ "x" $$ 3 -- "The value of x is 3" Obviously, the type of sprintf (format_expression) depends on the number and the type of format specifiers (fmt) in the format expression. The function sprintf is a simple ordinary function: sprintf p = reset p

1 0

CUFP Report Available
by Kathleen Fisher 11 Dec '07

11 Dec '07

Jeremy Gibbons has written a very detailed report on the 2007 Commercial Users of Functional Programming Workshop. His report is available from the CUFP web page (http:// cufp.functionalprogramming.com) as well as from the CUFP google group page (http://groups.google.com/group/cufp) Thank you, Jeremy! Peter Thiemann and his students are just finishing up the post processing of the recordings of the talks, and we are in the process of getting those talks loaded onto the web. I'll send a further announcement when the talks are available. Kathleen

1 0

Call for Papers - PAPP 2008
by Loulergue Frédéric 10 Dec '07

10 Dec '07

===================================================== PAPP 2008 Fifth International Workshop on aPpplications of declArative and object-oriented Parallel Programming part of The International Conference on Computational Science June 23-25, 2008, Krakow, Poland http://f.loulergue.free.fr/PAPP2008 ===================================================== AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Parallel and grid computing are solutions to the increasing need for computing power. High level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimization of high-level programming languages, libraries, middlewares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hotspot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications. Thus the Fifth PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. Topics We welcome submission of original, unpublished papers in English on topics including: * applications in all fields of high-performance computing and visualisation (using high-level tools) * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel language design, implementation and optimisation * modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * benchmarks and experiments using such languages and tools All the contributions should illustrate the proposed techniques on a significant application. PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series, as part of the ICCS proceedings. Submission must be done through the ICCS website: http://www.iccs-meeting.org/iccs2008/papers/upload.php. We invite you to submit a full paper of 8 pages formatted according to the rules of LNCS, describing new and original results, no later than January 3, 2008. Submission implies the willingness of at least one of the authors to register and present the paper. An early email to papp at free.fr with your intention to submit a paper would be greatly appreciated (especially if you have doubts about the relevance of your paper). Accepted papers Accepted papers should be presented at the workshop. Authors will be invited to submit extended and revised versions of their papers. Accepted manuscripts will be published in a special issue of Scalable Computing: Practice and Experience. Important Dates * January 3, 2008 - Full paper due * March 1, 2008 - Notification * March 15, 2008 - Camera-ready paper due * September 15, 2008 - Journal version due PROGRAMME COMMITTEE * Marco Aldinucci (University of Pisa, Italy) * Anne Benoit (ENS Lyon, France) * Umit V Catalyurek (The Ohio State University, USA) * Manuel Chakravarty (University of New South Wales, Australia) * Frédéric Gava (University Paris XII Val de Marne, France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (University of Luebeck, Germany) * Iwasaki Hideya (The University of Electro-communications, Japan) * Paul H J Kelly (Imperial College London, UK) * Christoph Kessler (Linköpings Universitet, Sweden) * Rita Loogen (University of Marburg, Germany) * Frédéric Loulergue (The University of Orléans, France) * Kiminori Matsuzaki (The University of Tokyo, Japan) * Samuel Midkiff (Purdue University, USA) * Susanna Pelagatti (University of Pisa, Italy) * Bruno Raffin (INRIA, France) * Casiano Rodriguez Leon (University La Laguna, Spain) ORGANIZERS * Dr. Anne BENOIT Laboratoire d'Informatique du Parallelisme Ecole Normale Supérieure de Lyon 46 Allée d'Italie 69364 Lyon Cedex 07 - France * Pr. Frederic LOULERGUE Laboratoire d'Informatique Fondamentale d'Orléans Université d'Orléans Batiment IIIA - Rue Léonard de Vinci - BP6759 45067 Orléans Cedex 2 - France

1 0

ANNOUNCE: xmonad 0.5: a tiling window manager
by Don Stewart 10 Dec '07

10 Dec '07

The xmonad dev team is pleased to announce the 0.5 release of xmonad! http://xmonad.org xmonad is a tiling window manager for X. Windows are arranged automatically to tile the screen without gaps or overlap, maximising screen use. Window manager features are accessible from the keyboard: a mouse is optional. xmonad is extensible in Haskell, allowing for powerful customisation. Custom layout algorithms, key bindings and other extensions may be written by the user in config files. Layouts are applied dynamically, and different layouts may be used on each workspace. Xinerama is fully supported, allowing windows to be tiled on several physical screens. Features: * Very stable, fast, small and simple. * Automatic window tiling and management * First class keyboard support: a mouse is unnecessary * Full support for tiling windows on multi-head displays * Full support for floating windows * XRandR support to rotate, add or remove monitors * Per-workspace layout algorithms * Per-screens custom status bars * Easy, powerful customisation and reconfiguration in Haskell * Large extension library * Extensive documentation and support for hacking Get it! More information, screenshots, documentation, tutorials and community resources are available from the xmonad home page: http://xmonad.org The 0.5 release, and its dependencies, are available from hackage.haskell.org, here: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad **The headlines** xmonad 0.5 is a major new release of xmonad, allowing, for the first time, dynamic extension in Haskell without requiring recompilation. Extension and configuration of xmonad is now faster, simpler, and more flexible. All configuration is done via the ~/.xmonad/xmonad.hs file. Example config files and screenshots are available on the wiki: http://haskell.org/haskellwiki/Xmonad/Config_archive This marks the final break from its dwm origins. As a result, xmonad is now also much easier to package, distribute and extend, as recompilation of xmonad is not required to extend it. New features: * xmonad is now a library, as is the collection of xmonad extensions * xmonad is configured by editing ~/.xmonad/xmonad.hs * simpler layout hooks type and interface * small EDSL for writing window management rules * support for ghc 6.8.x * xmonad now requires Cabal 1.2 or newer * small bug fixes Extensions: xmonad comes with a huge library of extensions (now more than 5 times the size of xmonad), contributed by viewers like you. Extensions enable pretty much arbitrary window manager behaviour to be implemented by users, in Haskell, in the config files. Examples include: * ion-like window tabs * status bar support * X property and hints support * altnerative layout algorithms For more information on using and writing extensions see the webpage. The library of extensions is available from hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad-contrib Brought to you by the xmonad team: Spencer Janssen Don Stewart Jason Creighton Andrea Rossato David Roundy Brent Yorgey with code contributions from: Brandon Allbery Chris Mears Shachaf Ben-Kiki Eric Mertens Alec Berryman Neil Mitchell Gwern Branwen Devin Mullins Joachim Breitner Daniel Neri Alexandre Buisse Stefan O'Rear Nick Burlett Simon Peyton Jones Peter De Wachter Hans Philipp Annen Aaron Denney Karsten Schoelzel Nelson Elhage Michael Sloan Shae Erisson Ivan Tarasov Joachim Fasting Alex Tarkovsky Michael Fellinger Christian Thiemann David Glasser Joe Thornber Kai Grossjohann Matsuyama Tomohiro Dave Harrison Daniel Wagner Juraj Hercek Ferenc Wagner Sam Hughes Jamie Webb Miikka Koskinen Klaus Weidner David Lazar nornagon Lucas Mai timthelion Robert Marlow Valery V. Vorotyntsev Dougal Stanton Joel Suovaniemi Mats Jansborg Dmitry Kurochkin Clemens Fruhwirth As well as the support of many others on the #xmonad and #haskell IRC channels, and the wider Haskell and window manager communities. Thanks to everyone for their support!

1 0

Last chance to recruit functional programmers via "Jobs in Functional Programming" at Chalmers
by John Hughes 10 Dec '07

10 Dec '07

Im happy to report that the Jobs in Functional Programming event to be held at Chalmers this Friday looks like being a big success. We have seven companies involved, and five speakersand almost 70 people registered BEFORE we put up posters around the campus, including some people who are travelling from other countries just for this event. If youre recruiting functional programmers, and you HAVENT got in touch with me yet, then there is still timealthough I cant accept any more speakers now. But if you would like to send recruitment materials, then I will be only too happy to ensure that participants receive a copy. Just dont ask me to print your materials for you: there wont be time for that. If you would like to send such materials, then courier them to me at Department of Computer Science and Engineering Chalmers University of Technology S-41296 GÖTEBORG Sweden They need to arrive by Friday morning at the latest. Let me know by email to expect them. Its delightful to find that there are both job-seekers and employers enough to make this kind of event a success! John Hughes

1 0

IVars
by Conal Elliott 09 Dec '07

09 Dec '07

what became of (assign-once) IVars? afaict, they were in concurrent haskell and now aren't.

5 8

SAS 2008 Second Call for Papers
by German Vidal 07 Dec '07

07 Dec '07

PLEASE POST --> SAS 2008 at the Technical University of Valencia We are happy to announce that SAS 2008, the Static Analysis Symposium, will take place at the Technical University of Valencia: Submission of abstract: January 12, 2008 Submission of full paper: January 19, 2008 Notification: March 7, 2008 Camera-ready version: April 5, 2008 Conference: July 16-18, 2008 Please see: http://www.dsic.upv.es/~sas2008/ ** The submission site is now open ** Maria Alpuente, German Vidal (PC co-chairs) --------------------------------------------------------------------------- Call for papers Static Analysis Symposium - SAS 2008 16-18 July 2008, Valencia, Spain (co-located with LOPSTR 2008) url http://www.dsic.upv.es/~sas2008 email sas2008(a)dsic.upv.es Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification of programming languages and systems. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The technical programme for SAS 2008 will consist of invited lectures and presentations of refereed papers. Contributions are welcome on all aspects of static analysis, including, but not limited to: abstract domains abstract interpretation abstract testing compiler optimizations control flow analysis data flow analysis model checking program specialization security analysis theoretical analysis frameworks type based analysis verification systems Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. Survey papers, that present some aspect of the above topics from a new perspective, and 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. Submitted papers should be at most 15 pages formatted in LNCS style (excluding bibliography and well-marked appendices not intended for publication). PC members are not required to read the appendices, and thus papers should be intelligible without them. The conference proceedings is planned to be published by Springer-Verlag in the Lecture Notes in Computer Science series. Invited Speakers Roberto Giacobazzi (Universita' degli Studi di Verona, Italy) Ben Liblit (University of Wisconsin-Madison, USA) PC co-chairs Maria Alpuente (Technical University of Valencia, Spain) German Vidal (Technical University of Valencia, Spain) PC members Elvira Albert (Complutense University of Madrid, Spain) Roberto Bagnara (University of Parma, Italy) Maurice Bruynooghe (Katholieke Universiteit Leuven, Belgium) Radhia Cousot (CNRS & Ecole Polytechnique, France) Javier Esparza (Technical University of Munchen, Germany) Sandro Etalle (University of Twente, The Netherlands) Moreno Falaschi (University of Siena, Italy) Stephen Fink (IBM T.J. Watson Research Center, USA) John Gallagher (Roskilde University, Denmark) Maria del Mar Gallardo (University of Malaga, Spain) Chris Hankin (Imperial College, UK) Manuel Hermenegildo (Technical University of Madrid, Spain) Julia Lawall (University of Copenhagen, Denmark) Alexey Loginov (IBM T.J. Watson Research Center, USA) Hanne Riis Nielson (Technical University of Denmark, Denmark) David Schmidt (Kansas State University, USA) Harald Sondergaard (University of Melbourne, Australia) Tachio Terauchi (Tohoku University, Japan) Ji Wang (National Laboratory for Parallel and Distributed Processing, China) Organizing committee chair Alicia Villanueva (Technical University of Valencia, Spain) Important dates Submission of abstract: January 12, 2008 Submission of full paper: January 19, 2008 Notification: March 7, 2008 Camera-ready version: April 5, 2008 Conference: July 16-18, 2008 ---------------------------------------------------------------------------

1 0

Re: PADL'08: Call for Participation (Early Reg. Deadline: Dec 13)
by Paul Hudak 07 Dec '07

07 Dec '07

> CALL FOR PARTICIPATION!!! > > Tenth International Symposium on > Practical Aspects of Declarative Languages 2008 > (PADL '08) > > http://www.ist.unomaha.edu/padl2008/ > > San Francisco, USA > January 7-8, 2008 > > Co-located with ACM POPL'08 > > You are cordially invited to the Tenth International Symposium on > Practical Aspects of Declarative Languages that will be held on Jan 7-8, > 2008 right before ACM POPL. The program includes invited talks by two > eminent practitioners of declarative techniques/languages: John Launchbury > and Walter Wilson. If you are attending ACM POPL, we encourage > you to stay for a whole week in San Francisco and attend PADL as well. > Please note that the deadline for early registration is fast approaching. > > Invited Talks: > > o Industrial Functional Programming > John Launchbury > > o Large Scale Logic Servers in Business and Government > Walter Wilson > > LIST OF ACCEPTED PAPERS > > o Efficient Reasoning for Nogoods in Constraint Solvers with BDDs > Sathiamoorthy Subbarayan. > o High-Level Database Programming in Curry > Bernd Brassel, Michael Hanus and Marion Mueller. > o Parser Combinators for Ambiguous Left-Recursive Grammars > Richard Frost, Rahmatullah Hafiz and Paul Callaghan. > o Switched-on Yampa. Declarative Programming of Modular Synthesizers > George Giorgidze and Henrik Nilsson. > o The Role of Abduction in Declarative Authorization Policies > Moritz Y. Becker and Sebastian Nanz. > o Towards a High-Level Implementation of Execution Primitives for > Non-restricted, Independent And-parallelism > Amadeo Casas, Manuel Carro and Manuel Hermenegildo. > o Certified development tools implementation in Objective Caml > B. Pagano, O. Andrieu, B. Canou, E. Chailloux, > J-L Colaco, T. Moniot and P. Wang. > o DCGs + Memoing = Packrat Parsing: But is it worth it? > Ralph Becket and Zoltan Somogyi. > o Model-Based Testing of Thin-Client Web Applications and Navigation Input > P. Koopman, P. Achten and R. Plasmeijer. > o Unification of Arrays in Spreadsheets with Logic Programming > Phil Cox and Patrick Nicholson. > o A Generic Programming Toolkit for PADS/ML: First-Class Upgrades > for Third-Party Developers > M. Fernandez, K. Fisher, J. Nathan Foster, M. Greenberg and Y. Mandelbaum. > o Automatic Coding Rule Conformance Checking Using Logic Programming > G. Marpons, J. Mario, A. Herranz, L. Fredlund, > M. Carro and J. J. Moreno-Navarro. > o Multi-threading programming in Logtalk > Paulo Moura, Paul Crocker and Paulo Jorge Nunes. > o Scheduling light-weight parallelism in ARTCOP > Jost Berthold, Abyd Al Zain and Hans-Wolfgang Loidl. > o Specialising Simulator Generators for High-Performance Monte-Carlo Methods > G. Keller, H. Chaffey-Millar, M. Chakravarty, D. Stewart and C. Barner-Kowollik. > o Hierarchical Master-Worker Skeletons > Jost Berthold, Mischa Dieterle, Rita Loogen and Steffen Priebe. > o Comprehension and dependency analysis of aspect-oriented programs through declarative reasoning > Laleh Mousavi Eshkevari, Venera Arnaoudova and Constantinos Constantinides. > o An Improved Continuation Call-Based Implementation of Tabling > Pablo Chico de Guzman, Manuel Carro, Manuel Hermenegildo, > Claudio Silva and Ricardo Rocha. > o Matchete: Paths through the Pattern Matching Jungle > Martin Hirzel, Nathaniel Nystrom, Bard Bloom and Jan Vitek. > o Flexible, Rule-based Constraint Model Linearisation > Sebastian Brand, Gregory Duck, Jakob Puchinger and Peter Stuckey. > > Conference Organization: > > General Chair: Hai-Feng Guo > Program Chair: Paul Hudak & David Warren >

1 0

[Fwd: PADL'08: Call for Participation (Early Reg. Deadline: Dec 13)]
by Paul Hudak 06 Dec '07

06 Dec '07

1 0