


default search action
PPDP 2008: Valencia, Spain
- Sergio Antoy, Elvira Albert:
Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 15-17, 2008, Valencia, Spain. ACM 2008, ISBN 978-1-60558-117-0 - Michael Leuschel:
Declarative programming for verification: lessons and outlook. 1-7
Concurrency & parallelism
- Carlos Olarte
, Frank D. Valencia:
The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security. 8-19 - Martin Sulzmann, Edmund S. L. Lam:
Parallel execution of multi-set constraint rewrite rules. 20-31
Theory & semantics
- José F. Morales, Manuel Carro
, Manuel V. Hermenegildo:
Comparing tag scheme variations using an abstract machine generator. 32-43 - Paulo F. Silva
, José Nuno Oliveira
:
'Galculator': functional prototype of a Galois-connection based proof assistant. 44-55 - Rinus Plasmeijer, Jan Martin Jansen, Pieter W. M. Koopman, Peter Achten:
Declarative Ajax and client side evaluation of workflows using iTasks. 56-66
Theory & semantics
- Michael Hanus
:
Call pattern analysis for functional logic programs. 67-78 - Jean-Yves Marion, Romain Péchoux
:
Characterizations of polynomial complexity classes with a better intensionality. 79-88 - Yves Bertot, Vladimir Komendantsky:
Fixed point semantics and partial recursion in Coq. 89-96 - Luca Paolini
, Mauro Piccolo:
Semantically linear programming languages. 97-107 - Salvador Lucas
, José Meseguer:
Order-sorted dependency pairs. 108-119
Language issues
- Peter Thiemann, Matthias Neubauer:
Macros for context-free grammars. 120-130 - Véronique Benzaken
, Giuseppe Castagna, Dario Colazzo, Cédric Miachon:
Pattern by example: type-driven visual programming of XML queries. 131-142 - Lunjin Lu:
Inferring precise polymorphic type dependencies in logic programs. 143-151 - Manuel Montenegro, Ricardo Pena, Clara Segura
:
A type system for safe memory management and its proof of correctness. 152-162 - Brigitte Pientka, Jana Dunfield:
Programming with proofs and explicit contexts. 163-173
Reasoning
- Edison Mera, Pedro López-García, Manuel Carro
, Manuel V. Hermenegildo:
Towards execution time estimation in abstract machine-based languages. 174-184 - Rafael Caballero
, Mario Rodríguez-Artalejo, Carlos A. Romero-Díaz:
Similarity-based reasoning in qualified logic programming. 185-194
Debugging and checking
- Hendrik Decker, Davide Martinenghi
:
Classifying integrity checking methods with regard to inconsistency tolerance. 195-204 - Olaf Chitil, Thomas Davie:
Comprehending finite maps for algorithmic debugging of higher-order functional programs. 205-216 - Clara Bertolissi, Maribel Fernández:
A rewriting framework for the composition of access control policies. 217-225
Constraints
- Thibaut Feydy, Andreas Schutt
, Peter J. Stuckey:
Global difference constraint propagation for finite domain solvers. 226-235 - Raphaël Chenouard
, Laurent Granvilliers, Ricardo Soto
:
Model-driven constraint programming. 236-246 - Christian Schulte, Peter J. Stuckey:
Dynamic variable elimination during propagation solving. 247-257 - Sonia Estévez Martín
, Antonio J. Fernández
, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo, Fernando Sáenz-Pérez
, Rafael del Vado Vírseda:
Cooperation of constraint domains in the TOY system. 258-268

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.