Efficient λ-Evaluation with Interaction Nets
This paper presents an efficient implementation of the λ-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as w...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 169 |
|---|---|
| container_issue | |
| container_start_page | 155 |
| container_title | |
| container_volume | 3091 |
| creator | Mackie, Ian |
| description | This paper presents an efficient implementation of the λ-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as well as other approaches. We conclude the paper with extensive testing to demonstrate the capabilities of this evaluator. |
| doi_str_mv | 10.1007/978-3-540-25979-4_11 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15851910</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3088015_17_164</sourcerecordid><originalsourceid>FETCH-LOGICAL-c323t-a5ca812e321e1ade6e6ae534111ad8d59edc07a85dce029f859fb645f28e6b513</originalsourceid><addsrcrecordid>eNotkE1OwzAQRs2vCKU3YNENS4PHYyf2ElUBKlWwgbXlOg4NhKTEKYizcQfOhJN2Nta8b2YkP0IugV0DY9mNzhRFKgWjXOpMU2EADsg0YoxwZOKQJJACUEShj8j5GHCQyI5JwpBxqjOBpyTRMVcDOCPTEN5YLI6ZSmVCaF6Wlat808_-fmn-Zeut7au2mX1X_Xq2aHrfWTeCR9-HC3JS2jr46f6dkJe7_Hn-QJdP94v57ZI65NhTK51VwD1y8GALn_rUeokCIHaqkNoXjmVWycJ5xnWppC5XqZAlVz5dScAJudrd3djgbF12tnFVMJuu-rDdjwGpJGhgcY7v5kKMmlffmVXbvgcDzAwSTbRl0EQtZhRmBolxCffHu_Zz60Nv_LDlooPO1m5tN_HTwSBTioE0kBlIBf4DTcxvUw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3088015_17_164</pqid></control><display><type>book_chapter</type><title>Efficient λ-Evaluation with Interaction Nets</title><source>Springer Books</source><creator>Mackie, Ian</creator><contributor>Oostrom, Vincent van</contributor><creatorcontrib>Mackie, Ian ; Oostrom, Vincent van</creatorcontrib><description>This paper presents an efficient implementation of the λ-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as well as other approaches. We conclude the paper with extensive testing to demonstrate the capabilities of this evaluator.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540221530</identifier><identifier>ISBN: 9783540221531</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540259794</identifier><identifier>EISBN: 3540259791</identifier><identifier>DOI: 10.1007/978-3-540-25979-4_11</identifier><identifier>OCLC: 934980302</identifier><identifier>LCCallNum: QA267-268.5</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Free Edge ; Free Variable ; Garbage Collection ; Linear Logic ; Normal Form ; Programming theory ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2004, Vol.3091, p.155-169</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c323t-a5ca812e321e1ade6e6ae534111ad8d59edc07a85dce029f859fb645f28e6b513</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3088015-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-25979-4_11$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-25979-4_11$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15851910$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Oostrom, Vincent van</contributor><creatorcontrib>Mackie, Ian</creatorcontrib><title>Efficient λ-Evaluation with Interaction Nets</title><title>Lecture notes in computer science</title><description>This paper presents an efficient implementation of the λ-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as well as other approaches. We conclude the paper with extensive testing to demonstrate the capabilities of this evaluator.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Free Edge</subject><subject>Free Variable</subject><subject>Garbage Collection</subject><subject>Linear Logic</subject><subject>Normal Form</subject><subject>Programming theory</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540221530</isbn><isbn>9783540221531</isbn><isbn>9783540259794</isbn><isbn>3540259791</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkE1OwzAQRs2vCKU3YNENS4PHYyf2ElUBKlWwgbXlOg4NhKTEKYizcQfOhJN2Nta8b2YkP0IugV0DY9mNzhRFKgWjXOpMU2EADsg0YoxwZOKQJJACUEShj8j5GHCQyI5JwpBxqjOBpyTRMVcDOCPTEN5YLI6ZSmVCaF6Wlat808_-fmn-Zeut7au2mX1X_Xq2aHrfWTeCR9-HC3JS2jr46f6dkJe7_Hn-QJdP94v57ZI65NhTK51VwD1y8GALn_rUeokCIHaqkNoXjmVWycJ5xnWppC5XqZAlVz5dScAJudrd3djgbF12tnFVMJuu-rDdjwGpJGhgcY7v5kKMmlffmVXbvgcDzAwSTbRl0EQtZhRmBolxCffHu_Zz60Nv_LDlooPO1m5tN_HTwSBTioE0kBlIBf4DTcxvUw</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Mackie, Ian</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Efficient λ-Evaluation with Interaction Nets</title><author>Mackie, Ian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c323t-a5ca812e321e1ade6e6ae534111ad8d59edc07a85dce029f859fb645f28e6b513</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Free Edge</topic><topic>Free Variable</topic><topic>Garbage Collection</topic><topic>Linear Logic</topic><topic>Normal Form</topic><topic>Programming theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mackie, Ian</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mackie, Ian</au><au>Oostrom, Vincent van</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Efficient λ-Evaluation with Interaction Nets</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><volume>3091</volume><spage>155</spage><epage>169</epage><pages>155-169</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540221530</isbn><isbn>9783540221531</isbn><eisbn>9783540259794</eisbn><eisbn>3540259791</eisbn><abstract>This paper presents an efficient implementation of the λ-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as well as other approaches. We conclude the paper with extensive testing to demonstrate the capabilities of this evaluator.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-25979-4_11</doi><oclcid>934980302</oclcid><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2004, Vol.3091, p.155-169 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15851910 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Free Edge Free Variable Garbage Collection Linear Logic Normal Form Programming theory Theoretical computing |
| title | Efficient λ-Evaluation with Interaction Nets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T00%3A50%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Efficient%20%CE%BB-Evaluation%20with%20Interaction%20Nets&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Mackie,%20Ian&rft.date=2004&rft.volume=3091&rft.spage=155&rft.epage=169&rft.pages=155-169&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540221530&rft.isbn_list=9783540221531&rft_id=info:doi/10.1007/978-3-540-25979-4_11&rft_dat=%3Cproquest_pasca%3EEBC3088015_17_164%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540259794&rft.eisbn_list=3540259791&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3088015_17_164&rft_id=info:pmid/&rfr_iscdi=true |