Trees in algebra and programming: CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1996
|
| Schriftenreihe: | Lecture notes in computer science
1059 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | VIII, 329 S. graph. Darst. |
| ISBN: | 3540610642 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010713243 | ||
| 003 | DE-604 | ||
| 005 | 19970731 | ||
| 007 | t| | ||
| 008 | 960422s1996 gw d||| |||| 10||| eng d | ||
| 016 | 7 | |a 946972729 |2 DE-101 | |
| 020 | |a 3540610642 |9 3-540-61064-2 | ||
| 035 | |a (OCoLC)34546921 | ||
| 035 | |a (DE-599)BVBBV010713243 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-703 |a DE-19 |a DE-92 |a DE-20 |a DE-634 |a DE-83 |a DE-188 |a DE-11 |a DE-706 | ||
| 050 | 0 | |a QA166.2.C3 1996 | |
| 082 | 0 | |a 511/.5 |2 20 | |
| 082 | 0 | |a 511/.5 20 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a 27 |2 sdnb | ||
| 084 | |a MAT 056f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Trees in algebra and programming |b CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings |c Hélène Kirchner (ed.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1996 | |
| 300 | |a VIII, 329 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1059 | |
| 650 | 4 | |a Arbres (Théorie des graphes) - Informatique - Congrès | |
| 650 | 7 | |a Arbres (théorie des graphes) - Informatique - Congrès |2 ram | |
| 650 | 4 | |a Complexité de calcul (Informatique) - Congrès | |
| 650 | 7 | |a Complexité de calcul (informatique) - Congrès |2 ram | |
| 650 | 7 | |a Computerwiskunde |2 gtt | |
| 650 | 7 | |a Grafen |2 gtt | |
| 650 | 4 | |a Structures de données (Informatique) - Congrès | |
| 650 | 7 | |a Structures de données (informatique) - Congrès |2 ram | |
| 650 | 7 | |a arbre |2 inriac | |
| 650 | 7 | |a automate fini |2 inriac | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a contrainte |2 inriac | |
| 650 | 7 | |a lambda calcul |2 inriac | |
| 650 | 7 | |a logique |2 inriac | |
| 650 | 7 | |a réécriture |2 inriac | |
| 650 | 7 | |a spécification algébrique |2 inriac | |
| 650 | 7 | |a structure discrète |2 inriac | |
| 650 | 7 | |a sémantique langage |2 inriac | |
| 650 | 7 | |a théorie graphe |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Trees (Graph theory) -- Data processing -- Congresses | |
| 650 | 4 | |a Data structures (Computer science) -- Congresses | |
| 650 | 4 | |a Computational complexity -- Congresses | |
| 650 | 0 | 7 | |a Baum |g Mathematik |0 (DE-588)4004849-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algebra |0 (DE-588)4001156-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1996 |z Linköping |2 gnd-content | |
| 689 | 0 | 0 | |a Algebra |0 (DE-588)4001156-2 |D s |
| 689 | 0 | 1 | |a Baum |g Mathematik |0 (DE-588)4004849-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | 1 | |a Baum |g Mathematik |0 (DE-588)4004849-4 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Kirchner, Hélène |e Sonstige |4 oth | |
| 711 | 2 | |a CAAP |n 21 |d 1996 |c Linköping |j Sonstige |0 (DE-588)2154526-1 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1059 |w (DE-604)BV000000607 |9 1059 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007153236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007153236 | |
Datensatz im Suchindex
| _version_ | 1820868176510976000 |
|---|---|
| adam_text |
CONTENTS
SEMANTICS
OF
INTERACTION
(INVITED
TALK)
.
1
S.
ABRAMSKY
THE
KRONECKER
PRODUCT
AND
LOCAL
COMPUTATIONS
IN
GRAPHS
.
2
A.
BOTTREAU
AND
Y.
METIVIER
ITERATIVE
PAIRS
AND
MULTITAPE
AUTOMATA
.
17
M.
MADONIA
AND
S.
VARRICCHIO
DIOPHANTINE
EQUATIONS,
PRESBURGER
ARITHMETIC
AND
FINITE
AUTOMATA
.
30
A.
BOUDET
AND
H.
COMON
A
PUMPING
LEMMA
FOR
OUTPUT
LANGUAGES
OF
MACRO
TREE
TRANSDUCERS
.
44
A.
KUHNEMANN
THE
AREA
DETERMINED
BY
UNDERDIAGONAL
LATTICE
PATHS
.
59
D.
MERLINI,
R.
SPRUGNOLI
AND
M.C.
VERRI
EXTRACTION
OF
CONCURRENT
PROCESSES
FROM
HIGHER
DIMENSIONAL
AUTOMATA
.
72
Y.
TAKAYAMA
AXIOMATISING
EXTENDED
COMPUTATION
TREE
LOGIC
.
87
R.
KAIVOLA
FINAL
SEMANTICS
FOR
A
HIGHER
ORDER
CONCURRENT
LANGUAGE
.
102
M.
LENISA
THE
PRACTICE
OF
LOGICAL
FRAMEWORK
(INVITED
TALK)
.
119
F.
PFENNING
SUBSUMPTION
ALGORITHMS
BASED
ON
SEARCH
TREES
.
135
L.
BACHMAIR,
T.
CHEN,
C.R.
RAMAKRISHNAN,
AND
I.
V.
RAMAKRISHNAN
INTERACTION
NETS
AND
TERM
REWRITING
SYSTEMS
(EXTENDED
ABSTRACT)
.
149
M.
FERNANDEZ
AND
I.
MACKIE
COMPUTING
IN
UNPREDICTABLE
ENVIRONMENTS:
SEMANTICS,
REDUCTION
STRATEGIES,
AND
PROGRAM
TRANSFORMATIONS
.
165
B.
LISPER
RELATIVE
NORMALIZATION
IN
DETERMINISTIC
RESIDUAL
STRUCTURES
.
180
J.
GLAUERT
AND
Z.
KHASIDASHVILI
VIII
TERMINATION
BY
ABSENCE
OF INFINITE
CHAINS
OF
DEPENDENCY
PAIRS
.
196
T.
ARTS
CONFLUENCE
WITHOUT
TERMINATION
VIA
PARALLEL
CRITICAL
PAIRS
.
211
B.
GRAMLICH
AN
ORDINAL
CALCULUS
FOR
PROVING
TERMINATION
IN
TERM
REWRITING
.
226
E.A.
CICHON
AND
H.
TOUZET
BEHAVIOURAL
SATISFACTION
AND
EQUIVALENCE
IN
CONCRETE
MODEL
CATEGORIES
.
241
M.
BIDOIT
AND
A.
TARLECKI
OPEN
MAPS,
BEHAVIOURAL
EQUIVALENCES,
AND
CONGRUENCES
.
257
A.
CHENG
AND
M.
NIELSEN
DENOTATIONAL,
CAUSAL,
AND
OPERATIONAL
DETERMINISM
IN
EVENT
STRUCTURES
.
272
A.
RENSINK
EFFECTIVE
LONGEST
AND
INFINITE
REDUCTION
PATHS
IN
UNTYPED
A-CALCULI
.
287
M.H.
STFRENSEN
FULL
ABSTRACTION
FOR
LAMBDA
CALCULUS
WITH
RESOURCES
AND
CONVERGENCE
TESTING
.
302
G.
BOUDOL
AND
C.
LAVATELLI
UNTYPED
LAMBDA-CALCULUS
WITH
INPUT-OUTPUT
.
317
J.
TIURYN
AND
M.
WAND
AUTHORS
INDEX
.
331 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV010713243 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.2.C3 1996 |
| callnumber-search | QA166.2.C3 1996 |
| callnumber-sort | QA 3166.2 C3 41996 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | DAT 537f MAT 056f |
| ctrlnum | (OCoLC)34546921 (DE-599)BVBBV010713243 |
| dewey-full | 511/.5 511/.520 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 511/.5 20 |
| dewey-search | 511/.5 511/.5 20 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010713243</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970731</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960422s1996 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">946972729</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540610642</subfield><subfield code="9">3-540-61064-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34546921</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010713243</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.2.C3 1996</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">27</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 056f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Trees in algebra and programming</subfield><subfield code="b">CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings</subfield><subfield code="c">Hélène Kirchner (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 329 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1059</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arbres (Théorie des graphes) - Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Arbres (théorie des graphes) - Informatique - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computerwiskunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Structures de données (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Structures de données (informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">arbre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automate fini</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">contrainte</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">lambda calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réécriture</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">spécification algébrique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">structure discrète</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">sémantique langage</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory) -- Data processing -- Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science) -- Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity -- Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Baum</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4004849-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algebra</subfield><subfield code="0">(DE-588)4001156-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1996</subfield><subfield code="z">Linköping</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algebra</subfield><subfield code="0">(DE-588)4001156-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Baum</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4004849-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Baum</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4004849-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kirchner, Hélène</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">CAAP</subfield><subfield code="n">21</subfield><subfield code="d">1996</subfield><subfield code="c">Linköping</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2154526-1</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1059</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1059</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007153236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007153236</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1996 Linköping gnd-content |
| genre_facet | Konferenzschrift 1996 Linköping |
| id | DE-604.BV010713243 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:20:12Z |
| institution | BVB |
| institution_GND | (DE-588)2154526-1 |
| isbn | 3540610642 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007153236 |
| oclc_num | 34546921 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-703 DE-19 DE-BY-UBM DE-92 DE-20 DE-634 DE-83 DE-188 DE-11 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-703 DE-19 DE-BY-UBM DE-92 DE-20 DE-634 DE-83 DE-188 DE-11 DE-706 |
| physical | VIII, 329 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings Hélène Kirchner (ed.) Berlin [u.a.] Springer 1996 VIII, 329 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1059 Arbres (Théorie des graphes) - Informatique - Congrès Arbres (théorie des graphes) - Informatique - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram Computerwiskunde gtt Grafen gtt Structures de données (Informatique) - Congrès Structures de données (informatique) - Congrès ram arbre inriac automate fini inriac combinatoire inriac contrainte inriac lambda calcul inriac logique inriac réécriture inriac spécification algébrique inriac structure discrète inriac sémantique langage inriac théorie graphe inriac Datenverarbeitung Trees (Graph theory) -- Data processing -- Congresses Data structures (Computer science) -- Congresses Computational complexity -- Congresses Baum Mathematik (DE-588)4004849-4 gnd rswk-swf Algebra (DE-588)4001156-2 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1996 Linköping gnd-content Algebra (DE-588)4001156-2 s Baum Mathematik (DE-588)4004849-4 s DE-604 Programmierung (DE-588)4076370-5 s Kirchner, Hélène Sonstige oth CAAP 21 1996 Linköping Sonstige (DE-588)2154526-1 oth Lecture notes in computer science 1059 (DE-604)BV000000607 1059 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007153236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings Lecture notes in computer science Arbres (Théorie des graphes) - Informatique - Congrès Arbres (théorie des graphes) - Informatique - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram Computerwiskunde gtt Grafen gtt Structures de données (Informatique) - Congrès Structures de données (informatique) - Congrès ram arbre inriac automate fini inriac combinatoire inriac contrainte inriac lambda calcul inriac logique inriac réécriture inriac spécification algébrique inriac structure discrète inriac sémantique langage inriac théorie graphe inriac Datenverarbeitung Trees (Graph theory) -- Data processing -- Congresses Data structures (Computer science) -- Congresses Computational complexity -- Congresses Baum Mathematik (DE-588)4004849-4 gnd Algebra (DE-588)4001156-2 gnd Programmierung (DE-588)4076370-5 gnd |
| subject_GND | (DE-588)4004849-4 (DE-588)4001156-2 (DE-588)4076370-5 (DE-588)1071861417 |
| title | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings |
| title_auth | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings |
| title_exact_search | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings |
| title_full | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings Hélène Kirchner (ed.) |
| title_fullStr | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings Hélène Kirchner (ed.) |
| title_full_unstemmed | Trees in algebra and programming CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings Hélène Kirchner (ed.) |
| title_short | Trees in algebra and programming |
| title_sort | trees in algebra and programming caap 96 21st international colloquium linkoping sweden april 22 24 1996 proceedings |
| title_sub | CAAP '96 : 21st international colloquium Linköping, Sweden, April 22 - 24, 1996 ; proceedings |
| topic | Arbres (Théorie des graphes) - Informatique - Congrès Arbres (théorie des graphes) - Informatique - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram Computerwiskunde gtt Grafen gtt Structures de données (Informatique) - Congrès Structures de données (informatique) - Congrès ram arbre inriac automate fini inriac combinatoire inriac contrainte inriac lambda calcul inriac logique inriac réécriture inriac spécification algébrique inriac structure discrète inriac sémantique langage inriac théorie graphe inriac Datenverarbeitung Trees (Graph theory) -- Data processing -- Congresses Data structures (Computer science) -- Congresses Computational complexity -- Congresses Baum Mathematik (DE-588)4004849-4 gnd Algebra (DE-588)4001156-2 gnd Programmierung (DE-588)4076370-5 gnd |
| topic_facet | Arbres (Théorie des graphes) - Informatique - Congrès Arbres (théorie des graphes) - Informatique - Congrès Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès Computerwiskunde Grafen Structures de données (Informatique) - Congrès Structures de données (informatique) - Congrès arbre automate fini combinatoire contrainte lambda calcul logique réécriture spécification algébrique structure discrète sémantique langage théorie graphe Datenverarbeitung Trees (Graph theory) -- Data processing -- Congresses Data structures (Computer science) -- Congresses Computational complexity -- Congresses Baum Mathematik Algebra Programmierung Konferenzschrift 1996 Linköping |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007153236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT kirchnerhelene treesinalgebraandprogrammingcaap9621stinternationalcolloquiumlinkopingswedenapril22241996proceedings AT caaplinkoping treesinalgebraandprogrammingcaap9621stinternationalcolloquiumlinkopingswedenapril22241996proceedings |