{"id":"https://openalex.org/W1543596436","doi":null,"title":"Higher Order Imperative Programming","display_name":"Higher Order Imperative Programming","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1543596436","mag":"1543596436"},"language":"en","primary_location":{"id":"mag:1543596436","doi":null,"is_oa":false,"landing_page_url":"http://stepanovpapers.com/hop.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1543596436"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5044239463","display_name":"Aaron Kershenbaum","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Aaron Kershenbaum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046039594","display_name":"David R. Musser","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"David R. Musser","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032603490","display_name":"Alexander A. Stepanov","orcid":"https://orcid.org/0000-0002-9113-9440","observed_orcids":["https://orcid.org/0000-0002-9113-9440"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Alexander A. Stepanov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0332,"has_fulltext":false,"cited_by_count":12,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.91334391,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10533","display_name":"Teaching and Learning Programming","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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.00019999999494757503,"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/higher-order-programming","display_name":"higher-order programming","score":0.925000011920929},{"id":"https://openalex.org/keywords/imperative-programming","display_name":"imperative programming","score":0.8920000195503235},{"id":"https://openalex.org/keywords/operators","display_name":"operators","score":0.5920000076293945},{"id":"https://openalex.org/keywords/iterators","display_name":"iterators","score":0.9950000047683716},{"id":"https://openalex.org/keywords/accumulation","display_name":"accumulation","score":0.9919999837875366},{"id":"https://openalex.org/keywords/reduction","display_name":"reduction","score":0.9950000047683716},{"id":"https://openalex.org/keywords/parallel-reduction","display_name":"parallel reduction","score":1.0},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.8500000238418579}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7266332507133484},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6834607124328613},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6537029147148132},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5810521245002747},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5634811520576477},{"id":"https://openalex.org/C2776245389","wikidata":"https://www.wikidata.org/wiki/Q962139","display_name":"Programming style","level":2,"score":0.5370171666145325},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5123122930526733},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.47035908699035645},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4520525634288788},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4248213768005371},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32916826009750366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17513814568519592},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:1543596436","doi":null,"is_oa":false,"landing_page_url":"http://stepanovpapers.com/hop.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.8559","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.8559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rpi.edu/~musser/hop.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.838","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://condor.cs.jhu.edu/pub/wilson/c++/stl/hop.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.590.8299","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.590.8299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stepanovpapers.com/hop.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W298190470","https://openalex.org/W7099382750","https://openalex.org/W2505523100","https://openalex.org/W59557077","https://openalex.org/W7097902318","https://openalex.org/W2555263662","https://openalex.org/W7029149502","https://openalex.org/W7099984823","https://openalex.org/W2530798984","https://openalex.org/W7006481525"],"abstract_inverted_index":{"It":[0],"is":[1,29,57,75],"argued":[2],"that":[3,15],"a":[4,42,67,78],"programming":[5],"style":[6,70],"based":[7],"on":[8],"higher":[9,81,110],"order":[10,82,111],"techniquesthe":[11],"use":[12,50,92],"of":[13,45,51,73,80,105],"procedures":[14,18,56,97],"have":[16],"other":[17],"as":[19],"arguments":[20],"andor":[21],"resultscan":[22],"be":[23],"most":[24],"eectively":[25],"employed":[26],"if":[27],"it":[28],"driven":[30],"by":[31],"abstraction":[32],"from":[33],"real":[34],"algorithms":[35,107,118],"rather":[36,63],"than":[37,64],"attempting":[38],"to":[39,66,116],"work":[40],"with":[41,95,101],"xed":[43],"set":[44],"functional":[46],"forms":[47,53],"and":[48,54],"the":[49],"imperative":[52],"mutative":[55,96],"permitted":[58],"even":[59],"encour":[60],"aged":[61],"\\t":[62],"restricting":[65],"purely":[68],"applicative":[69],"A":[71],"sequence":[72],"examples":[74,99],"presented":[76],"illustrating":[77,108],"number":[79],"techniques":[83,112],"operators":[84],"iterators":[85],"accumulation":[86],"reduction":[87],"parallel":[88],"reductionand":[89],"their":[90],"eective":[91],"in":[93],"conjunction":[94],"The":[98],"culminate":[100],"an":[102],"interesting":[103],"family":[104],"sorting":[106],"how":[109],"can":[113],"lead":[114],"naturally":[115],"new":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1543596436","counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
