*Proceedings of the Fifth International Conference on Principles and Practice of Declarative Programming*

PPDP, 2003.

@proceedings{PPDP-2003, address = "Uppsala, Sweden", isbn = "1-58113-705-2", publisher = "{ACM}", title = "{Proceedings of the Fifth International Conference on Principles and Practice of Declarative Programming}", year = 2003, }

### Contents (26 items)

- PPDP-2003-Blanchet #approach #automation #encryption #logic programming #protocol #verification
- Automatic verification of cryptographic protocols: a logic programming approach (BB), pp. 1–3.
- PPDP-2003-NielsenK #towards #trust
- Towards a formal notion of trust (MN, KK), pp. 4–7.
- PPDP-2003-AgerBDM #automaton #functional
- A functional correspondence between evaluators and abstract machines (MSA, DB, OD, JM), pp. 8–19.
- PPDP-2003-AntoyBH
- Conditional narrowing without conditions (SA, BB, MH), pp. 20–31.
- PPDP-2003-BandaSW #satisfiability #set
- Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.
- PPDP-2003-BanyasadC #functional #geometry #on the
- On translating geometric solids to functional expressions (OB, PTC), pp. 44–55.
- PPDP-2003-CameronBMM #debugging #named #visual notation
- ViMer: a visual debugger for mercury (MC, MJGdlB, KM, PM), pp. 56–66.
- PPDP-2003-Damiani #rank
- Rank 2 intersection types for modules (FD), pp. 67–78.
- PPDP-2003-DuckSBH #constraints
- Extending arbitrary solvers with constraint handling rules (GJD, PJS, MJGdlB, CH), pp. 79–90.
- PPDP-2003-EchahedPS #concurrent #process
- Statically assuring secrecy for dynamic concurrent processes (RE, FP, WS), pp. 91–101.
- PPDP-2003-EncinaP
- Formally deriving an STG machine (AdlE, RP), pp. 102–112.
- PPDP-2003-Escobar
- Refining weakly outermost-needed rewriting and narrowing (SE), pp. 113–123.
- PPDP-2003-FissoreGK #rule-based #termination
- Simplification and termination of strategies in rule-based languages (OF, IG, HK), pp. 124–135.
- PPDP-2003-GrecoZ #bound #datalog #on the #performance #query
- On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.
- PPDP-2003-Hamana #algebra #approach #term rewriting
- Term rewriting with variable binding: an initial algebra approach (MH), pp. 148–159.
- PPDP-2003-HirschowitzLW #call-by #compilation #functional #recursion
- Compilation of extended recursion in call-by-value functional languages (TH, XL, JBW), pp. 160–171.
- PPDP-2003-LiuS #datalog #performance #source code
- From datalog rules to efficient programs with time and space guarantees (YAL, SDS), pp. 172–183.
- PPDP-2003-MiculanS #framework #semantics
- A framework for typed HOAS and semantics (MM, IS), pp. 184–194.
- PPDP-2003-NadathurQ #reduction
- Explicit substitutions in the reduction of λ terms (GN, XQ), pp. 195–206.
- PPDP-2003-Nanevski
- From dynamic binding to state via modal possibility (AN), pp. 207–218.
- PPDP-2003-PaluDPR #constraints #finite #set
- Integrating finite domain constraints and CLP with sets (ADP, AD, EP, GR), pp. 219–229.
- PPDP-2003-PopeN #aspect-oriented #debugging #declarative #haskell
- Practical aspects of declarative debugging in Haskell 98 (BP, LN), pp. 230–240.
- PPDP-2003-Rossberg #data type
- Generativity and dynamic opacity for abstract types (AR), pp. 241–252.
- PPDP-2003-Virseda #calculus
- A demand-driven narrowing calculus with overlapping definitional trees (RdVV), pp. 253–263.
- PPDP-2003-WuAS #proving
- Foundational proof checkers with small witnesses (DW, AWA, AS), pp. 264–274.
- PPDP-2003-ZhouS #fixpoint #linear #performance
- Efficient fixpoint computation in linear tabling (NFZ, TS), pp. 275–283.