{"id":"https://openalex.org/W2148517439","doi":null,"title":"Structural recursion as a query language","display_name":"Structural recursion as a query language","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W2148517439","mag":"2148517439"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.9046","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.9046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/courses/cs227/papers/b5/sr.ps","raw_type":"text"},"volume":null,"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/A5008833582","display_name":"Val Breazu-Tannen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Val Breazu-Tannen","raw_affiliation_strings":["School of Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087078518","display_name":"Peter Buneman","orcid":"https://orcid.org/0009-0004-9056-8587","observed_orcids":["https://orcid.org/0009-0004-9056-8587"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Buneman","raw_affiliation_strings":["School of Informatics"],"raw_orcid":"https://orcid.org/0009-0004-9056-8587","affiliations":[{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109874214","display_name":"Shamim A. Naqvi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shamim A. Naqvi","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":29.3142,"has_fulltext":false,"cited_by_count":122,"citation_normalized_percentile":{"value":0.99697428,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"19"},"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.8988999724388123,"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.8988999724388123,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.09749999642372131,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0003000000142492354,"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/structural-recursion","display_name":"structural recursion","score":0.9789999723434448},{"id":"https://openalex.org/keywords/query-languages","display_name":"query languages","score":0.9599999785423279},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"typed lambda calculus","score":0.8059999942779541},{"id":"https://openalex.org/keywords/relational-algebra","display_name":"relational algebra","score":0.890999972820282},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"transitive closure","score":0.9789999723434448},{"id":"https://openalex.org/keywords/type-systems","display_name":"type systems","score":0.7990000247955322},{"id":"https://openalex.org/keywords/query-optimization","display_name":"query optimization","score":0.5960000157356262},{"id":"https://openalex.org/keywords/programming-paradigms","display_name":"programming paradigms","score":0.5149999856948853}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6757756471633911},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6732164621353149},{"id":"https://openalex.org/C95916125","wikidata":"https://www.wikidata.org/wiki/Q840540","display_name":"Relational algebra","level":3,"score":0.6429950594902039},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6071007251739502},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.49650126695632935},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48610806465148926},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.4856685400009155},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.4532448351383209},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4426884949207306},{"id":"https://openalex.org/C16739119","wikidata":"https://www.wikidata.org/wiki/Q5139948","display_name":"Codd's theorem","level":5,"score":0.4221816956996918},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41392868757247925},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.4049842357635498},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4021245241165161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2797662317752838},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18317389488220215},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18042117357254028},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.12928810715675354},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.9046","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.9046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/courses/cs227/papers/b5/sr.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.681.8479","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.681.8479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.inf.ed.ac.uk/opb/papers/ICDT1991.pdf","raw_type":"text"},{"id":"mag:2148517439","doi":null,"is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/files/16517467/Structural_Recursion_as_a_Query_Language.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418151","display_name":"Database Programming Languages","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Database Programming Languages","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1551066637","https://openalex.org/W1576853379","https://openalex.org/W2016937339","https://openalex.org/W2019156246","https://openalex.org/W2051045896","https://openalex.org/W2052032467","https://openalex.org/W2089042876","https://openalex.org/W2105775150","https://openalex.org/W2110338707","https://openalex.org/W2139385511","https://openalex.org/W2153320571","https://openalex.org/W2153895433","https://openalex.org/W2162602286"],"related_works":["https://openalex.org/W7115330042","https://openalex.org/W1977152005","https://openalex.org/W7100393870","https://openalex.org/W2004943427","https://openalex.org/W7096251577","https://openalex.org/W2169784305","https://openalex.org/W2247444096","https://openalex.org/W7096681510","https://openalex.org/W6979808583","https://openalex.org/W165949599"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,40,81],"programming":[3,24,36,111],"paradigm":[4,112],"that":[5,53,142],"tries":[6],"to":[7,10,79,87,139,151],"get":[8],"close":[9],"both":[11],"the":[12,19,71,102,106,119],"semantic":[13],"simplicity":[14],"of":[15,22,73,94,105,145],"relational":[16,69,107],"algebra,":[17,70],"and":[18,134,147],"expressive":[20,103],"power":[21,104],"unrestricted":[23],"languages.":[25],"Its":[26],"main":[27],"computational":[28],"engine":[29],"is":[30,37,52,58,77],"structural":[31,98],"recursion":[32,99],"on":[33],"sets.":[34],"All":[35],"done":[38],"within":[39],"\"nicely\"":[41],"typed":[42],"lambda":[43],"calculus,":[44],"as":[45,59,61,153],"in":[46,68],"Machiavelli":[47],"[OBB89].":[48],"A":[49,90],"guiding":[50],"principle":[51],"how":[54],"queries":[55],"are":[56,136],"implemented":[57],"important":[60],"whether":[62],"they":[63],"can":[64],"be":[65,80],"implemented.":[66],"As":[67],"meaning":[72],"any":[74],"relation":[75],"transformer":[76],"guaranteed":[78],"total":[82],"map":[83],"taking":[84],"finite":[85,88],"relations":[86],"relations.":[89],"naturally":[91],"restricted":[92],"class":[93],"programs":[95,130,141],"written":[96],"with":[97],"has":[100],"precisely":[101],"algebra.":[108],"The":[109],"same":[110],"scales":[113],"up,":[114],"yielding":[115],"query":[116],"languages":[117],"for":[118,127,131],"complex-object":[120],"model":[121],"[AB89].":[122],"Beyond":[123],"that,":[124],"there":[125],"are,":[126],"example,":[128],"efficient":[129],"transitive":[132],"closure":[133],"we":[135],"also":[137],"able":[138],"write":[140],"move":[143],"out":[144],"sets,":[146,152],"then":[148],"perhaps":[149],"back":[150],"l...":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}