Programming Logics : Essays in Memory of Harald Ganzinger

This Festschrift volume, published in memory of Harald Ganzinger, contains 17 papers from colleagues all over the world and covers all the fields to which Harald Ganzinger dedicated his work during his academic career. The volume begins with a complete account of Harald Ganzinger's work and the...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autor principal: Voronkov, Andrei
Altres autors: Weidenbach, Christoph (Director editorial)
Format: Livre numérique
Idioma:Anglais
Publicat: Berlin, Heidelberg : Springer Berlin Heidelberg 2013.
Cham : Springer Nature
Col·lecció:Theoretical Computer Science and General Issues 7797
Accés en línia:Accès sur la plateforme de l'éditeur
Accès sur la plateforme de l'éditeur (Springer)
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:• Programming Logics, Texte imprimé, 9783642376504
• Programming Logics, Texte imprimé, 9783642376528
Taula de continguts:
  • Harald Ganzinger s Legacy: Contributions to Logics and Programming
  • Bio-Logics: Logical Analysis of Bioregulatory Networks
  • Canonical Ground Horn Theories
  • Generic Functional Representation of Sorted Trees Supporting Attribution (Haskell Can Do It)
  • The Blossom of Finite Semantic Trees
  • Functional Logic Programming: From Theory to Curry
  • From Search to Computation: Redundancy Criteria and Simplification at Work
  • Elimination Techniques for Program Analysis
  • Narrowing Based Inductive Proof Search
  • Inst-Gen A Modular Approach to Instantiation-Based Automated Reasoning
  • Common Knowledge Logic in a Higher Order Proof Assistant
  • Constructing Bachmair-Ganzinger Models
  • Planning with Effectively Propositional Logic
  • The Relative Power of Semantics and Unification
  • First-Order Resolution Methods for Modal Logics
  • On Combinations of Local Theory Extensions
  • Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs.