{"id":"https://openalex.org/W2953374554","doi":"https://doi.org/10.2168/lmcs-4(1:3)2008","title":"Call-by-value Termination in the Untyped lambda-calculus","display_name":"Call-by-value Termination in the Untyped lambda-calculus","publication_year":2008,"publication_date":"2008-03-17","ids":{"openalex":"https://openalex.org/W2953374554","doi":"https://doi.org/10.2168/lmcs-4(1:3)2008","mag":"2953374554"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(1:3)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(1:3)2008","pdf_url":"https://lmcs.episciences.org/915/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/915/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103363705","display_name":"Neil D. Jones","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Neil D. Jones","raw_affiliation_strings":["DIKU, University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"DIKU, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090772974","display_name":"Nina Bohr","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Nina Bohr","raw_affiliation_strings":["IT-University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"IT-University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103363705"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":2.9523,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92238085,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 4, Issue 1","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.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.9915000200271606,"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.9912999868392944,"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/normalization-property","display_name":"Normalization property","score":0.6385108828544617},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5742121934890747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5564285516738892},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.5470895767211914},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4962461590766907},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4793189764022827},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47931233048439026},{"id":"https://openalex.org/keywords/church-encoding","display_name":"Church encoding","score":0.4768865406513214},{"id":"https://openalex.org/keywords/simply-typed-lambda-calculus","display_name":"Simply typed lambda calculus","score":0.46692368388175964},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.45305460691452026},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.45247402787208557},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.45246222615242004},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44248828291893005},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.4212806820869446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3837008476257324},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38255810737609863},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33480140566825867},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28528058528900146}],"concepts":[{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.6385108828544617},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5742121934890747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5564285516738892},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.5470895767211914},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4962461590766907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4793189764022827},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47931233048439026},{"id":"https://openalex.org/C77736955","wikidata":"https://www.wikidata.org/wiki/Q1089708","display_name":"Church encoding","level":5,"score":0.4768865406513214},{"id":"https://openalex.org/C61237538","wikidata":"https://www.wikidata.org/wiki/Q855192","display_name":"Simply typed lambda calculus","level":4,"score":0.46692368388175964},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.45305460691452026},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.45247402787208557},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.45246222615242004},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44248828291893005},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.4212806820869446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3837008476257324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38255810737609863},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33480140566825867},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28528058528900146},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-4(1:3)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(1:3)2008","pdf_url":"https://lmcs.episciences.org/915/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0801.0882","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0801.0882","pdf_url":"https://arxiv.org/pdf/0801.0882","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:72f4d467e75848f2ad4885a01a9bc228","is_oa":true,"landing_page_url":"https://doaj.org/article/72f4d467e75848f2ad4885a01a9bc228","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 1 (2008)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/43ebd730-a9f7-11df-928f-000ea68e967b","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/43ebd730-a9f7-11df-928f-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jones , N D & Bohr , N 2008 , ' Call-by-value Termination in the Untyped \u03bb-calculus ' , Logical Methods in Computer Science , vol. 1 , no. 3 , pp. 1-39 . https://doi.org/10.2168/LMCS-4(1:3)2008","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(1:3)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(1:3)2008","pdf_url":"https://lmcs.episciences.org/915/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2953374554.pdf","grobid_xml":"https://content.openalex.org/works/W2953374554.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W159715351","https://openalex.org/W1508261706","https://openalex.org/W1539550612","https://openalex.org/W1568506451","https://openalex.org/W1593279918","https://openalex.org/W1599217540","https://openalex.org/W1993129359","https://openalex.org/W2043100293","https://openalex.org/W2071990711","https://openalex.org/W2088735483","https://openalex.org/W2090855107","https://openalex.org/W2097944031","https://openalex.org/W2104860831","https://openalex.org/W2144538202","https://openalex.org/W2148387264","https://openalex.org/W2162592943","https://openalex.org/W2168393711","https://openalex.org/W2169324606","https://openalex.org/W2174627168","https://openalex.org/W2949171851","https://openalex.org/W4245147400","https://openalex.org/W4256023041","https://openalex.org/W6606522490","https://openalex.org/W6682317381"],"related_works":["https://openalex.org/W2761902706","https://openalex.org/W2036107204","https://openalex.org/W1585482631","https://openalex.org/W2027907817","https://openalex.org/W1135000581","https://openalex.org/W2803077385","https://openalex.org/W1592479913","https://openalex.org/W2388108828","https://openalex.org/W1571094673","https://openalex.org/W1482545727"],"abstract_inverted_index":{"A":[0],"fully-automated":[1],"algorithm":[2,83,100,125],"is":[3,26,72,84,101,126],"developed":[4],"able":[5],"to":[6,28,39,51,78],"show":[7,40,52],"that":[8,97],"evaluation":[9],"of":[10,43,55,58,62,122,158,171],"a":[11,44,59,66,73,168],"given":[12],"untyped":[13,30],"lambda-expression":[14],"will":[15],"terminate":[16,109],"under":[17,110],"CBV":[18,41,53,111],"(call-by-value).":[19],"The":[20,35,48,82,92,119],"``size-change":[21],"principle''":[22],"from":[23],"first-order":[24],"programs":[25,141],"extended":[27],"arbitrary":[29,79],"lambda-expressions":[31,105],"in":[32,89,107],"two":[33],"steps.":[34],"first":[36],"step":[37],"suffices":[38,50],"termination":[42,54,124],"single,":[45],"stand-alone":[46],"lambda;-expression.":[47],"second":[49],"any":[56,98],"member":[57],"regular":[60],"set":[61],"lambda-expressions,":[63],"defined":[64],"by":[65],"tree":[67],"grammar.":[68],"(A":[69],"simple":[70],"example":[71],"minimum":[74],"function,":[75],"when":[76],"applied":[77],"Church":[80],"numerals.)":[81],"sound":[85,99],"and":[86,135,145,148,162],"proven":[87],"so":[88,163],"this":[90],"paper.":[91],"Halting":[93],"Problem's":[94],"undecidability":[95],"implies":[96],"necessarily":[102],"incomplete:":[103],"some":[104],"may":[106],"fact":[108],"evaluation,":[112],"but":[113],"not":[114],"be":[115],"recognised":[116],"as":[117,131,166],"terminating.":[118],"intensional":[120],"power":[121],"the":[123,159],"reasonably":[127],"high.":[128],"It":[129],"certifies":[130],"terminating":[132,167],"many":[133],"interesting":[134],"useful":[136],"general":[137],"recursive":[138],"algorithms":[139],"including":[140],"with":[142],"mutual":[143],"recursion":[144],"parameter":[146],"exchanges,":[147],"Colson's":[149],"``minimum''":[150],"algorithm.":[151],"Further,":[152],"our":[153],"type-free":[154],"approach":[155],"allows":[156],"use":[157],"Y":[160],"combinator,":[161],"can":[164],"identify":[165],"substantial":[169],"subset":[170],"PCF.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2021-02-01T00:00:00"}