{"id":"https://openalex.org/W1973030866","doi":"https://doi.org/10.1017/s0956796800000125","title":"Equivalence in functional languages with effects","display_name":"Equivalence in functional languages with effects","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W1973030866","doi":"https://doi.org/10.1017/s0956796800000125","mag":"1973030866"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800000125","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000125","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/AC91F676E376BD48AA9DB0423E179249/S0956796800000125a.pdf/div-class-title-equivalence-in-functional-languages-with-effects-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/AC91F676E376BD48AA9DB0423E179249/S0956796800000125a.pdf/div-class-title-equivalence-in-functional-languages-with-effects-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111854002","display_name":"Ian Mason","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ian Mason","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090498111","display_name":"Carolyn Talcott","orcid":"https://orcid.org/0000-0003-2845-7144"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carolyn Talcott","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-2095, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111854002"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":8.0919,"has_fulltext":true,"cited_by_count":169,"citation_normalized_percentile":{"value":0.97408778,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"1","issue":"3","first_page":"287","last_page":"327"},"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.9998000264167786,"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.9998000264167786,"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.9983000159263611,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9775999784469604,"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/computer-science","display_name":"Computer science","score":0.8482446670532227},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7411371469497681},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.6486247777938843},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6402254104614258},{"id":"https://openalex.org/keywords/functional-equivalence","display_name":"Functional equivalence","score":0.6369123458862305},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.5241397023200989},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4674347937107086},{"id":"https://openalex.org/keywords/programming-language-theory","display_name":"Programming language theory","score":0.4609009027481079},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.45757031440734863},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.4257512092590332},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3798372447490692},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.18647700548171997},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.1767246127128601},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.17546245455741882},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.1702839434146881},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1482606828212738}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8482446670532227},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7411371469497681},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.6486247777938843},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6402254104614258},{"id":"https://openalex.org/C2988012377","wikidata":"https://www.wikidata.org/wiki/Q29966452","display_name":"Functional equivalence","level":2,"score":0.6369123458862305},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.5241397023200989},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4674347937107086},{"id":"https://openalex.org/C18701968","wikidata":"https://www.wikidata.org/wiki/Q2670534","display_name":"Programming language theory","level":4,"score":0.4609009027481079},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.45757031440734863},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.4257512092590332},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3798372447490692},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.18647700548171997},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.1767246127128601},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.17546245455741882},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.1702839434146881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1482606828212738},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0956796800000125","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000125","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/AC91F676E376BD48AA9DB0423E179249/S0956796800000125a.pdf/div-class-title-equivalence-in-functional-languages-with-effects-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.47.9447","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.9447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://turing.une.edu.au/~iam/Data/Papers/91fp.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0956796800000125","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000125","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/AC91F676E376BD48AA9DB0423E179249/S0956796800000125a.pdf/div-class-title-equivalence-in-functional-languages-with-effects-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":[{"display_name":"Quality Education","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G6392150145","display_name":"Research in Mechanical Theorem Proving","funder_award_id":"8718605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1973030866.pdf","grobid_xml":"https://content.openalex.org/works/W1973030866.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W172004165","https://openalex.org/W1488880065","https://openalex.org/W1499638282","https://openalex.org/W1508664008","https://openalex.org/W1509898628","https://openalex.org/W1513445195","https://openalex.org/W1549719405","https://openalex.org/W1551447924","https://openalex.org/W1556730529","https://openalex.org/W1560351282","https://openalex.org/W1580876082","https://openalex.org/W1601555688","https://openalex.org/W1765091824","https://openalex.org/W1970945363","https://openalex.org/W1984175918","https://openalex.org/W1987160431","https://openalex.org/W1995157374","https://openalex.org/W2032396207","https://openalex.org/W2043416466","https://openalex.org/W2046137117","https://openalex.org/W2072794470","https://openalex.org/W2088735483","https://openalex.org/W2107219179","https://openalex.org/W2113757735","https://openalex.org/W2116293853","https://openalex.org/W2135037579","https://openalex.org/W2140560121","https://openalex.org/W2141568518","https://openalex.org/W2147764734","https://openalex.org/W2151716725","https://openalex.org/W2153131284","https://openalex.org/W2154273644","https://openalex.org/W2156876717","https://openalex.org/W2157598146","https://openalex.org/W2490938952","https://openalex.org/W2912106379","https://openalex.org/W2936841141","https://openalex.org/W4256363426","https://openalex.org/W6681975460"],"related_works":["https://openalex.org/W2114701904","https://openalex.org/W3146610348","https://openalex.org/W2153353244","https://openalex.org/W1583714326","https://openalex.org/W2146437601","https://openalex.org/W2005461248","https://openalex.org/W2585727512","https://openalex.org/W2159526276","https://openalex.org/W2752311799","https://openalex.org/W1545794938"],"abstract_inverted_index":{"Abstract":[0],"Traditionally":[1],"the":[2,30,46],"view":[3],"has":[4],"been":[5],"that":[6,24,57],"direct":[7],"expression":[8],"of":[9,45],"control":[10],"and":[11,14],"store":[12],"mechanisms":[13],"clear":[15],"mathematical":[16],"semantics":[17],"are":[18,63],"incompatible":[19],"requirements.":[20],"This":[21],"paper":[22],"shows":[23],"adding":[25],"objects":[26],"with":[27,38,50],"memory":[28],"to":[29],"call-by-value":[31],"lambda":[32],"calculus":[33],"results":[34],"in":[35],"a":[36,39],"language":[37],"rich":[40],"equational":[41],"theory,":[42],"satisfying":[43],"many":[44],"usual":[47],"laws.":[48],"Combined":[49],"other":[51],"recent":[52],"work,":[53],"this":[54],"provides":[55],"evidence":[56],"expressive,":[58],"mathematically":[59],"clean":[60],"programming":[61],"languages":[62],"indeed":[64],"possible.":[65]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}