{"id":"https://openalex.org/W2161139886","doi":"https://doi.org/10.1017/s0956796800001957","title":"\u03c0-RED <sup>+</sup> An interactive compiling graph reduction system for an applied \u03bb-calculus","display_name":"\u03c0-RED <sup>+</sup> An interactive compiling graph reduction system for an applied \u03bb-calculus","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2161139886","doi":"https://doi.org/10.1017/s0956796800001957","mag":"2161139886"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800001957","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800001957","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/62EC6AD594AB3E2892594304C5F9B032/S0956796800001957a.pdf/div-class-title-red-span-class-sup-span-an-interactive-compiling-graph-reduction-system-for-an-applied-calculus-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/62EC6AD594AB3E2892594304C5F9B032/S0956796800001957a.pdf/div-class-title-red-span-class-sup-span-an-interactive-compiling-graph-reduction-system-for-an-applied-calculus-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025617927","display_name":"Dietmar G\u00e4rtner","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dietmar G\u00e4rtner","raw_affiliation_strings":["Christian-Albrechts-Universit\u00e4t Kiel, Institut f\u00fcr Informatik, D-24105 Kiel, Germany e-mail:","Christian-Albrechts-Umversitat Kiel, Institut fur Informatik, D-24105 Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Christian-Albrechts-Universit\u00e4t Kiel, Institut f\u00fcr Informatik, D-24105 Kiel, Germany e-mail:","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Christian-Albrechts-Umversitat Kiel, Institut fur Informatik, D-24105 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016541241","display_name":"Werner Kluge","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Werner E. Kluge","raw_affiliation_strings":["Christian-Albrechts-Universit\u00e4t Kiel, Institut f\u00fcr Informatik, D-24105 Kiel, Germany e-mail:","Christian-Albrechts-Umversitat Kiel, Institut fur Informatik, D-24105 Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Christian-Albrechts-Universit\u00e4t Kiel, Institut f\u00fcr Informatik, D-24105 Kiel, Germany e-mail:","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Christian-Albrechts-Umversitat Kiel, Institut fur Informatik, D-24105 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025617927"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":0.5693,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78298471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"5","first_page":"723","last_page":"756"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.888088583946228},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7599872350692749},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.6888781785964966},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.651223361492157},{"id":"https://openalex.org/keywords/interpreter","display_name":"Interpreter","score":0.6189985871315002},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4675784409046173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45779189467430115},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.43112826347351074},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.4292139410972595},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39479461312294006},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1247948408126831},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0770639181137085}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.888088583946228},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7599872350692749},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.6888781785964966},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.651223361492157},{"id":"https://openalex.org/C122783720","wikidata":"https://www.wikidata.org/wiki/Q183065","display_name":"Interpreter","level":2,"score":0.6189985871315002},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4675784409046173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45779189467430115},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.43112826347351074},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.4292139410972595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39479461312294006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1247948408126831},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0770639181137085},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796800001957","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800001957","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/62EC6AD594AB3E2892594304C5F9B032/S0956796800001957a.pdf/div-class-title-red-span-class-sup-span-an-interactive-compiling-graph-reduction-system-for-an-applied-calculus-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796800001957","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800001957","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/62EC6AD594AB3E2892594304C5F9B032/S0956796800001957a.pdf/div-class-title-red-span-class-sup-span-an-interactive-compiling-graph-reduction-system-for-an-applied-calculus-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2161139886.pdf","grobid_xml":"https://content.openalex.org/works/W2161139886.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1520096901","https://openalex.org/W1524744826","https://openalex.org/W1543641760","https://openalex.org/W1963658586","https://openalex.org/W1973312452","https://openalex.org/W2012344170","https://openalex.org/W2055914218","https://openalex.org/W2062950667","https://openalex.org/W2063068243","https://openalex.org/W2070912653","https://openalex.org/W2071457257","https://openalex.org/W2072844328","https://openalex.org/W2085014646","https://openalex.org/W2090587238","https://openalex.org/W2095621310","https://openalex.org/W2118172707","https://openalex.org/W2172307690","https://openalex.org/W2568721247"],"related_works":["https://openalex.org/W1590035422","https://openalex.org/W1550884307","https://openalex.org/W2807591226","https://openalex.org/W1539259174","https://openalex.org/W1603503062","https://openalex.org/W1975521203","https://openalex.org/W1603781856","https://openalex.org/W2531895878","https://openalex.org/W1567436608","https://openalex.org/W1523094859"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"describes":[3],"a":[4,15],"compiling":[5],"graph":[6],"reduction":[7,12],"system":[8,51],"which":[9,85],"realizes":[10],"the":[11,50],"semantics":[13],"of":[14,27,79,91,110],"fully-fledged":[16],"applied":[17],"\u03bb-calculus.":[18],"High-level":[19],"functional":[20],"programs":[21,42],"are":[22,113],"conceptually":[23],"executed":[24],"as":[25,87],"sequences":[26],"program":[28,55],"transformations":[29],"governed":[30],"by":[31,77],"full":[32],"\u03b2-reductions.":[33],"They":[34],"may":[35,43],"be":[36,44,131],"carried":[37],"out":[38],"step-by-step,":[39],"and":[40,59,67,106,123],"intermediate":[41,89],"displayed":[45],"in":[46],"high-level":[47,57],"notation,":[48],"rendering":[49],"suitable":[52],"for":[53,61,72,98],"interactive":[54],"design,":[56],"debugging,":[58],"also":[60],"teaching":[62],"basic":[63],"programming":[64],"language":[65,68],"concepts":[66],"interpretation.":[69],"Run-time":[70],"efficiency":[71],"production":[73],"runs":[74],"is":[75],"achieved":[76],"means":[78],"an":[80,88,120],"abstract":[81],"stack":[82],"machine":[83],"ASM":[84,118],"serves":[86],"level":[90],"code":[92],"generation.":[93],"It":[94],"employs":[95],"multiple":[96],"stacks":[97],"reasonably":[99],"fast":[100],"function":[101,136],"calls,":[102],"optimized":[103],"tail-end":[104],"recursions,":[105],"earliest":[107],"possible":[108],"releases":[109],"subgraphs":[111],"that":[112],"no":[114],"longer":[115],"needed.":[116],"The":[117],"involves":[119],"interpreter":[121],"if":[122,125],"only":[124],"potential":[126],"naming":[127],"conflicts":[128],"need":[129],"to":[130],"resolved":[132],"when":[133],"reducing":[134],"partial":[135],"applications.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-23T06:14:38.165362","created_date":"2025-10-10T00:00:00"}