Conferences in DBLP

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

1. Prakash Panangaden
   From logic to stochastic processes (abstract only). [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:1-2 [Conf]
   
2. Marco Pedicini, Francesco Quaglia
   A parallel implementation for optimal lambda-calculus reduction. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:3-14 [Conf]
   
3. John Power, Edmund Robinson
   Logical relations, data abstraction, and structured fibrations. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:15-23 [Conf]
   
4. Simona Ronchi Della Rocca
   Operational semantics and extensionality. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:24-31 [Conf]
   
5. Erik Johansson, Mikael Pettersson, Konstantinos F. Sagonas
   A high performance Erlang system. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:32-43 [Conf]
   
6. François Fages
   Concurrent constraint programming and linear logic (abstract). [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:44- [Conf]
   
7. Jean-Louis Giavitto
   A framework for the recursive definition of data structures. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:45-55 [Conf]
   
8. Conal Elliott
   Declarative event-oriented programming. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:56-67 [Conf]
   
9. Jeff Polakow
   Linear logic programming with an ordered context. [Citation Graph (0, 0)][DBLP]
   PPDP, 2000, pp:68-79 [Conf]
   
10. Claudia Faggian
    Proof construction and non-commutativity: a cluster calculus. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:80-91 [Conf]
    
11. Marco Bozzano, Giorgio Delzanno, Maurizio Martelli
    A bottom-up semantics for linear logic programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:92-102 [Conf]
    
12. Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
    Enhanced sharing analysis techniques: a comprehensive evaluation. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:103-114 [Conf]
    
13. Roberto Giacobazzi, Isabella Mastroeni
    A characterization of symmetric semantics by domain complementation. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:115-126 [Conf]
    
14. Alessandra Di Pierro, Herbert Wiklicky
    Concurrent constraint programming: towards probabilistic abstract interpretation. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:127-138 [Conf]
    
15. Bernhard Gramlich
    Simplifying termination proofs for rewrite systems by preprocessing. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:139-150 [Conf]
    
16. Adam Bakewell, Colin Runciman
    A model for comparing the space usage of lazy evaluators. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:151-162 [Conf]
    
17. Mauricio Ayala-Rincón, Fairouz Kamareddine
    Unification via s_e-style of explicit substitution. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:163-174 [Conf]
    
18. George C. Necula
    Proof-carrying code: design, implementation and applications (abstract). [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:175-177 [Conf]
    
19. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan
    Justifying proofs using memo tables. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:178-189 [Conf]
    
20. Cristiano Calcagno, Samin S. Ishtiaq, Peter W. O'Hearn
    Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:190-201 [Conf]
    
21. Michael Hanus, Frank Steiner
    Type-based nondeterminism checking in functional logic programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:202-213 [Conf]
    
22. Lunjin Lu
    A precise type analysis of logic programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:214-225 [Conf]
    
23. Jörg Köller, Markus Mohnen
    Efficient abstract interpretation using component-wise homomorphisms. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:226-234 [Conf]
    
24. Nikolay Pelov, Maurice Bruynooghe
    Extending constraint logic programming with open functions. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:235-244 [Conf]
    
25. Xining Li
    Efficient memory management in a merged heap/stack prolog machine. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:245-256 [Conf]
    
26. Eneia Todoran, Nikolaos Papaspyrou
    Continuations for parallel logic programming. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:257-267 [Conf]
    
27. Michael Leuschel, Helko Lehmann
    Solving coverability problems of petri nets by partial deduction. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:268-279 [Conf]
    
28. Martin Hyland, John Power
    Symmetric monoidal sketches. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:280-288 [Conf]
    
29. Grégoire Hamon, Marc Pouzet
    Modular resetting of synchronous data-flow programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:289-300 [Conf]