Conferences in DBLP

Principles and Practice of Declarative Programming (PPDP) (ppdp)
2001 (conf/ppdp/2001)

1. David A. Schmidt
   Should UML Be Used for Declarative Programming? [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:1-3 [Conf]
   
2. David A. Naumann
   Ideal Models for Pointwise Relational and State-Free Imperative Programming. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:4-15 [Conf]
   
3. Fairouz Kamareddine, Roel Bloo, Rob Nederpelt
   De Bruijn's Syntax and Reductional Equivalence of Lambda-Terms. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:16-27 [Conf]
   
4. Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo
   A Denotational Semantics for Timed Linda. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:28-36 [Conf]
   
5. Javier Esparza
   Model Checking (with) Declarative Programs. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:37- [Conf]
   
6. Manuel Hernández, David A. Rosenblueth
   Development Reuse and the Logic Program Derivation of Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:38-48 [Conf]
   
7. Henrik Nässén, Mats Carlsson, Konstantinos F. Sagonas
   Instruction Merging and Specialization in the SICStus Prolog Virtual Machine. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:49-60 [Conf]
   
8. Pawel Rychlikowski, Tomasz Truderung
   Polymorphic Directional Types for Logic Programming. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:61-72 [Conf]
   
9. Annalisa Bossi, Nicoletta Cocco, Sabina Rossi
   Termination of Well-Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
   PPDP, 2001, pp:73-81 [Conf]
   
10. Salvador Lucas
    Termination of On-Demand Rewriting and Termination of OBJ Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:82-93 [Conf]
    
11. Byeong-Mo Chang, Jang-Wu Jo
    Granularity of Constraint-Based Analysis for Java. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:94-102 [Conf]
    
12. Mark Hepburn, David Wright
    Trust in the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:103-114 [Conf]
    
13. Christian Schulte, Peter J. Stuckey
    When Do Bounds and Domain Propagation Lead to the Same Search Space? [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:115-126 [Conf]
    
14. Slim Abdennadher, Christophe Rigotti
    Using Confluence to Generate Rule-Based Constraint Solvers. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:127-135 [Conf]
    
15. Andrew D. Gordon
    Types for Cyphers: Thwarting Mischief and Malice with Type Theory. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:136- [Conf]
    
16. Franklyn A. Turbak, J. B. Wells
    Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:137-149 [Conf]
    
17. Jean-Louis Giavitto, Olivier Michel
    Declarative Definition of Group Indexed Data Structures and Approximation of Their Domains. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:150-161 [Conf]
    
18. Olivier Danvy, Lasse R. Nielsen
    Defunctionalization at Work. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:162-174 [Conf]
    
19. Fritz Henglein, Henning Makholm, Henning Niss
    A Direct Approach to Control-Flow Sensitive Region-Based Memory Management. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:175-186 [Conf]
    
20. Ricardo Pena, Fernando Rubio
    Parallel Functional Programming at Two Levels of Abstraction. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:187-198 [Conf]
    
21. Sergio Antoy
    Constructor-Based Conditional Narrowing. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:199-206 [Conf]
    
22. Sergio Antoy, Michael Hanus, Bart Massey, Frank Steiner
    An Implementation of Narrowing Strategies. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:207-217 [Conf]