Logic program synthesis and transformation : 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28 30, 1996 : proceedings

This book constitutes the strictly refereed post-workshop proceedings of the Sixth International Workshop on Logic Program Synthesis and Transformation, LOPSTR'96, held on board a ship sailing from Stockholm to Helsinki, in August 1996. The 17 revised full papers were carefully selected from a...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Autor Corporativo: International Workshop on Logic program synthesis and transformation :Stockholm
Outros Autores: Gallagher, John P., 19..-...., informaticien (Directeur de la publication)
Formato: Livre numérique
Idioma:Anglais
Publicado em: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Colecção:Lecture notes in computer science 1207
Assuntos:
Acesso em linha:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Logic program synthesis and transformation, 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, proceedings, John Gallagher, editor, 1997, New York, Springer, 1 vol. (VI-324 p.), Lecture notes in computer science, 3-540-62718-9
• Logic Program Synthesis and Transformation, Texte imprimé, 9783662200315
Sumário:
  • Refining specifications to logic programs
  • Symbolic verification with gap-order constraints
  • Specification-based automatic verification of Prolog programs
  • Logic program specialisation: How to be more specific
  • Conjunctive partial deduction in practice
  • Redundant argument filtering of logic programs
  • Replacement can preserve termination
  • A transformation tool for pure Prolog programs
  • Enhancing partial deduction via unfold/fold rules
  • Abstract specialization and its application to program parallelization
  • Reductions of petri nets and unfolding of propositional logic programs
  • Inferring argument size relationships with CLP(