Principles and Practice of Declarative Programming (PPDP'2005)

Call for Papers

 

Submission Guidelines

Papers should be submitted electronically by 22 February 2005 via the symposium's submission page. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 12 pages (including bibliography and appendices) in standard ACM conference format. They must be written in English, must have a cover page with an abstract of up to 200 words, keywords, postal and electronic mailing addresses, and phone and fax numbers of the corresponding author.

Evaluation of Submissions

Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Submissions that do not meet these guidelines may not be considered.

Proceedings

Proceedings will be published by ACM Press. ACM formatting guidelines are available at http://www.acm.org/sigs/pubs/proceed/template.html, along with formatting templates or style files for LaTeX, Word Perfect, and Word. Authors of accepted papers will be required to sign the ACM copyright form. Information on SIGPLAN's Republication Policy is available on the web.

Important Dates

Submission: 22 February 2005
Notification: 1 April 2005
Final Version: 1 May 2005
Conference: 11-13 July 2005

 

This call is available in postscript and PDF formats.

 

Accepted Papers

A COMPOSITIONAL SEMANTICS FOR CHR
Giorgio Delzanno, Maurizio Gabbrielli, Maria Chiara Meo

A NEW CALCULUS OF CONTEXTS
Murdoch Gabbay

A RESOLUTION STRATEGY FOR VERIFYING CRYPTOGRAPHIC PROTOCOLS WITH CBC
ENCRYPTION AND BLIND SIGNATURES
Veronique Cortier, Michael Rusinowitch, Eugen Zalinescu

ABSTRACT INTERPRETATION FOR CONSTRAINT HANDLING RULES
Tom Schrijvers, Peter J. Stuckey, Gregory J. Duck

AUTOMATIC TYPE INFERENCE VIA PARTIAL EVALUATION
Aaron Tomb and Cormac Flanagan

EFFICIENTLY COMPILING A FUNCTIONAL LANGUAGE ON AMD64: THE HIPE
EXPERIENCE
Daniel Luna, Mikael Pettersson, Konstantinos Sagonas

FORMAL VALIDATION OF PATTERN MATCHING CODE
Claude Kirchner, Pierre-Étienne Moreau, Antoine Reilles

HEURISTICS, OPTIMIZATIONS, AND PARALLELISM FOR PROTEIN STRUCTURE
PREDICTION IN CLP(FD)
Alessandro Dal Palu', Agostino Dovier, Enrico Pontelli

INCREMENTAL AND DEMAND-DRIVEN POINTS-TO ANALYSIS USING LOGIC
PROGRAMMING
Diptikalyan Saha and C. R. Ramakrishnan

INVERTING ABSTRACT UNIFICATION FOR SET SHARING
Xuan Li, Lunjin Lu

ISOLATION-ONLY TRANSACTIONS BY TYPING AND VERSIONING
Pawel T. Wojciechowski

MONADIC CONCURRENT LINEAR LOGIC PROGRAMMING
Pablo Lopez, Frank Pfenning, Jeff Polakow, Kevin Watkins

NOMINAL REWRITING WITH NAME GENERATION: ABSTRACTION VS. LOCALITY
Maribel Fernandez and Murdoch Gabbay

OPTIMIZATION WITH MODE-DIRECTED PREFERENCES
Hai-Feng Guo, Bharat Jayaraman, Gopal Gupta, Miao Liu

PROGRAM TRANSFORMATION BY TEMPLATES BASED ON TERM REWRITING
Yuki Chiba and Takahito Aoto and Yoshihito Toyama

REACTIVEML, A REACTIVE EXTENSION TO ML
Louis Mandel and Marc Pouzet

SECURITY POLICY IN A DECLARATIVE STYLE
Rachid Echahed and Frederic Prost

SELF-TUNING RESOURCE AWARE SPECIALISATION FOR PROLOG
Stephen-John Craig, Michael Leuschel

TIMED CONSTRAINT PROGRAMMING: A DECLARATIVE APPROACH TO USAGE CONTROL
Radha Jagadeesan, Will Marrero, Corin Pitcher, Vijay Saraswat

TRACE EFFECTS AND OBJECT ORIENTATION
Christian Skalka