{"id":"https://openalex.org/W3012402050","doi":"https://doi.org/10.1007/978-3-030-72019-3_15","title":"Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages","display_name":"Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3012402050","doi":"https://doi.org/10.1007/978-3-030-72019-3_15","mag":"3012402050"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-72019-3_15","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-72019-3_15","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-72019-3_15.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-72019-3_15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Daniel Lund\u00e9n","orcid":"https://orcid.org/0000-0003-3127-5640"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Daniel Lund\u00e9n","raw_affiliation_strings":["Digital Futures and EECS, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Digital Futures and EECS, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Johannes Borgstr\u00f6m","orcid":"https://orcid.org/0000-0001-5990-5742"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johannes Borgstr\u00f6m","raw_affiliation_strings":["Uppsala University, Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":null,"display_name":"David Broman","orcid":"https://orcid.org/0000-0001-8457-4105"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"David Broman","raw_affiliation_strings":["Digital Futures and EECS, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Digital Futures and EECS, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.4359,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81649728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"404","last_page":"431"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.3343999981880188,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.3343999981880188,"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.20970000326633453,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.20749999582767487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/correctness","display_name":"Correctness","score":0.8758999705314636},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.531000018119812},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4740999937057495},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.4528000056743622},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4377000033855438},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.4115000069141388},{"id":"https://openalex.org/keywords/type-inference","display_name":"Type inference","score":0.35249999165534973},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.34769999980926514}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8758999705314636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7700999975204468},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.531000018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5171999931335449},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4740999937057495},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.4528000056743622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44620001316070557},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4377000033855438},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4352000057697296},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.4115000069141388},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.35249999165534973},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.34769999980926514},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.34139999747276306},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.2720000147819519},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-030-72019-3_15","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-72019-3_15","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-72019-3_15.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:2003.05191","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.05191","pdf_url":"https://arxiv.org/pdf/2003.05191","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:DiVA.org:kth-292106","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292106","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:DiVA.org:uu-474512","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-474512","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"},{"id":"pmh:oai:pubmedcentral.nih.gov:7984533","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7984533","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Programming Languages and Systems","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-72019-3_15","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-72019-3_15","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-72019-3_15.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5942013151","display_name":null,"funder_award_id":"2013-4853","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G6535064320","display_name":null,"funder_award_id":"RIT15-0012","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G7635396371","display_name":null,"funder_award_id":"RIT15-0012","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3012402050.pdf","grobid_xml":"https://content.openalex.org/works/W3012402050.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1483307070","https://openalex.org/W1605543919","https://openalex.org/W2024355065","https://openalex.org/W2059802626","https://openalex.org/W2081741802","https://openalex.org/W2098613108","https://openalex.org/W2110839939","https://openalex.org/W2111787305","https://openalex.org/W2130363011","https://openalex.org/W2130416410","https://openalex.org/W2131598171","https://openalex.org/W2146058063","https://openalex.org/W2168634963","https://openalex.org/W2206718322","https://openalex.org/W2511514052","https://openalex.org/W2577537660","https://openalex.org/W2595803793","https://openalex.org/W2767781532","https://openalex.org/W2886363898","https://openalex.org/W2900404128","https://openalex.org/W2962837791","https://openalex.org/W3016171907","https://openalex.org/W3036687097","https://openalex.org/W3119685641","https://openalex.org/W3125832933","https://openalex.org/W4205334708","https://openalex.org/W4233487859","https://openalex.org/W4243564313","https://openalex.org/W4293052541","https://openalex.org/W6813542777"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Probabilistic":[1],"programming":[2,24],"is":[3,153,218],"an":[4,87,109,145,150,180,249],"approach":[5],"to":[6,18,188,208,276],"reasoning":[7],"under":[8],"uncertainty":[9],"by":[10],"encoding":[11],"inference":[12,21,29],"problems":[13],"as":[14,32,96,137,228],"programs.":[15],"In":[16,148],"order":[17],"solve":[19,168],"these":[20],"problems,":[22],"probabilistic":[23,160],"languages":[25],"(PPLs)":[26],"employ":[27],"different":[28],"algorithms,":[30],"such":[31,48,95],"sequential":[33],"Monte":[34,39],"Carlo":[35,40],"(SMC),":[36],"Markov":[37],"chain":[38],"(MCMC),":[41],"or":[42],"variational":[43],"methods.":[44],"Existing":[45],"research":[46],"on":[47],"algorithms":[49,62,134],"mainly":[50],"concerns":[51],"their":[52],"implementation":[53],"and":[54,99,112,116,172,185,248,256,267],"efficiency,":[55],"rather":[56],"than":[57],"the":[58,61,67,84,130,155,163,203,214,240,253,260,265],"correctness":[59,78,105,113,141,164],"of":[60,69,86,92,106,114,129,138,165,213,224,231,245,252],"themselves":[63],"when":[64],"applied":[65],"in":[66,83,118,135,144,158,196],"context":[68,85],"expressive":[70,88],"PPLs.":[71],"To":[72],"remedy":[73],"this,":[74],"we":[75,178,200,258],"give":[76],"a":[77,119,159,221,229,243],"proof":[79,142],"for":[80,126,202,220,264],"SMC":[81,115,127,197,225,241,278],"methods":[82],"PPL":[89,182],"calculus,":[90],"representative":[91],"popular":[93],"PPLs":[94,136],"WebPPL,":[97],"Anglican,":[98],"Birch.":[100],"Previous":[101],"work":[102],"have":[103],"studied":[104],"MCMC":[107,117],"using":[108],"operational":[110,146,186],"semantics,":[111],"denotational":[120],"setting":[121],"without":[122],"term":[123],"recursion.":[124],"However,":[125],"inference\u2014one":[128],"most":[131],"commonly":[132],"used":[133],"today\u2014no":[139],"formal":[140],"exists":[143],"setting.":[147],"particular,":[149],"open":[151],"question":[152],"if":[154],"resample":[156,191,216],"locations":[157],"program":[161],"affects":[162],"SMC.":[166],"We":[167],"this":[169],"fundamental":[170],"problem,":[171],"make":[173],"four":[174],"novel":[175],"contributions:":[176],"(i)":[177],"extend":[179],"untyped":[181],"lambda":[183],"calculus":[184,234,266],"semantics":[187],"include":[189],"explicit":[190,215],"terms,":[192],"expressing":[193],"synchronization":[194],"points":[195],"inference;":[198,226],"(ii)":[199],"prove,":[201],"first":[204],"time,":[205],"that":[206],"subject":[207],"mild":[209],"restrictions,":[210],"any":[211],"placement":[212],"terms":[217],"valid":[219],"generic":[222],"form":[223],"(iii)":[227],"result":[230],"(ii),":[232],"our":[233,270],"benefits":[235],"from":[236,239],"classic":[237],"results":[238,271],"literature:":[242],"law":[244],"large":[246],"numbers":[247],"unbiased":[250],"estimate":[251],"model":[254],"evidence;":[255],"(iv)":[257],"formalize":[259],"bootstrap":[261],"particle":[262],"filter":[263],"discuss":[268],"how":[269],"can":[272],"be":[273],"further":[274],"extended":[275],"other":[277],"algorithms.":[279]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2020-03-23T00:00:00"}