| 2003 | A demand-driven narrowing calculus with overlapping definitional trees. Rafael del Vado Vírseda |
| 2003 | A framework for typed HOAS and semantics. Marino Miculan, Ivan Scagnetto |
| 2003 | A functional correspondence between evaluators and abstract machines. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard |
| 2003 | Automatic verification of cryptographic protocols: a logic programming approach. Bruno Blanchet |
| 2003 | Compilation of extended recursion in call-by-value functional languages. Tom Hirschowitz, Xavier Leroy, J. B. Wells |
| 2003 | Conditional narrowing without conditions. Sergio Antoy, Bernd Brassel, Michael Hanus |
| 2003 | Efficient fixpoint computation in linear tabling. Neng-Fa Zhou, Taisuke Sato |
| 2003 | Explicit substitutions in the reduction of lambda terms. Gopalan Nadathur, Xiaochu Qi |
| 2003 | Extending arbitrary solvers with constraint handling rules. Gregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, Christian Holzbaur |
| 2003 | Finding all minimal unsatisfiable subsets. Maria J. García de la Banda, Peter J. Stuckey, Jeremy Wazny |
| 2003 | Formally deriving an STG machine. Alberto de la Encina, Ricardo Pena |
| 2003 | Foundational proof checkers with small witnesses. Dinghao Wu, Andrew W. Appel, Aaron Stump |
| 2003 | From datalog rules to efficient programs with time and space guarantees. Yanhong A. Liu, Scott D. Stoller |
| 2003 | From dynamic binding to state via modal possibility. Aleksandar Nanevski |
| 2003 | Generativity and dynamic opacity for abstract types. Andreas Rossberg |
| 2003 | Integrating finite domain constraints and CLP with sets. Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi |
| 2003 | On the rewriting and efficient computation of bound disjunctive datalog queries. Sergio Greco, Ester Zumpano |
| 2003 | On translating geometric solids to functional expressions. Omid Banyasad, Philip T. Cox |
| 2003 | Practical aspects of declarative debugging in Haskell 98. Bernard J. Pope, Lee Naish |
| 2003 | Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 27-29 August 2003, Uppsala, Sweden |
| 2003 | Rank 2 intersection types for modules. Ferruccio Damiani |
| 2003 | Refining weakly outermost-needed rewriting and narrowing. Santiago Escobar |
| 2003 | Simplification and termination of strategies in rule-based languages. Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner |
| 2003 | Statically assuring secrecy for dynamic concurrent processes. Rachid Echahed, Frédéric Prost, Wendelin Serwe |
| 2003 | Term rewriting with variable binding: an initial algebra approach. Makoto Hamana |
| 2003 | Towards a formal notion of trust. Mogens Nielsen, Karl Krukow |
| 2003 | ViMer: a visual debugger for mercury. M. Cameron, Maria J. García de la Banda, Kim Marriott, Peter Moulder |