Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming
PPDP, 2002.

@proceedings{PPDP-2002,
	address       = "Pittsburgh, Pennsylvania, USA",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming}",
	year          = 2002,
}

Contents (21 items)

5 ×#analysis
3 ×#calculus
3 ×#termination
2 ×#constraints
2 ×#generative
2 ×#integration
2 ×#java
2 ×#logic programming
2 ×#programming
2 ×#stack

PPDP-2002-JonesG #analysis #generative #termination

Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis (NDJ, AJG), p. 1.

PPDP-2002-OstrovskyPT #calculus #higher-order #towards

Towards a primitive higher order calculus of broadcasting systems (KO, KVSP, WT), pp. 2–13.

PPDP-2002-Shafarenko #morphism #type inference #type system

Coercion as homomorphism: type inference in a system with subtyping and overloading (AVS), pp. 14–25.

PPDP-2002-Fiore #analysis #evaluation #normalisation #semantics #λ-calculus

Semantic analysis of normalisation by evaluation for typed λ calculus (MPF), pp. 26–37.

PPDP-2002-BozzanoD #automation #linear #logic #protocol #verification

Automated protocol verification in linear logic (MB, GD), pp. 38–49.

PPDP-2002-GramlichL #composition #termination

Modular termination of context-sensitive rewriting (BG, SL), pp. 50–61.

PPDP-2002-FissoreGK #induction #proving #termination

System Presentation — CARIBOO: An induction based proof tool for termination with strategies (OF, IG, HK), pp. 62–73.

PPDP-2002-Palamidessi #calculus #distributed #mobile #programming

Mobile calculi for distributed programming (CP), pp. 74–75.

PPDP-2002-BessonLJ #stack

Secure calling contexts for stack inspection (FB, TdGdL, TPJ), pp. 76–87.

PPDP-2002-SchrijversD #analysis

Combining an improvement to PARMA trailing with trailing analysis (TS, BD), pp. 88–98.

PPDP-2002-LagoonS #analysis #logic programming #precise #source code

Precise pair-sharing analysis of logic programs (VL, PJS), pp. 99–108.

PPDP-2002-OvertonSS #analysis #constraints

Constraint-based mode analysis of mercury (DO, ZS, PJS), pp. 109–120.

PPDP-2002-SomogyiS #stack #using

Using the heap to eliminate stack accesses (ZS, PJS), pp. 121–132.

PPDP-2002-DrapeMS #dot-net #logic programming #using

Transforming the .NET intermediate language using path logic programming (SD, OdM, GS), pp. 133–144.

PPDP-2002-BlancE

A generic operator over discrete time intervals (JB, RE), pp. 145–155.

PPDP-2002-NielsenPV #concurrent #constraints #on the #power of #programming language

On the expressive power of temporal concurrent constraint programming languages (MN, CP, FDV), pp. 156–167.

PPDP-2002-PembeciNH #domain-specific language #functional #integration

Functional reactive robotics: an exercise in principled integration of domain-specific languages (IP, HN, GDH), pp. 168–179.

PPDP-2002-SztipanovitsK #embedded #generative #programming

Generative programming for embedded systems (JS, GK), p. 180.

PPDP-2002-Chen #integration #type system

Full integration of subtyping and if-expression (GC), pp. 181–188.

PPDP-2002-AnconaLZ #compilation #java

True separate compilation of Java classes (DA, GL, EZ), pp. 189–200.

PPDP-2002-HiguchiO #bytecode #calculus #java

Java bytecode as a typed term calculus (TH, AO), pp. 201–211.