Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008172245/catalog> ?p ?o. }

• catalog abstract "This volume contains the proceedings of the 10th International Conference on RewritingTechniques andApplicationsheldfromJuly2-4,1999inTrento, Italy, as part of the Federated Logic Conference (FLoC’99). The RTAconferences are dedicated to all aspects of term, string and graph rewriting as well as their applications such as lambda calculi, theorem-proving, functional programming, decision procedures. The program committee selected 23 papers as well as 4 system descriptions from 53 submissions of overall high quality (46 regular papers and 7 systems descriptions). The papers cover awide range of topics: constraint solving, ter- nation,deductionandhigher-orderrewriting,graphs,complexity,tree automata, context-sensitive rewriting, string rewriting and numeration systems::: by - thors from countries including: France, Germany, India,Israel, Italy,Japan, The Netherlands, Poland, Portugal, Spain, USA. B. Courcelle (Univ. Bordeaux) and F. Otto (Univ. Kassel) presented - vited talks, on graph grammars and connections between rewriting and formal language theory respectively. F. van Raamsdonk (CWI, Amsterdam) gave an invited tutorial on higher-order rewriting. Wewouldliketothanktheexternalreviewersfortheircontributiontoprep- ing the program and Horatiu Cirstea for his help in maintaining the web server of the program committee.".
• catalog alternative "RTA-99".
• catalog contributor b11365526.
• catalog contributor b11365527.
• catalog contributor b11365528.
• catalog created "1999.".
• catalog date "1999".
• catalog date "1999.".
• catalog dateCopyrighted "1999.".
• catalog description "A characterisation of multiply recursive functions with Higman's Lemma / Hélène Touzet -- Deciding the word problem in the union of equational theories sharing constructors / Franz Baader and Cesare Tinelli -- Normalization via rewrite closures / L. Bachmair [and others] -- Test sets for the universal and existential closure of regular tree languages / Dieter Hofbauer and Maria Huber -- Higher-order rewriting / Femke van Raamsdonk -- The Maude system / M. Clavel [and others] -- A multiparadigm declarative system / F.J. Lopez Fraguas and J. Sanchez Hernandez -- UniMoK: a system for combining equational unification algorithms / S. Kepser and J. Richts -- A laboratory for rapid term graph rewriting / Rakesh Verma and Shalitha Senanayake -- Decidability for left-linear growing term rewriting systems / Takashi Nagaya and Yoshihito Toyama -- Transforming context-sensitive rewrite systems / Jurgen Giesl and Aart Middeldorp -- ".
• catalog description "Context-sensitive AC-rewriting / M.C.F. Ferreira and A.L. Ribeiro -- The calculus of algebraic constructions / Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada -- HOL-: an intentional first-order expression of higher-order logic / Gilles Dowek, Therese Hardin, and Claude Kirchner -- On the connections between rewriting and formal language theory / Friedrich Otto -- A rewrite system associated with quadratic pisot units / Christiane Frougny and Jacques Sakarovitch -- Fast rewriting of symmetric polynomials / Manfred Gobel -- On implementation of tree synchronized languages / Frédéric Saubion and Igor Stéphan.".
• catalog description "Includes bibliographical references and index.".
• catalog description "Solved forms for path ordering constraints / Robert Nieuwenhuis and José Miguel Rivero -- Jeopardy / Nachum Dershowitz and Subrata Mitra -- Strategic pattern matching / Eelco Visser -- On the strong normalization of natural deduction with permutation-conversions / Philippe de Groote -- Normalization in weakly orthogonal rewriting / Vincent van Oostrom -- Strong normalization of proof nets modulo structural congruences / Roberto Di Cosmo and Stefano Guerrini -- Hierarchical graph decompositions defined by grammars and logical formulas / Bruno Courcelle -- Undecidability of the part of the theory of ground term algebra modulo an AC symbol / Jerzy Marcinkowski ... Deciding the satisfiability of quantifier free formulae on one-step rewriting / Anne-Cécile Caron [and others] -- A new result about the decidability of the existential one-step rewriting theory / Sébastien Limet and Pierre Réty -- A fully syntactic AC-RPO / Albert Rubio -- Theory path orderings / Jürgen Stuber -- ".
• catalog description "This volume contains the proceedings of the 10th International Conference on RewritingTechniques andApplicationsheldfromJuly2-4,1999inTrento, Italy, as part of the Federated Logic Conference (FLoC’99). The RTAconferences are dedicated to all aspects of term, string and graph rewriting as well as their applications such as lambda calculi, theorem-proving, functional programming, decision procedures. The program committee selected 23 papers as well as 4 system descriptions from 53 submissions of overall high quality (46 regular papers and 7 systems descriptions). The papers cover awide range of topics: constraint solving, ter- nation,deductionandhigher-orderrewriting,graphs,complexity,tree automata, context-sensitive rewriting, string rewriting and numeration systems::: by - thors from countries including: France, Germany, India,Israel, Italy,Japan, The Netherlands, Poland, Portugal, Spain, USA. B. Courcelle (Univ. Bordeaux) and F. Otto (Univ. Kassel) presented - vited talks, on graph grammars and connections between rewriting and formal language theory respectively. F. van Raamsdonk (CWI, Amsterdam) gave an invited tutorial on higher-order rewriting. Wewouldliketothanktheexternalreviewersfortheircontributiontoprep- ing the program and Horatiu Cirstea for his help in maintaining the web server of the program committee.".
• catalog extent "xi, 396 p. :".
• catalog identifier "3540662014 (softcover : alk. paper)".
• catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 1631".
• catalog issued "1999".
• catalog issued "1999.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "005.13/1 21".
• catalog subject "Algebra Data processing.".
• catalog subject "Algorithms Congresses.".
• catalog subject "Artificial intelligence.".
• catalog subject "Computer programming Congresses.".
• catalog subject "Computer science.".
• catalog subject "Logic design.".
• catalog subject "QA267 .R477 1999".
• catalog subject "Rewriting systems (Computer science) Congresses.".
• catalog tableOfContents "A characterisation of multiply recursive functions with Higman's Lemma / Hélène Touzet -- Deciding the word problem in the union of equational theories sharing constructors / Franz Baader and Cesare Tinelli -- Normalization via rewrite closures / L. Bachmair [and others] -- Test sets for the universal and existential closure of regular tree languages / Dieter Hofbauer and Maria Huber -- Higher-order rewriting / Femke van Raamsdonk -- The Maude system / M. Clavel [and others] -- A multiparadigm declarative system / F.J. Lopez Fraguas and J. Sanchez Hernandez -- UniMoK: a system for combining equational unification algorithms / S. Kepser and J. Richts -- A laboratory for rapid term graph rewriting / Rakesh Verma and Shalitha Senanayake -- Decidability for left-linear growing term rewriting systems / Takashi Nagaya and Yoshihito Toyama -- Transforming context-sensitive rewrite systems / Jurgen Giesl and Aart Middeldorp -- ".
• catalog tableOfContents "Context-sensitive AC-rewriting / M.C.F. Ferreira and A.L. Ribeiro -- The calculus of algebraic constructions / Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada -- HOL-: an intentional first-order expression of higher-order logic / Gilles Dowek, Therese Hardin, and Claude Kirchner -- On the connections between rewriting and formal language theory / Friedrich Otto -- A rewrite system associated with quadratic pisot units / Christiane Frougny and Jacques Sakarovitch -- Fast rewriting of symmetric polynomials / Manfred Gobel -- On implementation of tree synchronized languages / Frédéric Saubion and Igor Stéphan.".
• catalog tableOfContents "Solved forms for path ordering constraints / Robert Nieuwenhuis and José Miguel Rivero -- Jeopardy / Nachum Dershowitz and Subrata Mitra -- Strategic pattern matching / Eelco Visser -- On the strong normalization of natural deduction with permutation-conversions / Philippe de Groote -- Normalization in weakly orthogonal rewriting / Vincent van Oostrom -- Strong normalization of proof nets modulo structural congruences / Roberto Di Cosmo and Stefano Guerrini -- Hierarchical graph decompositions defined by grammars and logical formulas / Bruno Courcelle -- Undecidability of the part of the theory of ground term algebra modulo an AC symbol / Jerzy Marcinkowski ... Deciding the satisfiability of quantifier free formulae on one-step rewriting / Anne-Cécile Caron [and others] -- A new result about the decidability of the existential one-step rewriting theory / Sébastien Limet and Pierre Réty -- A fully syntactic AC-RPO / Albert Rubio -- Theory path orderings / Jürgen Stuber -- ".
• catalog title "RTA-99".
• catalog title "Rewriting techniques and applications : 10th international conference, RTA-99, Trento, Italy, July 2-4, 1999, proceedings / Paliath Narendran, Michael Rusinowitch (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "text".