{"id":"https://openalex.org/W7165687873","doi":"https://doi.org/10.48550/arxiv.2606.22908","title":"Cyclic Graphs and Memoization in Pure $\u03bb$-Calculus","display_name":"Cyclic Graphs and Memoization in Pure $\u03bb$-Calculus","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165687873","doi":"https://doi.org/10.48550/arxiv.2606.22908"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.22908","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22908","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.22908","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122931632","display_name":"B Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yang, Bo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5122931632"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8615000247955322,"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.8615000247955322,"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.06960000097751617,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.030799999833106995,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/memoization","display_name":"Memoization","score":0.8482000231742859},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6956999897956848},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5764999985694885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4620000123977661},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.43869999051094055},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4302999973297119},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.426800012588501},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.39430001378059387},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.3937999904155731}],"concepts":[{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.8482000231742859},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6956999897956848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.675599992275238},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5764999985694885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4620000123977661},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45579999685287476},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.43869999051094055},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4277999997138977},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.426800012588501},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.39430001378059387},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3937999904155731},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.3702000081539154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36410000920295715},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C88977235","wikidata":"https://www.wikidata.org/wiki/Q787114","display_name":"Abstract machine","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26489999890327454},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C2781020372","wikidata":"https://www.wikidata.org/wiki/Q533093","display_name":"On the fly","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.22908","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22908","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.22908","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22908","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Purely":[0],"functional":[1],"programming":[2,153],"makes":[3],"immutability":[4],"and":[5,15,30,33,52,131,136,164,214,221,230],"non-strict":[6],"evaluation":[7],"its":[8,251],"defaults;":[9],"we":[10,244],"push":[11],"further,":[12],"making":[13],"interning":[14],"memoization":[16,160],"the":[17,26,54,77,95,127,132,187,194,202,208,215],"defaults":[18],"of":[19,57,138,205,211,218,232],"computation.":[20],"In":[21],"prior":[22],"operational":[23,92,144],"semantics":[24,93,145],"for":[25,49,80,94,181,199],"pure":[27,96,257],"$\u03bb$-calculus,":[28],"representing":[29],"transforming":[31],"cyclic":[32,166],"infinite":[34],"data":[35],"requires":[36,63],"an":[37,64,176],"added":[38,170],"recursion":[39,171],"construct,":[40],"a":[41,43,46,58,82,90,122,147,191,197,246,256],"$\\texttt{letrec}$,":[42],"$\u03bc$-binder,":[44],"or":[45,60],"built-in":[47],"$Y$":[48],"graph":[50,133,200],"reduction,":[51],"sharing":[53,155],"repeated":[55,156],"work":[56],"memoized":[59],"dynamic-programming":[61],"function":[62],"impure":[65],"cache.":[66],"We":[67,74,141],"show":[68],"that":[69,98,107,249],"no":[70,159,169],"extension":[71],"is":[72,134,190,234,239],"needed.":[73],"apply":[75],"tabling,":[76],"standard":[78,102],"method":[79],"solving":[81],"least-fixpoint":[83],"equation,":[84],"to":[85],"weak-head":[86],"reduction;":[87],"this":[88,143],"defines":[89],"new":[91],"$\u03bb$-calculus":[97,148,195],"keeps":[99],"each":[100,113],"term's":[101],"lazy":[103],"meaning.":[104],"A":[105],"term":[106],"reaches":[108],"finitely":[109,116],"many":[110,117],"distinct":[111],"states,":[112],"solved":[114],"in":[115,183],"steps,":[118],"comes":[119],"out":[120],"as":[121,146,255],"finite":[123,184],"graph,":[124,192],"possibly":[125],"cyclic;":[126],"calculus":[128],"stays":[129],"pure,":[130],"sound":[135],"independent":[137],"reduction":[139],"order.":[140],"implemented":[142],"interpreter.":[149],"It":[150,162],"does":[151],"dynamic":[152,206],"automatically,":[154],"subproblems":[157],"with":[158,168],"table.":[161],"creates":[163],"transforms":[165],"graphs":[167],"construct.":[172],"And":[173],"it":[174],"decides":[175],"unproductive":[177],"loop,":[178],"returning":[179],"$\\bot$":[180],"$\u03a9$":[182],"time.":[185],"What":[186],"evaluator":[188],"returns":[189],"so":[193],"becomes":[196],"DSL":[198],"computation:":[201],"memo":[203],"table":[204,210,217],"programming,":[207],"transposition":[209],"game":[212],"search,":[213],"derived-fact":[216],"Datalog":[219],"reachability":[220],"points-to":[222],"analysis":[223],"are":[224],"all":[225,254],"tabling":[226],"on":[227],"state":[228],"identity,":[229],"none":[231],"them":[233],"written":[235],"by":[236],"hand.":[237],"Compilation":[238],"one":[240],"more":[241],"such":[242],"problem:":[243],"write":[245],"bootstrap":[247],"compiler":[248],"compiles":[250],"own":[252],"source,":[253],"$\u03bb$-term.":[258]},"counts_by_year":[],"updated_date":"2026-07-08T06:17:01.165560","created_date":"2026-06-24T00:00:00"}