{"id":"https://openalex.org/W1968277829","doi":"https://doi.org/10.1145/964001.964010","title":"Free theorems in the presence of <i>seq</i>","display_name":"Free theorems in the presence of <i>seq</i>","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1968277829","doi":"https://doi.org/10.1145/964001.964010","mag":"1968277829"},"language":"en","primary_location":{"id":"doi:10.1145/964001.964010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/964001.964010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5044007936","display_name":"Patricia Johann","orcid":"https://orcid.org/0000-0002-8075-3904"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Patricia Johann","raw_affiliation_strings":["Rutgers University, Camden, NJ","Rutgers Univ., Camden, NJ#TAB#"],"affiliations":[{"raw_affiliation_string":"Rutgers University, Camden, NJ","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers Univ., Camden, NJ#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026029995","display_name":"Janis Voigtl\u00e4nder","orcid":"https://orcid.org/0009-0001-2411-9909"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Janis Voigtl\u00e4nder","raw_affiliation_strings":["Dresden University of Technology, Dresden, Germany","Dresden University of Technology , Dresden , Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology, Dresden, Germany","institution_ids":[]},{"raw_affiliation_string":"Dresden University of Technology , Dresden , Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044007936"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":8.0947,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.97285495,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"110"},"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.9919999837875366,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9897000193595886,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.7855374813079834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6325056552886963},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5516307950019836},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5439058542251587},{"id":"https://openalex.org/keywords/system-f","display_name":"System F","score":0.493962824344635},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.47574731707572937},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4717555642127991},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4527972638607025},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4418851435184479},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.4222736060619354},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3728630542755127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3530488908290863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3325463831424713},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19060099124908447}],"concepts":[{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.7855374813079834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6325056552886963},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5516307950019836},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5439058542251587},{"id":"https://openalex.org/C55128367","wikidata":"https://www.wikidata.org/wiki/Q2552799","display_name":"System F","level":3,"score":0.493962824344635},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.47574731707572937},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4717555642127991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4527972638607025},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4418851435184479},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.4222736060619354},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3728630542755127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3530488908290863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3325463831424713},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19060099124908447},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/964001.964010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/964001.964010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321613","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W124154939","https://openalex.org/W326743114","https://openalex.org/W1486010533","https://openalex.org/W1534185537","https://openalex.org/W1556536463","https://openalex.org/W1595372275","https://openalex.org/W1960575966","https://openalex.org/W1965297988","https://openalex.org/W1966981171","https://openalex.org/W1980759357","https://openalex.org/W1990195720","https://openalex.org/W2022050707","https://openalex.org/W2057292961","https://openalex.org/W2059895047","https://openalex.org/W2090337950","https://openalex.org/W2111304450","https://openalex.org/W2112122837","https://openalex.org/W2116151771","https://openalex.org/W2149412346","https://openalex.org/W2159227002","https://openalex.org/W2914693551"],"related_works":["https://openalex.org/W2112263414","https://openalex.org/W3004782279","https://openalex.org/W1602185604","https://openalex.org/W2028779182","https://openalex.org/W4242678340","https://openalex.org/W2140654465","https://openalex.org/W2095136535","https://openalex.org/W1992310464","https://openalex.org/W3091937109","https://openalex.org/W1988422976"],"abstract_inverted_index":{"Parametric":[0],"polymorphism":[1],"constrains":[2],"the":[3,14,30,49,68,71,79,108,116,129,138,160,182,186,203],"behavior":[4],"of":[5,16,70,81,140,156,162,172,219],"pure":[6],"functional":[7],"programs":[8],"in":[9,67,125,181,208],"a":[10,39,122,134,144,216],"way":[11],"that":[12,57,111],"allows":[13],"derivation":[15],"interesting":[17],"theorems":[18,92,174,196],"about":[19],"them":[20],"solely":[21],"from":[22,103],"their":[23,179,209],"types,":[24],"i.e.,":[25],"virtually":[26],"for":[27,35,137,192],"free.":[28],"Unfortunately,":[29],"standard":[31,193],"parametricity":[32,135],"theorem":[33,136],"fails":[34],"nonstrict":[36],"languages":[37],"supporting":[38],"polymorphic":[40],"strict":[41,63,94],"evaluation":[42],"primitive":[43],"like":[44],"Haskell's":[45],"seq.":[46,152],"Contrary":[47],"to":[48,89,93,101,127,143,169,188],"folklore":[50],"surrounding":[51],"seq":[52],"and":[53,64,76,95,151],"parametricity,":[54],"we":[55,132],"show":[56],"not":[58],"even":[59],"quantifying":[60],"only":[61],"over":[62],"bottom-reflecting":[65],"relations":[66,86],"$\\forall$-clause":[69],"underlying":[72],"logical":[73,123,165],"relation":[74,124],"---":[75,98],"thus":[77],"restricting":[78],"choice":[80],"functions":[82],"with":[83,147,215],"which":[84,167],"such":[85],"are":[87],"instantiated":[88],"obtain":[90,189],"free":[91,173,195],"total":[96],"ones":[97],"is":[99,159,213],"sufficient":[100],"recover":[102],"this":[104],"failure.":[105],"By":[106],"addressing":[107],"subtle":[109],"issues":[110],"arise":[112],"when":[113],"propagating":[114],"up":[115],"type":[117],"hierarchy":[118],"restrictions":[119],"imposed":[120],"on":[121,222],"order":[126],"accommodate":[128],"strictness":[130],"primitive,":[131],"provide":[133],"subset":[139],"Haskell":[141],"corresponding":[142,190],"Girard-Reynolds-style":[145],"calculus":[146],"fixpoints,":[148],"algebraic":[149],"datatypes,":[150],"A":[153],"crucial":[154],"ingredient":[155],"our":[157],"approach":[158],"use":[161],"an":[163],"asymmetric":[164],"relation,":[166],"leads":[168],"\"inequational\"":[170],"versions":[171],"enriched":[175],"by":[176,197],"preconditions":[177,191],"guaranteeing":[178],"validity":[180],"described":[183],"setting.":[184],"Besides":[185],"potential":[187],"equational":[194],"combining":[198],"some":[199],"new":[200],"inequational":[201],"ones,":[202],"latter":[204],"also":[205],"have":[206],"value":[207],"own":[210],"right,":[211],"as":[212],"exemplified":[214],"careful":[217],"analysis":[218],"seq's":[220],"impact":[221],"familiar":[223],"program":[224],"transformations.":[225]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-23T05:10:03.516525","created_date":"2025-10-10T00:00:00"}