|
|
|
|
| LEADER |
03383nam a2200373 a 4500 |
| 001 |
c000162610 |
| 003 |
CARM |
| 005 |
20020612000000.0 |
| 008 |
940224s1994 gw a b 000 0 eng |
| 010 |
|
|
|a 94008473
|
| 019 |
1 |
|
|a 10842499
|z 45184443
|5 LACONCORD2021
|
| 020 |
|
|
|a 354057879X
|b (Berlin : acid-free paper)
|
| 020 |
|
|
|a 038757879X
|b (New York : acid-free paper)
|
| 035 |
|
|
|a (OCoLC)30034715
|5 LACONCORD2021
|
| 040 |
|
|
|a DLC
|b eng
|c DLC
|d DLC
|d TOC
|
| 050 |
|
0 |
|a QA166.2
|b .I58 1994
|
| 050 |
0 |
0 |
|a QA166.2
|b .I58 1994
|
| 082 |
0 |
0 |
|a 511/.5
|2 20
|
| 245 |
0 |
0 |
|a Trees in algebra and programming, CAAP'94 :
|b 19th international colloquium, Edinburgh, U.K., April 11-13, 1994 : proceedings /
|c Sophie Tison, (ed.)
|
| 260 |
|
|
|a Berlin ;
|a New York :
|b Springer-Verlag,
|c c1994.
|
| 300 |
|
|
|a x, 351 p. :
|b ill. ;
|c 24 cm.
|
| 440 |
|
0 |
|a Lecture notes in computer science ;
|v 787.
|
| 500 |
|
|
|a "19th Colloquium on Trees in Algebra and Programming (CAAP '94)"--Pref.
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 505 |
0 |
|
|a Ordering Constraints on Trees / H. Comon and R. Treinen -- Graph Grammars and Tree Transducers / J. Engelfriet -- Type Preorders / F. Alessi -- Compilative Constructive Negation in Constraint Logic Programs / P. Bruscoli, F. Levi, G. Levi and M. C. Meo -- A New Linear Algorithm for Modular Decomposition / A. Cournier and M. Habib -- A CPS-Translation of the [lambda][mu]-Calculus / P. de Groote -- A Lower Bound on the Growth of Functions Computed by Tree Transductions / F. Drewes -- On the Decidability of Model Checking for Several [mu]-Calculi and Petri Nets / J. Esparza -- Generalizations of the Periodicity Theorem of Fine and Wilf / R. Giancarlo and F. Mignosi -- Probabilistic Domains / R. Heckmann -- Some Results on Top-Context-Free Tree Languages / D. Hofbauer, M. Huber and G. Kucherov -- On Higher Order Recursive Program Schemes / Z. Khasidashvili -- Graphs and Decidable Transductions Based on Edge Constraints / N. Klarlund and M. I. Schwartzbach.
|
| 505 |
0 |
|
|a Non-Deterministic Automata with Concurrency Relations and Domains / D. Kuske -- Algebraic and Combinatorial Properties of Simple, Coloured Walks / D. Merlini, R. Sprugnoli and M. C. Verri -- Probabilistic Analysis of an Election Algorithm in a Tree / Y. Metivier and N. Saheb -- On the First-Order Equivalence of Call-by-Name and Call-by-Value / T. Noll -- On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems / E. Ohlebush -- Global Program Analysis in Constraint Form / J. Palsberg -- On Projective and Separable Properties / D. Peled -- A Rank Hierarchy for Deterministic Tree-Walking Transducers / O. Rambow and G. Satta -- Superposition in Picture Languages / B. Ratoandromanana and D. Robilliard -- A Grammar-Based Data-Flow Analysis to Stop Deforestation / M. H. Sorensen.
|
| 650 |
|
0 |
|a Trees (Graph theory)
|x Data processing
|x Congresses.
|
| 650 |
|
0 |
|a Data structures (Computer science)
|x Congresses.
|
| 650 |
|
0 |
|a Computational complexity
|x Congresses.
|
| 700 |
1 |
|
|a Tison, Sophie.
|
| 711 |
2 |
|
|a International Colloquium on Trees in Algebra and Programming
|n (19th :,
|d 1994 :
|c Edinburgh, Scotland)
|
| 852 |
8 |
|
|b CARM
|h A2:AM11F0
|i C05511
|p 0214672
|f BK
|
| 999 |
f |
f |
|i 70299f6c-7338-5c82-a125-e64c0ba304e8
|s e36cf75b-bccb-5712-b8e2-5e4547d0fb62
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e C05511
|f A2:AM11F0
|h Other scheme
|i book
|m 0214672
|