Towards a domain theory for termination proofs:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1995
|
Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
314 |
Schlagworte: | |
Beschreibung: | 32 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011040789 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 961106s1995 |||| 00||| engod | ||
035 | |a (OCoLC)60258156 | ||
035 | |a (DE-599)BVBBV011040789 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Kahrs, SStefan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Towards a domain theory for termination proofs |c by Alan Frieze ... |
246 | 1 | 3 | |a ECS LFCS 95 314 |
264 | 1 | |a Edinburgh |c 1995 | |
300 | |a 32 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 314 | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Mathematics |2 sigle | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Computer software | |
650 | 4 | |a Mathematics | |
830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 314 |w (DE-604)BV008930032 |9 314 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007392526 |
Datensatz im Suchindex
_version_ | 1804125529752731648 |
---|---|
any_adam_object | |
author | Kahrs, SStefan |
author_facet | Kahrs, SStefan |
author_role | aut |
author_sort | Kahrs, SStefan |
author_variant | s k sk |
building | Verbundindex |
bvnumber | BV011040789 |
ctrlnum | (OCoLC)60258156 (DE-599)BVBBV011040789 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01043nam a2200325 cb4500</leader><controlfield tag="001">BV011040789</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961106s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60258156</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011040789</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="100" ind1="1" ind2=" "><subfield code="a">Kahrs, SStefan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Towards a domain theory for termination proofs</subfield><subfield code="c">by Alan Frieze ...</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">ECS LFCS 95 314</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 S.</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">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">314</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">314</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">314</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007392526</subfield></datafield></record></collection> |
id | DE-604.BV011040789 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:03:01Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007392526 |
oclc_num | 60258156 |
open_access_boolean | |
physical | 32 S. |
publishDate | 1995 |
publishDateSearch | 1995 |
publishDateSort | 1995 |
record_format | marc |
series | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
series2 | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
spelling | Kahrs, SStefan Verfasser aut Towards a domain theory for termination proofs by Alan Frieze ... ECS LFCS 95 314 Edinburgh 1995 32 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 314 Computer software sigle Mathematics sigle Mathematik Computer software Mathematics Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 314 (DE-604)BV008930032 314 |
spellingShingle | Kahrs, SStefan Towards a domain theory for termination proofs Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Computer software sigle Mathematics sigle Mathematik Computer software Mathematics |
title | Towards a domain theory for termination proofs |
title_alt | ECS LFCS 95 314 |
title_auth | Towards a domain theory for termination proofs |
title_exact_search | Towards a domain theory for termination proofs |
title_full | Towards a domain theory for termination proofs by Alan Frieze ... |
title_fullStr | Towards a domain theory for termination proofs by Alan Frieze ... |
title_full_unstemmed | Towards a domain theory for termination proofs by Alan Frieze ... |
title_short | Towards a domain theory for termination proofs |
title_sort | towards a domain theory for termination proofs |
topic | Computer software sigle Mathematics sigle Mathematik Computer software Mathematics |
topic_facet | Computer software Mathematics Mathematik |
volume_link | (DE-604)BV008930032 |
work_keys_str_mv | AT kahrssstefan towardsadomaintheoryforterminationproofs AT kahrssstefan ecslfcs95314 |