{"id":"https://openalex.org/W2031262568","doi":"https://doi.org/10.1007/s10990-012-9083-6","title":"Path resolution for nested recursive modules","display_name":"Path resolution for nested recursive modules","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2031262568","doi":"https://doi.org/10.1007/s10990-012-9083-6","mag":"2031262568"},"language":"en","primary_location":{"id":"doi:10.1007/s10990-012-9083-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10990-012-9083-6","pdf_url":null,"source":{"id":"https://openalex.org/S4210228303","display_name":"LISP and Symbolic Computation","issn_l":"0892-4635","issn":["0892-4635","1573-0557"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Higher-Order and Symbolic Computation","raw_type":"journal-article"},"type":"article","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/A5089640715","display_name":"Jacques Garrigue","orcid":"https://orcid.org/0000-0001-8056-5519"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Jacques Garrigue","raw_affiliation_strings":["Graduate School of Mathematics, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Mathematics, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109028962","display_name":"Keiko Nakata","orcid":null},"institutions":[{"id":"https://openalex.org/I111112146","display_name":"Tallinn University of Technology","ror":"https://ror.org/0443cwa12","country_code":"EE","type":"education","lineage":["https://openalex.org/I111112146"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Keiko Nakata","raw_affiliation_strings":["Institute of Cybernetics, Tallinn Univ. of Technology, Tallinn, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Cybernetics, Tallinn Univ. of Technology, Tallinn, Estonia","institution_ids":["https://openalex.org/I111112146"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089640715"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"fwci":1.3207,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.83948393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"3","first_page":"207","last_page":"237"},"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.9961000084877014,"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.9944999814033508,"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/undecidable-problem","display_name":"Undecidable problem","score":0.7490721344947815},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6703474521636963},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.6538969874382019},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5998031497001648},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5263786911964417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5085195302963257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46880820393562317},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.42170485854148865},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.4194003939628601},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3191562294960022},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30664098262786865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2803919315338135}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7490721344947815},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6703474521636963},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.6538969874382019},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5998031497001648},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5263786911964417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5085195302963257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46880820393562317},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.42170485854148865},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.4194003939628601},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3191562294960022},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30664098262786865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2803919315338135}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10990-012-9083-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10990-012-9083-6","pdf_url":null,"source":{"id":"https://openalex.org/S4210228303","display_name":"LISP and Symbolic Computation","issn_l":"0892-4635","issn":["0892-4635","1573-0557"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Higher-Order and Symbolic Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.4830","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.4830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.ioc.ee/%7Ekeiko/papers/Path10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.3166","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.ioc.ee/~keiko/papers/hosc12.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":34,"referenced_works":["https://openalex.org/W124103463","https://openalex.org/W197885067","https://openalex.org/W1546727036","https://openalex.org/W1567587382","https://openalex.org/W1577182889","https://openalex.org/W1591274473","https://openalex.org/W1593771739","https://openalex.org/W1642499364","https://openalex.org/W1720741243","https://openalex.org/W1829244603","https://openalex.org/W1970031091","https://openalex.org/W2002089154","https://openalex.org/W2022683189","https://openalex.org/W2053070172","https://openalex.org/W2070880808","https://openalex.org/W2078944436","https://openalex.org/W2101005398","https://openalex.org/W2102976859","https://openalex.org/W2109893633","https://openalex.org/W2120047901","https://openalex.org/W2122204385","https://openalex.org/W2127600624","https://openalex.org/W2133171398","https://openalex.org/W2133639043","https://openalex.org/W2135785452","https://openalex.org/W2140764366","https://openalex.org/W2164520529","https://openalex.org/W2166715995","https://openalex.org/W2167017930","https://openalex.org/W2724463085","https://openalex.org/W2914260883","https://openalex.org/W4233881619","https://openalex.org/W4256573185","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2170336571","https://openalex.org/W2020140696"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}