


default search action
PPDP 2000: Montreal, Canada
- Maurizio Gabbrielli, Frank Pfenning:

Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, Montreal, Canada, September 20-23, 2000. ACM 2000, ISBN 1-58113-265-4
Invited Speaker
- Prakash Panangaden:

From logic to stochastic processes (abstract only). 1-2
Session I
- Marco Pedicini, Francesco Quaglia:

A parallel implementation for optimal lambda-calculus reduction. 3-14 - John Power

, Edmund Robinson:
Logical relations, data abstraction, and structured fibrations. 15-23 - Simona Ronchi Della Rocca:

Operational semantics and extensionality. 24-31 - Erik Johansson, Mikael Pettersson, Konstantinos Sagonas

:
A high performance Erlang system. 32-43
Invited Speaker
- François Fages:

Concurrent constraint programming and linear logic (abstract). 44
Session II
- Jean-Louis Giavitto

:
A framework for the recursive definition of data structures. 45-55 - Conal Elliott:

Declarative event-oriented programming. 56-67
Session III
- Jeff Polakow:

Linear logic programming with an ordered context. 68-79 - Claudia Faggian:

Proof construction and non-commutativity: a cluster calculus. 80-91 - Marco Bozzano

, Giorgio Delzanno, Maurizio Martelli:
A bottom-up semantics for linear logic programs. 92-102
Session IV
- Roberto Bagnara, Enea Zaffanella, Patricia M. Hill:

Enhanced sharing analysis techniques: a comprehensive evaluation. 103-114 - Roberto Giacobazzi, Isabella Mastroeni:

A characterization of symmetric semantics by domain complementation. 115-126 - Alessandra Di Pierro, Herbert Wiklicky:

Concurrent constraint programming: towards probabilistic abstract interpretation. 127-138 - Bernhard Gramlich:

Simplifying termination proofs for rewrite systems by preprocessing. 139-150
Session V
- Adam Bakewell, Colin Runciman:

A model for comparing the space usage of lazy evaluators. 151-162 - Mauricio Ayala-Rincón

, Fairouz Kamareddine:
Unification via se-style of explicit substitution. 163-174
Invited Speaker
- George C. Necula:

Proof-carrying code: design, implementation and applications (abstract). 175-177
Session VI
- Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan:

Justifying proofs using memo tables. 178-189 - Cristiano Calcagno, Samin S. Ishtiaq, Peter W. O'Hearn:

Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292. 190-201
Session VII
- Michael Hanus

, Frank Steiner:
Type-based nondeterminism checking in functional logic programs. 202-213 - Lunjin Lu:

A precise type analysis of logic programs. 214-225 - Jörg Köller, Markus Mohnen:

Efficient abstract interpretation using component-wise homomorphisms. 226-234
Session VIII
- Nikolay Pelov, Maurice Bruynooghe:

Extending constraint logic programming with open functions. 235-244 - Xining Li:

Efficient memory management in a merged heap/stack prolog machine. 245-256 - Eneia Todoran, Nikolaos Papaspyrou

:
Continuations for parallel logic programming. 257-267
Session IX
- Michael Leuschel, Helko Lehmann:

Solving coverability problems of petri nets by partial deduction. 268-279 - Martin Hyland, John Power

:
Symmetric monoidal sketches. 280-288 - Grégoire Hamon, Marc Pouzet:

Modular resetting of synchronous data-flow programs. 289-300

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














