{"id":"https://openalex.org/W2161021500","doi":"https://doi.org/10.1145/1599410.1599424","title":"Making induction manifest in modular ACL2","display_name":"Making induction manifest in modular ACL2","publication_year":2009,"publication_date":"2009-09-07","ids":{"openalex":"https://openalex.org/W2161021500","doi":"https://doi.org/10.1145/1599410.1599424","mag":"2161021500"},"language":"en","primary_location":{"id":"doi:10.1145/1599410.1599424","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1599410.1599424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014511753","display_name":"Carl Eastlund","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carl Eastlund","raw_affiliation_strings":["Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000905628","display_name":"Matthias Felleisen","orcid":"https://orcid.org/0000-0001-6678-1004"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthias Felleisen","raw_affiliation_strings":["Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.2437,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.53589416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"116"},"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.9997000098228455,"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.9997000098228455,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9955999851226807,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.819368302822113},{"id":"https://openalex.org/keywords/lisp","display_name":"Lisp","score":0.7989119291305542},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7898061275482178},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7041196227073669},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.684466540813446},{"id":"https://openalex.org/keywords/common-lisp","display_name":"Common Lisp","score":0.5018131732940674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38419508934020996},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3442382514476776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1092364490032196}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.819368302822113},{"id":"https://openalex.org/C190883126","wikidata":"https://www.wikidata.org/wiki/Q132874","display_name":"Lisp","level":2,"score":0.7989119291305542},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7898061275482178},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7041196227073669},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.684466540813446},{"id":"https://openalex.org/C2779353305","wikidata":"https://www.wikidata.org/wiki/Q849146","display_name":"Common Lisp","level":3,"score":0.5018131732940674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38419508934020996},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3442382514476776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1092364490032196},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1599410.1599424","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1599410.1599424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.8229","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.8229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccs.neu.edu/scheme/pubs/ppdp09-ef.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.541.4279","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.541.4279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccs.neu.edu/home/cce/acl2/ppdp2009-ef.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1272897","https://openalex.org/W16737933","https://openalex.org/W1540433311","https://openalex.org/W1558797637","https://openalex.org/W1560253649","https://openalex.org/W1579218062","https://openalex.org/W1588366745","https://openalex.org/W1597068544","https://openalex.org/W1829244603","https://openalex.org/W1964976408","https://openalex.org/W2015077407","https://openalex.org/W2017441562","https://openalex.org/W2043261859","https://openalex.org/W2048569219","https://openalex.org/W2055806388","https://openalex.org/W2093415968","https://openalex.org/W2100562635","https://openalex.org/W2101005398","https://openalex.org/W2109943281","https://openalex.org/W2112857708","https://openalex.org/W2113547509","https://openalex.org/W2130303109","https://openalex.org/W2137810559","https://openalex.org/W2145945984","https://openalex.org/W2154753152","https://openalex.org/W4234632609","https://openalex.org/W4256573185"],"related_works":["https://openalex.org/W638884614","https://openalex.org/W2607262752","https://openalex.org/W1465358289","https://openalex.org/W4293423273","https://openalex.org/W1840675755","https://openalex.org/W1548358088","https://openalex.org/W1978806596","https://openalex.org/W64118877","https://openalex.org/W4236563764","https://openalex.org/W4244890543"],"abstract_inverted_index":{"ACL2,":[0],"a":[1,21,41,48],"Common":[2],"Lisp-based":[3],"language":[4,17],"for":[5],"programming":[6],"and":[7,33,36],"theorem":[8],"proving,":[9],"has":[10],"enjoyed":[11],"industrial":[12],"success":[13],"despite":[14],"lacking":[15],"modern":[16],"features":[18],"such":[19],"as":[20],"module":[22],"system.":[23],"In":[24],"previous":[25],"work,":[26],"we":[27],"equipped":[28],"ACL2":[29],"with":[30,40,66],"modules,":[31],"interfaces,":[32],"explicit":[34],"linking":[35],"measured":[37],"our":[38],"system":[39],"series":[42],"of":[43,51,69],"experiments.":[44],"One":[45],"experiment":[46],"revealed":[47],"serious":[49],"lack":[50],"expressivity;":[52],"the":[53,57],"interfaces":[54],"cannot":[55],"describe":[56],"induction":[58],"schemes":[59],"necessary":[60],"to":[61],"reason":[62],"about":[63],"exported":[64],"functions":[65],"nontrivial":[67],"patterns":[68],"recursion.":[70]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}