Peter Schneider-Kamp, Michael Hanus
Proceedings of the 13th International Conference on Principles and Practice of Declarative Programming
PPDP, 2011.

@proceedings{PPDP-2011,
	address       = "Odense, Denmark",
	editor        = "Peter Schneider-Kamp and Michael Hanus",
	isbn          = "978-1-4503-0776-5",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 13th International Conference on Principles and Practice of Declarative Programming}",
	year          = 2011,
}

Contents (18 items)

3 ×#constraints
3 ×#using
2 ×#analysis
2 ×#concurrent
2 ×#declarative
2 ×#higher-order
2 ×#incremental
2 ×#programming
2 ×#recursion
2 ×#semantics

PPDP-2011-Lagoon #challenge #constraints #generative #testing

The challenges of constraint-based test generation (VL), pp. 1–2.

PPDP-2011-Rybalchenko #automation #synthesis #tool support #towards #verification

Towards automatic synthesis of software verification tools (AR), pp. 3–4.

PPDP-2011-SchernhammerM #axiom #incremental #recursion #specification

Incremental checking of well-founded recursive specifications modulo axioms (FS, JM), pp. 5–16.

PPDP-2011-InabaHHKN #higher-order #logic #monad #using #verification

Graph-transformation verification using monadic second-order logic (KI, SH, ZH, HK, KN), pp. 17–28.

PPDP-2011-SauthoffJG #declarative #programming

Bellman’s GAP: a declarative language for dynamic programming (GS, SJ, RG), pp. 29–40.

PPDP-2011-VirsedaM #composition #constraints #declarative #higher-order #programming #semantics

A modular semantics for higher-order declarative programming with constraints (RdVV, FPM), pp. 41–52.

PPDP-2011-ChristiansenS #polymorphism #strict

Minimally strict polymorphic functions (JC, DS), pp. 53–64.

PPDP-2011-EscobarKLMMNS #analysis #encryption #protocol #unification #using

Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (SE, DK, CL, CM, JM, PN, RS), pp. 65–76.

PPDP-2011-BourdierC #analysis #network #policy #security #term rewriting #using

Symbolic analysis of network security policies using rewrite systems (TB, HC), pp. 77–88.

PPDP-2011-ColazzoS #complexity #precise #type inference #xquery

Precision and complexity of XQuery type inference (DC, CS), pp. 89–100.

PPDP-2011-SabelS #concurrent #haskell #semantics

A contextual semantics for concurrent Haskell with futures (DS, MSS), pp. 101–112.

PPDP-2011-BlanchetteWBOS #c++ #concurrent

Nitpicking C++ concurrency (JCB, TW, MB, SO, SS), pp. 113–124.

PPDP-2011-NigamJLS #distributed #incremental #logic programming #maintenance #source code

Maintaining distributed logic programs incrementally (VN, LJ, BTL, AS), pp. 125–136.

PPDP-2011-HaemmerleLH #constraints

CLP projection for constraint handling rules (RH, PLG, MVH), pp. 137–148.

PPDP-2011-BiernackaBL #continuation #type system

Typing control operators in the CPS hierarchy (MB, DB, SL), pp. 149–160.

PPDP-2011-ToninhoCP #linear #type system

Dependent session types via intuitionistic linear type theory (BT, LC, FP), pp. 161–172.

PPDP-2011-AlvesFFM #recursion #λ-calculus

Linearity and recursion in a typed λ-calculus (SA, MF, MF, IM), pp. 173–182.

PPDP-2011-Guenot #proving #reduction #λ-calculus

Nested proof search as reduction in the λ-calculus (NG), pp. 183–194.