{"doi":"10.1145/1291151.1291165","title":"Termination analysis and call graph construction for higher-order functional programs","abstract":null,"journal":"Proceedings of the 12th ACM SIGPLAN international conference on Functional programming","year":2007,"id":28362,"datarank":1.5272366547952756,"base_score":3.1354942159291497,"endowment":3.1354942159291497,"self_citation_contribution":0.47032413238937254,"citation_network_contribution":1.056912522405903,"self_endowment_contribution":0.47032413238937254,"citer_contribution":1.056912522405903,"corpus_percentile":null,"corpus_rank":null,"citation_count":22,"citer_count":22,"citers_with_citation_signal":21,"citers_with_endowment":21,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":159107,"name":"Damien Sereni","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.1354942159291497,"endowment":3.1354942159291497,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W1972318755","authors":[],"funders":[],"total_grants":0,"fwci":5.1628,"citation_percentile":0.95127423,"influential_citations":2,"citation_trend":[{"year":2012,"count":9},{"year":2014,"count":1}],"oa_status":"closed","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/10.1145/1291151.1291165","host_type":"publisher"},{"url":"https://dl.acm.org/doi/pdf/10.1145/1291151.1291165","host_type":"publisher"},{"url":"https://doi.org/10.1145/1291151.1291165","host_type":""}],"fields_of_study":["Logic, programming, and type systems","Formal Methods in Verification","Software Testing and Debugging Techniques","Computer Science"],"mesh_terms":[],"keywords":["Computer science","Call graph","Control flow graph","Control flow analysis","Program analysis","Control flow","Graph","Functional programming","Graph theory","Theoretical computer science","Programming language","Data-flow analysis","Power graph analysis","Order (exchange)","Data flow diagram","Mathematics","Declarative programming","Database"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Reduced inequalities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T21:20:38.904660Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}