Correct separate and selective closure conversion:
Abstract: "We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1995
|
Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
315 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions may be considered regular trees. A translation merges the separate annotations into annotations for the substituted context. Substituting the transformed term into the transformed context is equivalent to transforming the substituted context. Using earlier results for selective closure conversion, the separate transformation is shown correct." |
Beschreibung: | 34 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011040801 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 961106s1995 |||| 00||| engod | ||
035 | |a (OCoLC)34749312 | ||
035 | |a (DE-599)BVBBV011040801 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Steckler, Paul |e Verfasser |4 aut | |
245 | 1 | 0 | |a Correct separate and selective closure conversion |c by Paul Steckler |
246 | 1 | 3 | |a ECS LFCS 95 315 |
264 | 1 | |a Edinburgh |c 1995 | |
300 | |a 34 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 315 | |
520 | 3 | |a Abstract: "We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions may be considered regular trees. A translation merges the separate annotations into annotations for the substituted context. Substituting the transformed term into the transformed context is equivalent to transforming the substituted context. Using earlier results for selective closure conversion, the separate transformation is shown correct." | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Mathematics |2 sigle | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Compilers (Computer programs) | |
650 | 4 | |a Parsing (Computer grammar) | |
650 | 4 | |a Transformations (Mathematics) | |
650 | 4 | |a Trees (Graph theory) | |
830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 315 |w (DE-604)BV008930032 |9 315 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007392535 |
Datensatz im Suchindex
_version_ | 1804125529772654592 |
---|---|
any_adam_object | |
author | Steckler, Paul |
author_facet | Steckler, Paul |
author_role | aut |
author_sort | Steckler, Paul |
author_variant | p s ps |
building | Verbundindex |
bvnumber | BV011040801 |
ctrlnum | (OCoLC)34749312 (DE-599)BVBBV011040801 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01811nam a2200361 cb4500</leader><controlfield tag="001">BV011040801</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)34749312</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011040801</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">Steckler, Paul</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Correct separate and selective closure conversion</subfield><subfield code="c">by Paul Steckler</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">ECS LFCS 95 315</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">34 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">315</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions may be considered regular trees. A translation merges the separate annotations into annotations for the substituted context. Substituting the transformed term into the transformed context is equivalent to transforming the substituted context. Using earlier results for selective closure conversion, the separate transformation is shown correct."</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">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transformations (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph 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">315</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">315</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007392535</subfield></datafield></record></collection> |
id | DE-604.BV011040801 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:03:01Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007392535 |
oclc_num | 34749312 |
open_access_boolean | |
physical | 34 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 | Steckler, Paul Verfasser aut Correct separate and selective closure conversion by Paul Steckler ECS LFCS 95 315 Edinburgh 1995 34 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 315 Abstract: "We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions may be considered regular trees. A translation merges the separate annotations into annotations for the substituted context. Substituting the transformed term into the transformed context is equivalent to transforming the substituted context. Using earlier results for selective closure conversion, the separate transformation is shown correct." Computer software sigle Mathematics sigle Mathematik Compilers (Computer programs) Parsing (Computer grammar) Transformations (Mathematics) Trees (Graph theory) Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 315 (DE-604)BV008930032 315 |
spellingShingle | Steckler, Paul Correct separate and selective closure conversion Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Computer software sigle Mathematics sigle Mathematik Compilers (Computer programs) Parsing (Computer grammar) Transformations (Mathematics) Trees (Graph theory) |
title | Correct separate and selective closure conversion |
title_alt | ECS LFCS 95 315 |
title_auth | Correct separate and selective closure conversion |
title_exact_search | Correct separate and selective closure conversion |
title_full | Correct separate and selective closure conversion by Paul Steckler |
title_fullStr | Correct separate and selective closure conversion by Paul Steckler |
title_full_unstemmed | Correct separate and selective closure conversion by Paul Steckler |
title_short | Correct separate and selective closure conversion |
title_sort | correct separate and selective closure conversion |
topic | Computer software sigle Mathematics sigle Mathematik Compilers (Computer programs) Parsing (Computer grammar) Transformations (Mathematics) Trees (Graph theory) |
topic_facet | Computer software Mathematics Mathematik Compilers (Computer programs) Parsing (Computer grammar) Transformations (Mathematics) Trees (Graph theory) |
volume_link | (DE-604)BV008930032 |
work_keys_str_mv | AT stecklerpaul correctseparateandselectiveclosureconversion AT stecklerpaul ecslfcs95315 |