| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910481864403321 |
|
|
Autore |
Anon |
|
|
Titolo |
Eenige vermakelyke doch waarachtige historien synde het leeven van verscheide reukeloose pachters, borgers, medestanders, collecteurs en verklikkers ... hier in Neederland voorgevallen .. [[electronic resource]] |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Franeker, : Jan Defensiu, 1697 |
|
|
|
|
|
|
|
Descrizione fisica |
|
Online resource (.. p, 12°) |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Reproduction of original in Koninklijke Bibliotheek, Nationale bibliotheek van Nederland. |
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910143461903321 |
|
|
Titolo |
Rewriting Techniques and Applications : 10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings / / edited by Paliath Narendran, Michael Rusinowitch |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1999.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 408 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 1631 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Compilers (Computer programs) |
Machine theory |
Computer science |
Artificial intelligence |
Computer science - Mathematics |
Compilers and Interpreters |
Formal Languages and Automata Theory |
Computer Science Logic and Foundations of Programming |
Artificial Intelligence |
Symbolic and Algebraic Manipulation |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Session 1 -- Solved Forms for Path Ordering Constraints -- Jeopardy -- Strategic Pattern Matching -- Session 2: -- On the Strong Normalization of Natural Deduction with Permutation-Conversions -- Normalisation in Weakly Orthogonal Rewriting -- Strong Normalization of Proof Nets Modulo Structural Congruences -- Session 3: Invited Talk -- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas -- Session 4: -- Undecidability of the Part of the Theory of Ground Term Algebra Modulo an AC Symbol -- Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting -- A New Result about the Decidability of the Existential One-Step Rewriting Theory -- Session 5: -- A Fully Syntactic AC-RPO -- Theory Path Orderings -- A Characterisation of Multiply Recursive Functions with Higman’s Lemma -- Session 6: -- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors -- Normalization via Rewrite Closures -- Test Sets for the Universal and Existential Closure of Regular Tree Languages -- Session 7: Invited Tutorial -- Higher-Order Rewriting -- Session 8: System Descriptions -- The Maude System -- TOY: A Multiparadigm Declarative System -- UniMoK: A System for Combining Equational Unification Algorithms -- : A Laboratory for Rapid Term Graph Rewriting -- Session 9: -- Decidability for Left-Linear Growing Term Rewriting Systems -- Transforming Context-Sensitive Rewrite Systems -- Context-Sensitive AC-rewriting -- Session 10: -- The Calculus of Algebraic Constructions -- HOL-??: An Intentional First-Order Expression of Higher-Order Logic -- Session 11: Invited Talk -- On the Connections between Rewriting and Formal Language Theory -- Session 12: -- A Rewrite System Associated with Quadratic Pisot Units -- Fast Rewriting of Symmetric Polynomials -- OnImplementation of Tree Synchronized Languages. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
|
|
| |