rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Logic Program Synthesis and Transformation
    sub title: 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings
  name:
    name part: Gallagher, John.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 1997
    edition: 1st ed. 1997.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: IX, 331 p. online resource.
  abstract: 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 total of initially 27 submissions. The topics covered range over the areas of synthesis of programs from specifications, verification, transformation, specialization, and analysis of programs, and the use of program schemata in program development.
  table of contents: 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( $$\mathcal{R}$$ ) -- Typed norms for typed logic programs -- Partial deduction in the framework of structural synthesis of programs -- Extensible logic program schemata -- Specialising meta-level compositions of logic programs -- Forms of logic specifications: A preliminary study -- Synthesis of proof procedures for default reasoning.
  note: edited by John Gallagher.
  subject:
    topic: Computers
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer programming
  subject:
    topic: Artificial intelligence
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer logic
  subject:
    topic: Theory of Computation
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Programming Techniques
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Logics and Meanings of Programs
  classification: QA75.5-76.95
  classification: QA76.63
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 1207
  identifier: 9783540684947
  identifier: https://doi.org/10.1007/3-540-62718-9
  record info:
    record creation date: 121227
    record change date: 20191028081205.0
    record identifier: 978-3-540-68494-7