Principles and practice of declarative programming. International conference PPDP '99. Paris, France, September 29--October 1, 1999. Proceedings (Q1819259)

The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{Kamareddine, Fairouz; Monin, François}, On formalised proofs of termination of recursive functions, 29-46 [Zbl 0956.68135] \textit{Kusakari, Keiichirou; Nakamura, Masaki; Toyama, Yoshihito}, Argument filtering transformation, 47-61 [Zbl 0953.68068] \textit{Arenas-Sánchez, Puri; López-Fraguas, F. J.; Rodríguez-Artalejo, M.}, Functional plus logic programming with built-in and symbolic constraints, 152-169 [Zbl 0953.68033] \textit{Fernández, Maribel; Mackie, Ian}, A calculus for interaction nets, 170-187 [Zbl 0953.68069] \textit{Gori, Roberta; Levi, Giorgio}, On the verification of finite failure, 311-327 [Zbl 0953.68083] \textit{Verbaeten, Sofie; Sagonas, Konstantinos; De Schreye, Danny}, Modular termination proofs for prolog with tabling, 342-359 [Zbl 0956.68022] \textit{Filinski, Andrzej}, A semantic account of type-directed partial evaluation, 378-395 [Zbl 0953.68034] \textit{Roychoudhury, Abhik; Narayan Kumar, K.; Ramakrishnan, C. R.; Ramakrishnan, I. V.}, A parameterized unfold/fold transformation framework for definite logic programs, 396-413 [Zbl 0953.68031] \textit{Zaffanella, Enea; Bagnara, Roberto; Hill, Patricia M.}, Widening sharing, 414-431 [Zbl 0956.68023]