Sergio Antoy, Elvira Albert
Proceedings of the 10th International Conference on Principles and Practice of Declarative Programming
PPDP, 2008.

@proceedings{PPDP-2008,
	address       = "Valencia, Spain",
	editor        = "Sergio Antoy and Elvira Albert",
	isbn          = "978-1-60558-117-0",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 10th International Conference on Principles and Practice of Declarative Programming}",
	year          = 2008,
}

Contents (25 items)

4 ×#constraints
4 ×#programming
3 ×#functional
3 ×#logic programming
3 ×#proving
3 ×#source code
2 ×#automaton
2 ×#declarative
2 ×#dependence
2 ×#execution

PPDP-2008-Leuschel #declarative #programming #verification

Declarative programming for verification: lessons and outlook (ML), pp. 1–7.

PPDP-2008-OlarteV #monad #security

The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security (CO, FDV), pp. 8–19.

PPDP-2008-SulzmannL #constraints #execution #parallel

Parallel execution of multi-set constraint rewrite rules (MS, ESLL), pp. 20–31.

PPDP-2008-MoralesCH #automaton #generative #using

Comparing tag scheme variations using an abstract machine generator (JFM, MC, MVH), pp. 32–43.

PPDP-2008-SilvaO #functional #prototype #proving #quote

“Galculator”: functional prototype of a Galois-connection based proof assistant (PFS, JNO), pp. 44–55.

PPDP-2008-PlasmeijerJKA #ajax #declarative #evaluation #using #workflow

Declarative Ajax and client side evaluation of workflows using iTasks (RP, JMJ, PWMK, PA), pp. 56–66.

PPDP-2008-Hanus #analysis #functional #logic programming #source code

Call pattern analysis for functional logic programs (MH), pp. 67–78.

PPDP-2008-MarionP #complexity #polynomial

Characterizations of polynomial complexity classes with a better intensionality (JYM, RP), pp. 79–88.

PPDP-2008-BertotK #coq #fixpoint #recursion #semantics

Fixed point semantics and partial recursion in Coq (YB, VK), pp. 89–96.

PPDP-2008-PaoliniP #linear #programming language #semantics

Semantically linear programming languages (LP, MP), pp. 97–107.

PPDP-2008-LucasM #dependence #order

Order-sorted dependency pairs (SL, JM), pp. 108–119.

PPDP-2008-ThiemannN #context-free grammar #metaprogramming

Macros for context-free grammars (PT, MN), pp. 120–130.

PPDP-2008-BenzakenCCM #programming #query #visual notation #xml

Pattern by example: type-driven visual programming of XML queries (VB, GC, DC, CM), pp. 131–142.

PPDP-2008-Lu #dependence #logic programming #polymorphism #precise #source code

Inferring precise polymorphic type dependencies in logic programs (LL), pp. 143–151.

PPDP-2008-MontenegroPS #correctness #memory management #proving #type system

A type system for safe memory management and its proof of correctness (MM, RP, CS), pp. 152–162.

PPDP-2008-PientkaD #programming #proving

Programming with proofs and explicit contexts (BP, JD), pp. 163–173.

PPDP-2008-MeraLCH #automaton #estimation #execution #towards

Towards execution time estimation in abstract machine-based languages (EM, PLG, MC, MVH), pp. 174–184.

PPDP-2008-CaballeroRR #logic programming #reasoning #similarity

Similarity-based reasoning in qualified logic programming (RC, MRA, CARD), pp. 185–194.

PPDP-2008-DeckerM #consistency #nondeterminism

Classifying integrity checking methods with regard to inconsistency tolerance (HD, DM), pp. 195–204.

PPDP-2008-ChitilD #algorithm #debugging #finite #functional #higher-order #source code

Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.

PPDP-2008-BertolissiF #composition #data access #framework #policy

A rewriting framework for the composition of access control policies (CB, MF), pp. 217–225.

PPDP-2008-FeydySS #constraints #difference #finite

Global difference constraint propagation for finite domain solvers (TF, AS, PJS), pp. 226–235.

PPDP-2008-ChenouardGS #constraints #modelling #programming

Model-driven constraint programming (RC, LG, RS), pp. 236–246.

PPDP-2008-SchulteS

Dynamic variable elimination during propagation solving (CS, PJS), pp. 247–257.

PPDP-2008-MartinFHRSV #constraints

Cooperation of constraint domains in the TOY system (SEM, AJF, MTHG, MRA, FSP, RdVV), pp. 258–268.