On the sequential nature of unification:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1984
|
| Schlagworte: | |
| Beschreibung: | 20 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021896284 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 910306s1984 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)13340605 | ||
| 035 | |a (DE-599)BVBBV021896284 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT LCS TM 257 | ||
| 100 | 1 | |a Dwork, Cynthia |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the sequential nature of unification |c Cynthia Dwork ; Paris C. Kanellakis ; John C. Mitchell |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1984 | |
| 300 | |a 20 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Kanellakis, Paris C. |e Verfasser |4 aut | |
| 700 | 1 | |a Mitchell, John C. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015111467 | ||
Datensatz im Suchindex
| _version_ | 1804135841103085568 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Dwork, Cynthia Kanellakis, Paris C. Mitchell, John C. |
| author_facet | Dwork, Cynthia Kanellakis, Paris C. Mitchell, John C. |
| author_role | aut aut aut |
| author_sort | Dwork, Cynthia |
| author_variant | c d cd p c k pc pck j c m jc jcm |
| building | Verbundindex |
| bvnumber | BV021896284 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)13340605 (DE-599)BVBBV021896284 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01427nam a2200421zc 4500</leader><controlfield tag="001">BV021896284</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910306s1984 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)13340605</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896284</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 257</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dwork, Cynthia</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the sequential nature of unification</subfield><subfield code="c">Cynthia Dwork ; Paris C. Kanellakis ; John C. Mitchell</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">PROLOG</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4047464-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">PROLOG</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4047464-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kanellakis, Paris C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mitchell, John C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111467</subfield></datafield></record></collection> |
| id | DE-604.BV021896284 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:04:23Z |
| indexdate | 2024-07-09T20:46:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111467 |
| oclc_num | 13340605 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 20 S. graph. Darst. |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Dwork, Cynthia Verfasser aut On the sequential nature of unification Cynthia Dwork ; Paris C. Kanellakis ; John C. Mitchell Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1984 20 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithms Automatic theorem proving Algorithmus (DE-588)4001183-5 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf PROLOG Programmiersprache (DE-588)4047464-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 PROLOG Programmiersprache (DE-588)4047464-1 s Parallelverarbeitung (DE-588)4075860-6 s Kanellakis, Paris C. Verfasser aut Mitchell, John C. Verfasser aut |
| spellingShingle | Dwork, Cynthia Kanellakis, Paris C. Mitchell, John C. On the sequential nature of unification Algorithms Automatic theorem proving Algorithmus (DE-588)4001183-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd PROLOG Programmiersprache (DE-588)4047464-1 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4075860-6 (DE-588)4047464-1 |
| title | On the sequential nature of unification |
| title_auth | On the sequential nature of unification |
| title_exact_search | On the sequential nature of unification |
| title_exact_search_txtP | On the sequential nature of unification |
| title_full | On the sequential nature of unification Cynthia Dwork ; Paris C. Kanellakis ; John C. Mitchell |
| title_fullStr | On the sequential nature of unification Cynthia Dwork ; Paris C. Kanellakis ; John C. Mitchell |
| title_full_unstemmed | On the sequential nature of unification Cynthia Dwork ; Paris C. Kanellakis ; John C. Mitchell |
| title_short | On the sequential nature of unification |
| title_sort | on the sequential nature of unification |
| topic | Algorithms Automatic theorem proving Algorithmus (DE-588)4001183-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd PROLOG Programmiersprache (DE-588)4047464-1 gnd |
| topic_facet | Algorithms Automatic theorem proving Algorithmus Parallelverarbeitung PROLOG Programmiersprache |
| work_keys_str_mv | AT dworkcynthia onthesequentialnatureofunification AT kanellakisparisc onthesequentialnatureofunification AT mitchelljohnc onthesequentialnatureofunification |