Tail recursion through universal invariants:
Abstract: "Tail recursive constructions suggest a new semantics for datatypes, which allows a direct match between specifications and tail recursive programs. The semantics focusses [sic] on loops, their fixpoints, invariants and convergence. Convergent models of the natural numbers and lists a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1992
|
| Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
205 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Tail recursive constructions suggest a new semantics for datatypes, which allows a direct match between specifications and tail recursive programs. The semantics focusses [sic] on loops, their fixpoints, invariants and convergence. Convergent models of the natural numbers and lists are examined in detail, and, under very mild conditions, are shown to be equivalent to the corresponding initial algebra models." |
| Beschreibung: | 42 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009681406 | ||
| 003 | DE-604 | ||
| 005 | 19991116 | ||
| 007 | t | ||
| 008 | 940629s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28056650 | ||
| 035 | |a (DE-599)BVBBV009681406 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 455f |2 stub | ||
| 100 | 1 | |a Jay, C. B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tail recursion through universal invariants |c by C. Barry Jay |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 42 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 205 | |
| 520 | 3 | |a Abstract: "Tail recursive constructions suggest a new semantics for datatypes, which allows a direct match between specifications and tail recursive programs. The semantics focusses [sic] on loops, their fixpoints, invariants and convergence. Convergent models of the natural numbers and lists are examined in detail, and, under very mild conditions, are shown to be equivalent to the corresponding initial algebra models." | |
| 650 | 7 | |a Applied statistics, operational research |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 650 | 4 | |a Recursion theory | |
| 830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 205 |w (DE-604)BV008930032 |9 205 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006401683 | ||
Datensatz im Suchindex
| _version_ | 1804124024947605504 |
|---|---|
| any_adam_object | |
| author | Jay, C. B. |
| author_facet | Jay, C. B. |
| author_role | aut |
| author_sort | Jay, C. B. |
| author_variant | c b j cb cbj |
| building | Verbundindex |
| bvnumber | BV009681406 |
| classification_tum | DAT 455f |
| ctrlnum | (OCoLC)28056650 (DE-599)BVBBV009681406 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01562nam a2200349 cb4500</leader><controlfield tag="001">BV009681406</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19991116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940629s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28056650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009681406</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="084" ind1=" " ind2=" "><subfield code="a">DAT 455f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jay, C. B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tail recursion through universal invariants</subfield><subfield code="c">by C. Barry Jay</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">42 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">205</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Tail recursive constructions suggest a new semantics for datatypes, which allows a direct match between specifications and tail recursive programs. The semantics focusses [sic] on loops, their fixpoints, invariants and convergence. Convergent models of the natural numbers and lists are examined in detail, and, under very mild conditions, are shown to be equivalent to the corresponding initial algebra models."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Applied statistics, operational research</subfield><subfield code="2">sigle</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">Abstract data types (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</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">205</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">205</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006401683</subfield></datafield></record></collection> |
| id | DE-604.BV009681406 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:39:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006401683 |
| oclc_num | 28056650 |
| open_access_boolean | |
| physical | 42 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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 | Jay, C. B. Verfasser aut Tail recursion through universal invariants by C. Barry Jay Edinburgh 1992 42 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 205 Abstract: "Tail recursive constructions suggest a new semantics for datatypes, which allows a direct match between specifications and tail recursive programs. The semantics focusses [sic] on loops, their fixpoints, invariants and convergence. Convergent models of the natural numbers and lists are examined in detail, and, under very mild conditions, are shown to be equivalent to the corresponding initial algebra models." Applied statistics, operational research sigle Computer software sigle Mathematics sigle Mathematik Abstract data types (Computer science) Recursion theory Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 205 (DE-604)BV008930032 205 |
| spellingShingle | Jay, C. B. Tail recursion through universal invariants Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Applied statistics, operational research sigle Computer software sigle Mathematics sigle Mathematik Abstract data types (Computer science) Recursion theory |
| title | Tail recursion through universal invariants |
| title_auth | Tail recursion through universal invariants |
| title_exact_search | Tail recursion through universal invariants |
| title_full | Tail recursion through universal invariants by C. Barry Jay |
| title_fullStr | Tail recursion through universal invariants by C. Barry Jay |
| title_full_unstemmed | Tail recursion through universal invariants by C. Barry Jay |
| title_short | Tail recursion through universal invariants |
| title_sort | tail recursion through universal invariants |
| topic | Applied statistics, operational research sigle Computer software sigle Mathematics sigle Mathematik Abstract data types (Computer science) Recursion theory |
| topic_facet | Applied statistics, operational research Computer software Mathematics Mathematik Abstract data types (Computer science) Recursion theory |
| volume_link | (DE-604)BV008930032 |
| work_keys_str_mv | AT jaycb tailrecursionthroughuniversalinvariants |