Principles of Declarative Programming

Logic programming and model checking.- CAT: The Copying Approach to Tabling.- SICStus MT—A multithreaded execution environment for SICStus Prolog.- A framework for bottom up specialisation of logic programs.- Termination of logic programs with block declarations running in several modes.- The Boolean logic of set sharing analysis.- Derivation of proof methods by abstract interpretation.- Detecting unsolvable queries for definite logic programs.- Staging static analyses using abstraction-based program specialization.- An experiment in domain refinement: Type domains and type representations for logic programs.- Architecture software using: A methodology for language development.- Explicit substitutions for objects and functions.- The complexity of late-binding in dynamic object-oriented languages.- A compiler for rewrite programs in associative-commutative theories.- Solution to the problem of Zantema on a persistent property of term rewriting systems.- A general framework for R-unification problems.- Operational versus denotational methods in the semantics of higher order languages.- Functional implementations of continuous modeled animation.- Compiling Erlang to Scheme.- From (sequential) Haskell to (parallel) Eden: An implementation point of view.- Mobile Haskell: Compiling lazy functional programs for the Java Virtual Machine.- Program analysis in ?prolog.- A game semantics foundation for logic programming.- Controlling search in declarative programs.- Encapsulating data in logic programming via categorical constraints.- Constructive negation using typed existence properties.- Optimal reduction of functional expressions.- Embedding multiset constraints into a lazy functional logic language.- A hidden Herbrand Theorem.- Integrating constraint propagation in complete solving of linear diophantine systems.- Approaches to the incremental detection of implicit equalities with the revised simplex method.