{"id":"https://openalex.org/W2127778137","doi":"https://doi.org/10.1017/s0956796812000408","title":"An insider's look at LF type reconstruction: everything you (n)ever wanted to know","display_name":"An insider's look at LF type reconstruction: everything you (n)ever wanted to know","publication_year":2012,"publication_date":"2012-11-02","ids":{"openalex":"https://openalex.org/W2127778137","doi":"https://doi.org/10.1017/s0956796812000408","mag":"2127778137"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796812000408","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000408","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/154A57699A72B0B440CD95B717908348/S0956796812000408a.pdf/div-class-title-an-insider-s-look-at-lf-type-reconstruction-everything-you-n-ever-wanted-to-know-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/154A57699A72B0B440CD95B717908348/S0956796812000408a.pdf/div-class-title-an-insider-s-look-at-lf-type-reconstruction-everything-you-n-ever-wanted-to-know-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044908798","display_name":"Brigitte Pientka","orcid":"https://orcid.org/0000-0002-2549-4276"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"BRIGITTE PIENTKA","raw_affiliation_strings":["McGill University, Montreal, Quebec, Canada (e-mail:","Mcgill university, montreal, quebec, canada e-mail: bpientka@cs.mcgill.ca#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McGill University, Montreal, Quebec, Canada (e-mail:","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Mcgill university, montreal, quebec, canada e-mail: bpientka@cs.mcgill.ca#TAB#","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044908798"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":3.0952,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.92041532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"23","issue":"1","first_page":"1","last_page":"37"},"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.995199978351593,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8422234654426575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8326699733734131},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.6357720494270325},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5527118444442749},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5499585866928101},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.44791752099990845},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.44586339592933655},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4250434637069702},{"id":"https://openalex.org/keywords/logical-framework","display_name":"Logical framework","score":0.4119836688041687},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33234304189682007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32915058732032776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09672385454177856},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.08445367217063904}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8422234654426575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8326699733734131},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.6357720494270325},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5527118444442749},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5499585866928101},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.44791752099990845},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.44586339592933655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4250434637069702},{"id":"https://openalex.org/C20693621","wikidata":"https://www.wikidata.org/wiki/Q6667502","display_name":"Logical framework","level":2,"score":0.4119836688041687},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33234304189682007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32915058732032776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09672385454177856},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.08445367217063904},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0956796812000408","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000408","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/154A57699A72B0B440CD95B717908348/S0956796812000408a.pdf/div-class-title-an-insider-s-look-at-lf-type-reconstruction-everything-you-n-ever-wanted-to-know-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.175.8593","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.8593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mcgill.ca/%7Ebpientka/papers/recon.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0956796812000408","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000408","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/154A57699A72B0B440CD95B717908348/S0956796812000408a.pdf/div-class-title-an-insider-s-look-at-lf-type-reconstruction-everything-you-n-ever-wanted-to-know-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2127778137.pdf","grobid_xml":"https://content.openalex.org/works/W2127778137.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W4765332","https://openalex.org/W37883845","https://openalex.org/W77859606","https://openalex.org/W124942006","https://openalex.org/W171073024","https://openalex.org/W1480580285","https://openalex.org/W1494800672","https://openalex.org/W1498395593","https://openalex.org/W1508641834","https://openalex.org/W1532839410","https://openalex.org/W1536129331","https://openalex.org/W1552620715","https://openalex.org/W1553511155","https://openalex.org/W1554068457","https://openalex.org/W1554667392","https://openalex.org/W1575675278","https://openalex.org/W1727609483","https://openalex.org/W1974190112","https://openalex.org/W1987755707","https://openalex.org/W1990204174","https://openalex.org/W1990946582","https://openalex.org/W2025431400","https://openalex.org/W2034711041","https://openalex.org/W2039769798","https://openalex.org/W2062887328","https://openalex.org/W2069954929","https://openalex.org/W2096970061","https://openalex.org/W2102259218","https://openalex.org/W2121298157","https://openalex.org/W2126773497","https://openalex.org/W2137386428","https://openalex.org/W2142224267","https://openalex.org/W2147137665","https://openalex.org/W2148123185","https://openalex.org/W2149314483","https://openalex.org/W2161555915","https://openalex.org/W2166780425","https://openalex.org/W2295866357","https://openalex.org/W2913920290","https://openalex.org/W3163573021","https://openalex.org/W4250020452","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W4321442002","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W55831818","https://openalex.org/W1483170865","https://openalex.org/W1974190112"],"abstract_inverted_index":{"Abstract":[0],"Although":[1],"type":[2,44,56,70,73,121,127],"reconstruction":[3,45,57,74,122,128],"for":[4,46],"dependently":[5],"typed":[6],"languages":[7],"is":[8,14,124],"common":[9],"in":[10,48,86,129],"practical":[11],"systems,":[12],"it":[13,23],"still":[15],"ill-understood.":[16],"Detailed":[17],"descriptions":[18,30],"of":[19,62,69,112,119],"the":[20,49,55,60,103,113,117,134],"issues":[21],"around":[22],"are":[24,35,100],"hard":[25],"to":[26,126],"find":[27,76],"and":[28,66,80,116],"formal":[29],"together":[31],"with":[32],"correctness":[33,68],"proofs":[34],"non-existing.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40,85],"discuss":[41],"a":[42,93],"one-pass":[43],"objects":[47],"logical":[50,135],"framework":[51,61,136],"LF,":[52],"describe":[53,88],"formally":[54],"process":[58],"using":[59],"contextual":[63],"modal":[64],"types,":[65],"prove":[67],"reconstruction.":[71],"Since":[72],"will":[75,91],"most":[77],"general":[78],"types":[79],"may":[81],"leave":[82],"free":[83,98],"variables,":[84],"addition":[87],"abstraction":[89],"which":[90],"return":[92],"closed":[94],"object":[95],"where":[96],"all":[97],"variables":[99],"bound":[101],"at":[102],"outside.":[104],"We":[105],"also":[106],"implemented":[107],"our":[108,120],"algorithms":[109],"as":[110,133],"part":[111],"Beluga":[114],"language,":[115],"performance":[118],"algorithm":[123],"comparable":[125],"existing":[130],"systems":[131],"such":[132],"Twelf.":[137]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2025-10-10T00:00:00"}