{"id":"https://openalex.org/W2019747072","doi":"https://doi.org/10.1145/2643135.2643147","title":"Parametricity and Proving Free Theorems for Functional-Logic Languages","display_name":"Parametricity and Proving Free Theorems for Functional-Logic Languages","publication_year":2014,"publication_date":"2014-09-08","ids":{"openalex":"https://openalex.org/W2019747072","doi":"https://doi.org/10.1145/2643135.2643147","mag":"2019747072"},"language":"en","primary_location":{"id":"doi:10.1145/2643135.2643147","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2643135.2643147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01092357","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084661283","display_name":"Stefan Mehner","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Mehner","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073936754","display_name":"Daniel Seidel","orcid":"https://orcid.org/0000-0002-2240-3850"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Seidel","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106497188","display_name":"Lutz Stra\u00dfburger","orcid":"https://orcid.org/0000-0003-4661-6540"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lutz Stra\u00dfburger","raw_affiliation_strings":["INRIA & LIX, Ecole Polytechnique","Proof search and reasoning with logic specifications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA & LIX, Ecole Polytechnique","institution_ids":["https://openalex.org/I4210139461","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Proof search and reasoning with logic specifications","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026029995","display_name":"Janis Voigtl\u00e4nder","orcid":"https://orcid.org/0009-0001-2411-9909"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Janis Voigtl\u00e4nder","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.07884237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"30"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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.9975000023841858,"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/denotational-semantics","display_name":"Denotational semantics","score":0.6974362730979919},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6712100505828857},{"id":"https://openalex.org/keywords/normalisation-by-evaluation","display_name":"Normalisation by evaluation","score":0.6531573534011841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5756928324699402},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5672540664672852},{"id":"https://openalex.org/keywords/domain-theory","display_name":"Domain theory","score":0.5582966804504395},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5575178265571594},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.5183457136154175},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.48368343710899353},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4389982223510742},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.41587525606155396},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.37745124101638794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3355998396873474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32956767082214355},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.32349342107772827}],"concepts":[{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.6974362730979919},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6712100505828857},{"id":"https://openalex.org/C87365073","wikidata":"https://www.wikidata.org/wiki/Q7051843","display_name":"Normalisation by evaluation","level":5,"score":0.6531573534011841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5756928324699402},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5672540664672852},{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.5582966804504395},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5575178265571594},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.5183457136154175},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.48368343710899353},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4389982223510742},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.41587525606155396},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.37745124101638794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3355998396873474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32956767082214355},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.32349342107772827}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2643135.2643147","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2643135.2643147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.643.673","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iai.uni-bonn.de/~jv/papers/ParametricityAndProvingFreeTheoremsForFunctionalLogicLanguages.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01092357v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01092357","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Principles and Practice of Declarative Programming, PPDP 2014, Sep 2014, Canterbury, United Kingdom. ⟨10.1145/2643135.2643147⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01092357v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01092357","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Principles and Practice of Declarative Programming, PPDP 2014, Sep 2014, Canterbury, United Kingdom. ⟨10.1145/2643135.2643147⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W60003963","https://openalex.org/W68427271","https://openalex.org/W326743114","https://openalex.org/W1522154830","https://openalex.org/W1827100046","https://openalex.org/W1966981171","https://openalex.org/W1973600615","https://openalex.org/W1980781982","https://openalex.org/W2017855559","https://openalex.org/W2024951218","https://openalex.org/W2057292961","https://openalex.org/W2063521547","https://openalex.org/W2071327896","https://openalex.org/W2104980999","https://openalex.org/W2106602483","https://openalex.org/W2128271514","https://openalex.org/W3043523721","https://openalex.org/W3106162202","https://openalex.org/W6602764971"],"related_works":["https://openalex.org/W2604377475","https://openalex.org/W2110748634","https://openalex.org/W3036972880","https://openalex.org/W2755363016","https://openalex.org/W1584038246","https://openalex.org/W1929699059","https://openalex.org/W2032453924","https://openalex.org/W4234105222","https://openalex.org/W2093062902","https://openalex.org/W2121759322"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,34,53],"this":[3],"paper":[4],"is":[5,81],"to":[6,39,108,127],"provide":[7],"the":[8,26,32,50,100,131],"required":[9],"foundations":[10],"for":[11,25,114,139],"establishing":[12],"free":[13,118,137],"theorems":[14,119,138],"--":[15,24],"statements":[16],"about":[17],"program":[18],"equivalence,":[19],"guaranteed":[20],"by":[21],"polymorphic":[22],"types":[23],"functional-logic":[27],"programming":[28],"language":[29,41,77],"Curry.":[30],"For":[31],"sake":[33],"presentation":[35],"we":[36,44,134],"restrict":[37],"ourselves":[38],"a":[40,61,83,94,110,123],"fragment":[42],"that":[43,48,80,99,129],"call":[45],"CuMin,":[46],"and":[47,57,91,116],"has":[49],"characteristic":[51],"features":[52],"Curry":[54],"(both":[55],"functional":[56],"logic).":[58],"We":[59,72,97],"present":[60],"new":[62],"denotational":[63,95],"semantics":[64],"based":[65],"on":[66],"partially":[67],"ordered":[68],"sets":[69],"without":[70],"limits.":[71],"then":[73,135],"introduce":[74],"an":[75,87],"intermediate":[76],"called":[78],"SaLT":[79,115,128],"essentially":[82],"lambda-calculus":[84],"extended":[85],"with":[86],"abstract":[88],"set":[89],"type,":[90],"again":[92],"give":[93],"semantics.":[96],"show":[98],"standard":[101],"(logical":[102],"relations)":[103],"techniques":[104],"can":[105],"be":[106],"applied":[107],"obtain":[109],"general":[111],"parametricity":[112],"theorem":[113],"derive":[117,136],"from":[120,125],"it.":[121],"Via":[122],"translation":[124],"CuMin":[126],"fits":[130],"respective":[132],"semantics,":[133],"CuMin.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}