Integer constraints to stop deforestation
Identifieur interne : 001113 ( Istex/Corpus ); précédent : 001112; suivant : 001114Integer constraints to stop deforestation
Auteurs : Helmut SeidlSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1996.
Abstract
Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.
Url:
DOI: 10.1007/3-540-61055-3_46
Links to Exploration step
ISTEX:795351154C8A996243C163A93C5232FB45505B2ELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Integer constraints to stop deforestation</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation><mods:affiliation>FB IV - Informatik, University Trier, D-54286, Trier</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:795351154C8A996243C163A93C5232FB45505B2E</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61055-3_46</idno><idno type="url">https://api.istex.fr/document/795351154C8A996243C163A93C5232FB45505B2E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001113</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001113</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Integer constraints to stop deforestation</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation><mods:affiliation>FB IV - Informatik, University Trier, D-54286, Trier</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1996</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">795351154C8A996243C163A93C5232FB45505B2E</idno><idno type="DOI">10.1007/3-540-61055-3_46</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Helmut Seidl</name><affiliations><json:string>FB IV - Informatik, University Trier, D-54286, Trier</json:string><json:string>E-mail: seidl@psi.uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.</abstract><qualityIndicators><score>5.984</score><pdfVersion>1.3</pdfVersion><pdfPageSize>439.28 x 662.28 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>556</abstractCharCount><pdfWordCount>5492</pdfWordCount><pdfCharCount>27274</pdfCharCount><pdfPageCount>15</pdfPageCount><abstractWordCount>82</abstractWordCount></qualityIndicators><title>Integer constraints to stop deforestation</title><chapterId><json:string>21</json:string><json:string>Chap21</json:string></chapterId><refBibs><json:item><host><author></author><title>1 is in S; 3. #I d</title></host></json:item><json:item><author><json:item><name>N Andersen</name></json:item></author><host><volume>8616</volume><author></author><title>Report Nr</title><publicationDate>1986</publicationDate></host><title>Approximating Term Rewrite Systems by Regular Tree Grammars</title><publicationDate>1986</publicationDate></json:item><json:item><host><author><json:item><name>Wei-Ngan Chin</name></json:item></author><title>Automatic Methods for Program Transformation</title><publicationDate>1990-07</publicationDate></host></json:item><json:item><author><json:item><name>Wei-Ngan Chin</name></json:item><json:item><name>C </name></json:item></author><host><pages><last>555</last><first>515</first></pages><author></author><title>Proc. PEPM'93</title><publicationDate>1993</publicationDate></host><title>Safe Fusion of Functional Expressions II: Further Improvements Conseh A Tour of Schism: A Partial Evaluation System for Higher-Order Applicative Languages</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>P Cousot</name></json:item><json:item><name>R </name></json:item></author><host><pages><last>308</last><first>293</first></pages><author></author><title>Proc. CAV'95</title><publicationDate>1995</publicationDate></host><title>Cousot: Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Gametheoretic Form</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>A Deutsch</name></json:item></author><host><pages><last>168</last><first>157</first></pages><author></author><title>Proc. 17th ACM Syrup. on Principles of Programming Languages</title><publicationDate>1990</publicationDate></host><title>On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications</title><publicationDate>1990</publicationDate></json:item><json:item><author><json:item><name>A Ferguson</name></json:item><json:item><name>P Wadler</name></json:item></author><host><pages><last>317</last><first>306</first></pages><author></author><title>Glasgow Workshop on Functional Programming Set-based Analysis of ML Programs. Proc. of the 1994 ACM Conference on Lisp and Functional Programming</title><publicationDate>1988-06</publicationDate></host><title>When will deforestation stop</title><publicationDate>1988-06</publicationDate></json:item><json:item><author><json:item><name>N,D Jones</name></json:item><json:item><name>S,S Muchnick</name></json:item><json:item><name>N,D Jones</name></json:item><json:item><name>H. Riis Nielson</name></json:item><json:item><name>F Nielson</name></json:item></author><host><pages><last>256</last><first>244</first></pages><author></author><title>Flow Analysis of LISP-like Structures Proc. TAPSOFT'95 J. Palsberg: Closure Analysis in Constraint Form</title><publicationDate>1979</publicationDate></host><title>Flow Analysis of Lazy Higher-Order Functional Programs Abstract Interpretation Static and Dynamic Processor Allocation for Higher Order Concurrent Languages</title><publicationDate>1979</publicationDate></json:item><json:item><author><json:item><name>J,C Reynolds</name></json:item><json:item><name>D </name></json:item></author><host><pages><last>461</last><first>456</first></pages><author></author><title>Proc. TAPSOFT'95 Proc. ICALP'94</title><publicationDate>1969</publicationDate></host><title>Automatic Computation of Data Set Definitions Sands: Proving Correctness of Recursion-Based Automatic Program Transformations</title><publicationDate>1969</publicationDate></json:item><json:item><host><pages><last>87</last><first>47</first></pages><author><json:item><name>O Shivers</name></json:item></author><title>Data-Flow Analysis and Type Recovery in Scheme Topics in Advanced Language Implementation</title><publicationDate>1991</publicationDate></host></json:item><json:item><host><author><json:item><name> Turchin 's Supercompiler Revisited</name></json:item></author><title>Master's Thesis</title><publicationDate>1994-03</publicationDate></host></json:item><json:item><author><json:item><name>M,H Scrensen</name></json:item></author><host><pages><last>351</last><first>335</first></pages><author></author><title>Proc. CAAP'94</title><publicationDate>1994</publicationDate></host><title>A Grammar-based Data-flow Analysis to Stop Deforestation</title><publicationDate>1994</publicationDate></json:item><json:item><author><json:item><name>M,H Scrensen</name></json:item><json:item><name>R Gliick</name></json:item><json:item><name>N,D Jones</name></json:item></author><host><pages><last>500</last><first>485</first></pages><author></author><title>Proc. ESOP'94</title><publicationDate>1994</publicationDate></host><title>Towards Unifying Partial Evaluation, Deforestation, Supercompilation and GPC</title><publicationDate>1994</publicationDate></json:item><json:item><author><json:item><name>P Wacller</name></json:item></author><host><pages><last>248</last><first>231</first></pages><author></author><title>Proc. ESOP'88</title><publicationDate>1990</publicationDate></host><title>Deforestation: Transforming Programs to Eliminate Trees</title><publicationDate>1990</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>1996</copyrightDate></serie><host><editor><json:item><name>Hanne Riis Nielson</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Software Engineering</value></json:item></subject><isbn><json:string>978-3-540-61055-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Programming Languages and Systems — ESOP '96</title><bookId><json:string>3540610553</json:string></bookId><volume>1058</volume><pages><last>340</last><first>326</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-49942-8</json:string></eisbn><copyrightDate>1996</copyrightDate><doi><json:string>10.1007/3-540-61055-3</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>1996</copyrightDate><doi><json:string>10.1007/3-540-61055-3_46</json:string></doi><id>795351154C8A996243C163A93C5232FB45505B2E</id><score>0.6238319</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/795351154C8A996243C163A93C5232FB45505B2E/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/795351154C8A996243C163A93C5232FB45505B2E/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/795351154C8A996243C163A93C5232FB45505B2E/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Integer constraints to stop deforestation</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag, 1996</p></availability><date>1996</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Integer constraints to stop deforestation</title><author xml:id="author-1"><persName><forename type="first">Helmut</forename><surname>Seidl</surname></persName><email>seidl@psi.uni-trier.de</email><affiliation>FB IV - Informatik, University Trier, D-54286, Trier</affiliation></author></analytic><monogr><title level="m">Programming Languages and Systems — ESOP '96</title><title level="m" type="sub">6th European Symposium on Programming Linköping, Sweden, April 22–24, 1996 Proceedings</title><idno type="pISBN">978-3-540-61055-7</idno><idno type="eISBN">978-3-540-49942-8</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/3-540-61055-3</idno><idno type="book-ID">3540610553</idno><idno type="book-title-ID">44983</idno><idno type="book-volume-number">1058</idno><idno type="book-chapter-count">25</idno><editor><persName><forename type="first">Hanne</forename><forename type="first">Riis</forename><surname>Nielson</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-06-02"></date><biblScope unit="volume">1058</biblScope><biblScope unit="page" from="326">326</biblScope><biblScope unit="page" to="340">340</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName></editor><biblScope><date>1996</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">795351154C8A996243C163A93C5232FB45505B2E</idno><idno type="DOI">10.1007/3-540-61055-3_46</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1996</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I14037</label><label>I1603X</label><label>I16048</label><label>I14010</label><label>I14029</label><item><term>Computer Science</term></item><item><term>Programming Languages, Compilers, Interpreters</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Programming Techniques</term></item><item><term>Software Engineering</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-06-02">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/795351154C8A996243C163A93C5232FB45505B2E/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540610553</BookID><BookTitle>Programming Languages and Systems — ESOP '96</BookTitle><BookSubTitle>6th European Symposium on Programming Linköping, Sweden, April 22–24, 1996 Proceedings</BookSubTitle><BookVolumeNumber>1058</BookVolumeNumber><BookDOI>10.1007/3-540-61055-3</BookDOI><BookTitleID>44983</BookTitleID><BookPrintISBN>978-3-540-61055-7</BookPrintISBN><BookElectronicISBN>978-3-540-49942-8</BookElectronicISBN><BookChapterCount>25</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1996</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14037" Priority="1" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14010" Priority="4" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14029" Priority="5" Type="Secondary">Software Engineering</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Hanne</GivenName><GivenName>Riis</GivenName><FamilyName>Nielson</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap21" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>21</ChapterID><ChapterDOI>10.1007/3-540-61055-3_46</ChapterDOI><ChapterSequenceNumber>21</ChapterSequenceNumber><ChapterTitle Language="En">Integer constraints to stop deforestation</ChapterTitle><ChapterCategory>Contributed Papers</ChapterCategory><ChapterFirstPage>326</ChapterFirstPage><ChapterLastPage>340</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1996</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>2</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540610553</BookID><BookTitle>Programming Languages and Systems — ESOP '96</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Helmut</GivenName><FamilyName>Seidl</FamilyName></AuthorName><Contact><Email>seidl@psi.uni-trier.de</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>FB IV - Informatik</OrgDivision><OrgName>University Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Integer constraints to stop deforestation</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Integer constraints to stop deforestation</title></titleInfo><name type="personal"><namePart type="given">Helmut</namePart><namePart type="family">Seidl</namePart><affiliation>FB IV - Informatik, University Trier, D-54286, Trier</affiliation><affiliation>E-mail: seidl@psi.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005-06-02</dateIssued><copyrightDate encoding="w3cdtf">1996</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.</abstract><relatedItem type="host"><titleInfo><title>Programming Languages and Systems — ESOP '96</title><subTitle>6th European Symposium on Programming Linköping, Sweden, April 22–24, 1996 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Hanne</namePart><namePart type="given">Riis</namePart><namePart type="family">Nielson</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1996</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic></subject><identifier type="DOI">10.1007/3-540-61055-3</identifier><identifier type="ISBN">978-3-540-61055-7</identifier><identifier type="eISBN">978-3-540-49942-8</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">44983</identifier><identifier type="BookID">3540610553</identifier><identifier type="BookChapterCount">25</identifier><identifier type="BookVolumeNumber">1058</identifier><part><date>1996</date><detail type="volume"><number>1058</number><caption>vol.</caption></detail><extent unit="pages"><start>326</start><end>340</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1996</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1996</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1996</recordOrigin></recordInfo></relatedItem><identifier type="istex">795351154C8A996243C163A93C5232FB45505B2E</identifier><identifier type="DOI">10.1007/3-540-61055-3_46</identifier><identifier type="ChapterID">21</identifier><identifier type="ChapterID">Chap21</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1996</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1996</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001113 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001113 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:795351154C8A996243C163A93C5232FB45505B2E
|texte= Integer constraints to stop deforestation
}}
| This area was generated with Dilib version V0.6.31. |  |