Unlimp, uniqueness as a leitmotiv for implementation:
Abstract: "When evaluation in functional programming languages is explained using [lambda]-calculus and/or term rewriting systems, expressions and function definitions are often defined as terms, that is as trees. Similarly, the collection of all terms is defined as a forest, that is a directed...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1992
|
| Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
219 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "When evaluation in functional programming languages is explained using [lambda]-calculus and/or term rewriting systems, expressions and function definitions are often defined as terms, that is as trees. Similarly, the collection of all terms is defined as a forest, that is a directed, acyclic graph where every vertex has at most one incoming edge. Concrete implementations usually drop the last restriction (and sometime acyclicity as well), i.e. many terms can share a common subterm, meaning that different paths of subterm edges reach the same vertex in the graph. Any vertex in such a graph represents a term. A term is represented uniquely in such a graph if there are no two different vertices representing it Such a representation can be established by using hash-consing for the creation of heap objects. We investigate the consequences of adopting uniqueness in this sense as a leitmotiv for implementation (called Unlimp), i.e. not allowing any two different vertices in a graph to represent the same term. |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009713731 | ||
| 003 | DE-604 | ||
| 005 | 19951114 | ||
| 007 | t | ||
| 008 | 940721s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27366515 | ||
| 035 | |a (DE-599)BVBBV009713731 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Kahrs, Stefan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Unlimp, uniqueness as a leitmotiv for implementation |c by Stefan Kahrs |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 15 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 219 | |
| 520 | 3 | |a Abstract: "When evaluation in functional programming languages is explained using [lambda]-calculus and/or term rewriting systems, expressions and function definitions are often defined as terms, that is as trees. Similarly, the collection of all terms is defined as a forest, that is a directed, acyclic graph where every vertex has at most one incoming edge. Concrete implementations usually drop the last restriction (and sometime acyclicity as well), i.e. many terms can share a common subterm, meaning that different paths of subterm edges reach the same vertex in the graph. Any vertex in such a graph represents a term. A term is represented uniquely in such a graph if there are no two different vertices representing it | |
| 520 | 3 | |a Such a representation can be established by using hash-consing for the creation of heap objects. We investigate the consequences of adopting uniqueness in this sense as a leitmotiv for implementation (called Unlimp), i.e. not allowing any two different vertices in a graph to represent the same term. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Functional programming (Computer science) | |
| 830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 219 |w (DE-604)BV008930032 |9 219 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006425250 | ||
Datensatz im Suchindex
| _version_ | 1804124061464264704 |
|---|---|
| any_adam_object | |
| author | Kahrs, Stefan |
| author_facet | Kahrs, Stefan |
| author_role | aut |
| author_sort | Kahrs, Stefan |
| author_variant | s k sk |
| building | Verbundindex |
| bvnumber | BV009713731 |
| ctrlnum | (OCoLC)27366515 (DE-599)BVBBV009713731 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02071nam a2200325 cb4500</leader><controlfield tag="001">BV009713731</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951114 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940721s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27366515</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009713731</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, Stefan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Unlimp, uniqueness as a leitmotiv for implementation</subfield><subfield code="c">by Stefan Kahrs</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">15 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">219</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "When evaluation in functional programming languages is explained using [lambda]-calculus and/or term rewriting systems, expressions and function definitions are often defined as terms, that is as trees. Similarly, the collection of all terms is defined as a forest, that is a directed, acyclic graph where every vertex has at most one incoming edge. Concrete implementations usually drop the last restriction (and sometime acyclicity as well), i.e. many terms can share a common subterm, meaning that different paths of subterm edges reach the same vertex in the graph. Any vertex in such a graph represents a term. A term is represented uniquely in such a graph if there are no two different vertices representing it</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Such a representation can be established by using hash-consing for the creation of heap objects. We investigate the consequences of adopting uniqueness in this sense as a leitmotiv for implementation (called Unlimp), i.e. not allowing any two different vertices in a graph to represent the same term.</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">Functional programming (Computer science)</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">219</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">219</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006425250</subfield></datafield></record></collection> |
| id | DE-604.BV009713731 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:39:41Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006425250 |
| oclc_num | 27366515 |
| open_access_boolean | |
| physical | 15 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 | Kahrs, Stefan Verfasser aut Unlimp, uniqueness as a leitmotiv for implementation by Stefan Kahrs Edinburgh 1992 15 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 219 Abstract: "When evaluation in functional programming languages is explained using [lambda]-calculus and/or term rewriting systems, expressions and function definitions are often defined as terms, that is as trees. Similarly, the collection of all terms is defined as a forest, that is a directed, acyclic graph where every vertex has at most one incoming edge. Concrete implementations usually drop the last restriction (and sometime acyclicity as well), i.e. many terms can share a common subterm, meaning that different paths of subterm edges reach the same vertex in the graph. Any vertex in such a graph represents a term. A term is represented uniquely in such a graph if there are no two different vertices representing it Such a representation can be established by using hash-consing for the creation of heap objects. We investigate the consequences of adopting uniqueness in this sense as a leitmotiv for implementation (called Unlimp), i.e. not allowing any two different vertices in a graph to represent the same term. Computer software sigle Mathematics sigle Mathematik Functional programming (Computer science) Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 219 (DE-604)BV008930032 219 |
| spellingShingle | Kahrs, Stefan Unlimp, uniqueness as a leitmotiv for implementation Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Computer software sigle Mathematics sigle Mathematik Functional programming (Computer science) |
| title | Unlimp, uniqueness as a leitmotiv for implementation |
| title_auth | Unlimp, uniqueness as a leitmotiv for implementation |
| title_exact_search | Unlimp, uniqueness as a leitmotiv for implementation |
| title_full | Unlimp, uniqueness as a leitmotiv for implementation by Stefan Kahrs |
| title_fullStr | Unlimp, uniqueness as a leitmotiv for implementation by Stefan Kahrs |
| title_full_unstemmed | Unlimp, uniqueness as a leitmotiv for implementation by Stefan Kahrs |
| title_short | Unlimp, uniqueness as a leitmotiv for implementation |
| title_sort | unlimp uniqueness as a leitmotiv for implementation |
| topic | Computer software sigle Mathematics sigle Mathematik Functional programming (Computer science) |
| topic_facet | Computer software Mathematics Mathematik Functional programming (Computer science) |
| volume_link | (DE-604)BV008930032 |
| work_keys_str_mv | AT kahrsstefan unlimpuniquenessasaleitmotivforimplementation |