Trees in algebra and programming, CAAP'94 : 19th International Colloquium, Edinburgh, U.K., April 1994 : proceedings /
Saved in:
| Meeting name: | International Colloquium on Trees in Algebra and Programming (19th : 1994 : Edinburgh, Scotland) |
|---|---|
| Imprint: | Berlin ; New York : Springer-Verlag, 1994. |
| Description: | x, 351 p. : ill. ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science 787 |
| Subject: | Trees (Graph theory) -- Data processing -- Congresses. Data structures (Computer science) -- Congresses. Computational complexity -- Congresses. Computational complexity. Data structures (Computer science) Trees (Graph theory) -- Data processing. Conference papers and proceedings. |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/1609873 |
| LEADER | 04148cam a2200481 a 4500 | ||
|---|---|---|---|
| 001 | 1609873 | ||
| 003 | ICU | ||
| 005 | 19970813192500.0 | ||
| 008 | 940502s1994 gw a b 000 0 eng | ||
| 010 | |a 94008473 | ||
| 020 | |a 038757879X (U.S.) | ||
| 035 | |a (ICU)BID18591969 | ||
| 035 | |a (OCoLC)30034715 | ||
| 040 | |c DLC |d ICU$dOrLoB | ||
| 050 | 0 | 0 | |a QA166.2 |b .I58 1994 |
| 082 | |a 511/.5 |2 20 | ||
| 111 | 2 | |a International Colloquium on Trees in Algebra and Programming |n (19th : |d 1994 : |c Edinburgh, Scotland) | |
| 245 | 1 | 0 | |a Trees in algebra and programming, CAAP'94 : |b 19th International Colloquium, Edinburgh, U.K., April 1994 : proceedings / |c Sophie Tison, ed. |
| 260 | |a Berlin ; |a New York : |b Springer-Verlag, |c 1994. | ||
| 263 | |a 9403 | ||
| 300 | |a x, 351 p. : |b ill. ; |c 24 cm. | ||
| 336 | |a text |b txt |2 rdacontent |0 http://id.loc.gov/vocabulary/contentTypes/txt | ||
| 337 | |a unmediated |b n |2 rdamedia |0 http://id.loc.gov/vocabulary/mediaTypes/n | ||
| 338 | |a volume |b nc |2 rdacarrier |0 http://id.loc.gov/vocabulary/carriers/nc | ||
| 440 | 0 | |a Lecture notes in computer science |v 787 | |
| 504 | |a Includes bibliographical references. | ||
| 505 | 0 | 0 | |t Ordering Constraints on Trees / |r H. Comon and R. Treinen -- |t Graph Grammars and Tree Transducers / |r J. Engelfriet -- |t Type Preorders / |r F. Alessi -- |t Compilative Constructive Negation in Constraint Logic Programs / |r P. Bruscoli, F. Levi, G. Levi and M. C. Meo -- |t A New Linear Algorithm for Modular Decomposition / |r A. Cournier and M. Habib -- |t A CPS-Translation of the [lambda][mu]-Calculus / |r P. de Groote -- |t A Lower Bound on the Growth of Functions Computed by Tree Transductions / |r F. Drewes -- |t On the Decidability of Model Checking for Several [mu]-Calculi and Petri Nets / |r J. Esparza -- |t Generalizations of the Periodicity Theorem of Fine and Wilf / |r R. Giancarlo and F. Mignosi -- |t Probabilistic Domains / |r R. Heckmann -- |t Some Results on Top-Context-Free Tree Languages / |r D. Hofbauer, M. Huber and G. Kucherov -- |t On Higher Order Recursive Program Schemes / |r Z. Khasidashvili -- |t Graphs and Decidable Transductions Based on Edge Constraints / |r N. Klarlund and M. I. Schwartzbach -- |t Non-Deterministic Automata with Concurrency Relations and Domains / |r D. Kuske -- |t Algebraic and Combinatorial Properties of Simple, Coloured Walks / |r D. Merlini, R. Sprugnoli and M. C. Verri -- |t Probabilistic Analysis of an Election Algorithm in a Tree / |r Y. Metivier and N. Saheb -- |t On the First-Order Equivalence of Call-by-Name and Call-by-Value / |r T. Noll -- |t On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems / |r E. Ohlebush -- |t Global Program Analysis in Constraint Form / |r J. Palsberg -- |t On Projective and Separable Properties / |r D. Peled -- |t A Rank Hierarchy for Deterministic Tree-Walking Transducers / |r O. Rambow and G. Satta -- |t Superposition in Picture Languages / |r B. Ratoandromanana and D. Robilliard -- |t A Grammar-Based Data-Flow Analysis to Stop Deforestation / |r M. H. Sorensen. |
| 650 | 0 | |a Trees (Graph theory) |x Data processing |x Congresses. | |
| 650 | 0 | |a Data structures (Computer science) |x Congresses. |0 http://id.loc.gov/authorities/subjects/sh2009122874 | |
| 650 | 0 | |a Computational complexity |x Congresses. |0 http://id.loc.gov/authorities/subjects/sh2008101219 | |
| 650 | 7 | |a Computational complexity. |2 fast |0 http://id.worldcat.org/fast/fst00871991 | |
| 650 | 7 | |a Data structures (Computer science) |2 fast |0 http://id.worldcat.org/fast/fst00887978 | |
| 650 | 7 | |a Trees (Graph theory) |x Data processing. |2 fast |0 http://id.worldcat.org/fast/fst01156139 | |
| 655 | 7 | |a Conference papers and proceedings. |2 fast |0 http://id.worldcat.org/fast/fst01423772 | |
| 700 | 1 | 0 | |a Tison, Sophie |0 http://id.loc.gov/authorities/names/n94018483 |1 http://viaf.org/viaf/47450710 |
| 850 | |a ICU | ||
| 901 | |a ToCBNA | ||
| 903 | |a HeVa | ||
| 903 | |a Hathi | ||
| 929 | |a cat | ||
| 999 | f | f | |i 8ed71105-c6e9-501c-bebb-841034911dab |s b04bf0ef-b909-54be-bab3-e331c44d8400 |
| 928 | |t Library of Congress classification |a QA166.2.I580 1994 |l ASR |c ASR-SciASR |i 2826237 | ||
| 927 | |t Library of Congress classification |a QA166.2.I580 1994 |l ASR |c ASR-SciASR |e CRERAR |b 40476186 |i 3053012 | ||
