Proceedings of the Third International Conference on Principles and Practice of Declarative Programming
PPDP, 2001.

@proceedings{PPDP-2001,
	address       = "Florence, Italy",
	isbn          = "1-58113-388-X",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Third International Conference on Principles and Practice of Declarative Programming}",
	year          = 2001,
}

Contents (22 items)

3 ×#declarative
3 ×#logic programming
3 ×#programming
3 ×#source code
2 ×#constraints
2 ×#question
2 ×#termination

PPDP-2001-Schmidt #declarative #programming #question #uml

Should UML Be Used for Declarative Programming? (DAS), pp. 1–3.

PPDP-2001-Naumann #imperative #modelling #programming #relational

Ideal Models for Pointwise Relational and State-Free Imperative Programming (DAN), pp. 4–15.

PPDP-2001-KamareddineBN #equivalence #syntax

De Bruijn’s Syntax and Reductional Equivalence of λ-Terms (FK, RB, RN), pp. 16–27.

PPDP-2001-BoerGM #semantics

A Denotational Semantics for Timed Linda (FSdB, MG, MCM), pp. 28–36.

PPDP-2001-Esparza #declarative #model checking #source code

Model Checking (with) Declarative Programs (JE), p. 37.

PPDP-2001-HernandezR #algorithm #development #logic programming #reuse #string

Development Reuse and the Logic Program Derivation of Two String-Matching Algorithms (MH, DAR), pp. 38–48.

PPDP-2001-NassenCS #prolog #virtual machine

Instruction Merging and Specialization in the SICStus Prolog Virtual Machine (HN, MC, KFS), pp. 49–60.

PPDP-2001-RychlikowskiT #logic programming #polymorphism

Polymorphic Directional Types for Logic Programming (PR, TT), pp. 61–72.

PPDP-2001-BossiCR #logic programming #source code #termination

Termination of Well-Typed Logic Programs (AB, NC, SR), pp. 73–81.

PPDP-2001-Lucas #on-demand #source code #termination

Termination of On-Demand Rewriting and Termination of OBJ Programs (SL), pp. 82–93.

PPDP-2001-ChangJ #analysis #constraints #java

Granularity of Constraint-Based Analysis for Java (BMC, JWJ), pp. 94–102.

PPDP-2001-HepburnW #trust #π-calculus

Trust in the π-Calculus (MH, DW), pp. 103–114.

PPDP-2001-SchulteS #bound #question

When Do Bounds and Domain Propagation Lead to the Same Search Space? (CS, PJS), pp. 115–126.

PPDP-2001-AbdennadherR #confluence #constraints #rule-based #theorem proving #using

Using Confluence to Generate Rule-Based Constraint Solvers (SA, CR), pp. 127–135.

PPDP-2001-Gordon #type system

Types for Cyphers: Thwarting Mischief and Malice with Type Theory (ADG), p. 136.

PPDP-2001-TurbakW

Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees (FAT, JBW), pp. 137–149.

PPDP-2001-GiavittoM #approximate #data type #declarative

Declarative Definition of Group Indexed Data Structures and Approximation of Their Domains (JLG, OM), pp. 150–161.

PPDP-2001-DanvyN

Defunctionalization at Work (OD, LRN), pp. 162–174.

PPDP-2001-HengleinMN #approach #control flow #memory management

A Direct Approach to Control-Flow Sensitive Region-Based Memory Management (FH, HM, HN), pp. 175–186.

PPDP-2001-PenaR #abstraction #functional #parallel #programming

Parallel Functional Programming at Two Levels of Abstraction (RP, FR), pp. 187–198.

PPDP-2001-Antoy

Constructor-Based Conditional Narrowing (SA), pp. 199–206.

PPDP-2001-AntoyHMS #implementation

An Implementation of Narrowing Strategies (SA, MH, BM, FS), pp. 207–217.