{"id":"https://openalex.org/W2401954397","doi":"https://doi.org/10.1017/s0956796800000356","title":"<i>Theoretical Pearls</i> Enumerators of lambda terms are reducing","display_name":"<i>Theoretical Pearls</i> Enumerators of lambda terms are reducing","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W2401954397","doi":"https://doi.org/10.1017/s0956796800000356","mag":"2401954397"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800000356","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000356","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F3145D4DE8AD9734951632E985EAF908/S0956796800000356a.pdf/div-class-title-span-class-italic-theoretical-pearls-span-enumerators-of-lambda-terms-are-reducing-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/F3145D4DE8AD9734951632E985EAF908/S0956796800000356a.pdf/div-class-title-span-class-italic-theoretical-pearls-span-enumerators-of-lambda-terms-are-reducing-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016150987","display_name":"Henk Barendregt","orcid":"https://orcid.org/0000-0002-3735-4078"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Henk Barendregt","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Catholic University of Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Catholic University of Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016150987"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":0.9602,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78070385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"2","first_page":"233","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.957099974155426,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.957099974155426,"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.9569000005722046,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9096999764442444,"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/recursion","display_name":"Recursion (computer science)","score":0.7059271931648254},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.696160078048706},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.6292570233345032},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6202631592750549},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5300682783126831},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4322454631328583},{"id":"https://openalex.org/keywords/natural","display_name":"Natural (archaeology)","score":0.42310672998428345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40930473804473877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26039886474609375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2535122036933899},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1682198941707611},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1597541868686676},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.09013834595680237}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7059271931648254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.696160078048706},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.6292570233345032},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6202631592750549},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5300682783126831},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4322454631328583},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.42310672998428345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40930473804473877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26039886474609375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2535122036933899},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1682198941707611},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1597541868686676},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.09013834595680237},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796800000356","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000356","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F3145D4DE8AD9734951632E985EAF908/S0956796800000356a.pdf/div-class-title-span-class-italic-theoretical-pearls-span-enumerators-of-lambda-terms-are-reducing-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/s0956796800000356","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000356","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F3145D4DE8AD9734951632E985EAF908/S0956796800000356a.pdf/div-class-title-span-class-italic-theoretical-pearls-span-enumerators-of-lambda-terms-are-reducing-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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2401954397.pdf","grobid_xml":"https://content.openalex.org/works/W2401954397.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W28925417","https://openalex.org/W1510393421","https://openalex.org/W1964062928","https://openalex.org/W3046776945","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1976679120","https://openalex.org/W2951695430","https://openalex.org/W2377519369","https://openalex.org/W3202311233","https://openalex.org/W4281614748","https://openalex.org/W32024214","https://openalex.org/W2765883196","https://openalex.org/W2359098868","https://openalex.org/W4388322088","https://openalex.org/W2130486673"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"closed":[2,17],"\u03bb-term":[3],"E":[4,43],"is":[5,13,19,44,63],"called":[6,45],"an":[7,42],"enumerator":[8,62],"if":[9],"Here":[10],"\u22c0":[11],"0":[12],"the":[14,20,26,31],"set":[15,21],"of":[16,22],"\u03bb-terms,.":[18],"natural":[23],"numbers":[24],"and":[25],"\u231c":[27],"n":[28,38],"\u231d":[29],"are":[30],"Church's":[32],"numerals":[33],"\u03bb":[34],"fx":[35],".":[36,40],"f":[37],"x":[39],"Such":[41],"reducing":[46],"if,":[47],"moreover":[48],"An":[49],"ingenious":[50],"recursion":[51],"theoretic":[52],"proof":[53],"by":[54],"Statman":[55],"will":[56],"be":[57],"presented,":[58],"showing":[59],"that":[60],"every":[61],"reducing.":[64],"I":[65],"do":[66],"not":[67],"know":[68],"any":[69],"direct":[70],"proof.":[71]},"counts_by_year":[],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}
