Proof-Relevant Logical Relations for Name Generation
Pitts and Stark's $\nu$-calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name generation. Models for the $\nu$-calculus that validate basic equivalences concerning names may be constructed using functor categories or nom...
Uložené v:
| Vydané v: | Logical methods in computer science Ročník 14, Issue 1 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Logical Methods in Computer Science e.V
30.03.2018
|
| Predmet: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Pitts and Stark's $\nu$-calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name generation. Models for the $\nu$-calculus that validate basic equivalences concerning names may be constructed using functor categories or nominal sets, with a dynamic allocation monad used to model computations that may allocate fresh names. If recursion is added to the language and one attempts to adapt the models from (nominal) sets to (nominal) domains, however, the direct-style construction of the allocation monad no longer works. This issue has previously been addressed by using a monad that combines dynamic allocation with continuations, at some cost to abstraction. This paper presents a direct-style model of a $\nu$-calculus-like language with recursion using the novel framework of proof-relevant logical relations, in which logical relations also contain objects (or proofs) demonstrating the equivalence of (the semantic counterparts of) programs. Apart from providing a fresh solution to an old problem, this work provides an accessible setting in which to introduce the use of proof-relevant logical relations, free of the additional complexities associated with their use for more sophisticated languages. |
|---|---|
| AbstractList | Pitts and Stark's $\nu$-calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name generation. Models for the $\nu$-calculus that validate basic equivalences concerning names may be constructed using functor categories or nominal sets, with a dynamic allocation monad used to model computations that may allocate fresh names. If recursion is added to the language and one attempts to adapt the models from (nominal) sets to (nominal) domains, however, the direct-style construction of the allocation monad no longer works. This issue has previously been addressed by using a monad that combines dynamic allocation with continuations, at some cost to abstraction. This paper presents a direct-style model of a $\nu$-calculus-like language with recursion using the novel framework of proof-relevant logical relations, in which logical relations also contain objects (or proofs) demonstrating the equivalence of (the semantic counterparts of) programs. Apart from providing a fresh solution to an old problem, this work provides an accessible setting in which to introduce the use of proof-relevant logical relations, free of the additional complexities associated with their use for more sophisticated languages. |
| Author | Hofmann, Martin Benton, Nick Nigam, Vivek |
| Author_xml | – sequence: 1 givenname: Nick surname: Benton fullname: Benton, Nick – sequence: 2 givenname: Martin surname: Hofmann fullname: Hofmann, Martin – sequence: 3 givenname: Vivek orcidid: 0000-0003-4089-1218 surname: Nigam fullname: Nigam, Vivek |
| BookMark | eNpNkEtLw0AQgBepYK39A55y1EN0n9mNNylaC_GBj_Myu5ktKWlWNkHw35u2Is5lho_hO3ynZNLFDgk5Z_SKi0KY6-px8ZYzecFuuLrklJkjMmWmoLkqtZz8u0_IvO83dBwhmOHFlMiXFGPIX7HFL-iGrIrrxkObjQCGJnZ9FmLKnmCL2RI7THt4Ro4DtD3Of_eMfNzfvS8e8up5uVrcVrkX1Ax5DVTUGgtQThlWagzaQVlKbQqhIJRYowDnAaBmQZdGMs1rLsc_9C6wUszI6uCtI2zsZ2q2kL5thMbuQUxrC2lofIuWO-eLGp1gCqTQwTntReGURypQKhxd_ODyKfZ9wvDnY9TuM9pdRsukZZYru8sofgBxJWgb |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.23638/LMCS-14(1:25)2018 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_2bbc6deb315a437fbb7c36b5ce03e45e 10_23638_LMCS_14_1_25_2018 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c308t-da03d7e6a5b58197ef7ba99478635af9ede3abcaaad1f7984172d247efecbf193 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000439420800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:43:46 EDT 2025 Sat Nov 29 08:04:21 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c308t-da03d7e6a5b58197ef7ba99478635af9ede3abcaaad1f7984172d247efecbf193 |
| ORCID | 0000-0003-4089-1218 |
| OpenAccessLink | https://doaj.org/article/2bbc6deb315a437fbb7c36b5ce03e45e |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_2bbc6deb315a437fbb7c36b5ce03e45e crossref_primary_10_23638_LMCS_14_1_25_2018 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-03-30 |
| PublicationDateYYYYMMDD | 2018-03-30 |
| PublicationDate_xml | – month: 03 year: 2018 text: 2018-03-30 day: 30 |
| PublicationDecade | 2010 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2018 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.0830283 |
| Snippet | Pitts and Stark's $\nu$-calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - logic in computer science |
| Title | Proof-Relevant Logical Relations for Name Generation |
| URI | https://doaj.org/article/2bbc6deb315a437fbb7c36b5ce03e45e |
| Volume | 14, Issue 1 |
| WOSCitedRecordID | wos000439420800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPHjxLb7JwYMiS7t5rzctLR7aUnxAbyHZTMCDVWr16G93srst9eTFyx5CWIZvkplvIN8MIRc8iEIZpjMk7wELlBAyA6LIckAyHnRgCiqh8ECPRmYyKcYro77Sm7C6PXANXJt5X6qAJV8uneA6eq9LrrxMc65ASEjRF1nPSjFVxWDOE3GuVTKM4yFrD4bdR7ToMr9h8grTnvmViVYa9leZpb9NNhtKSG9rU3bIGkx3ydZi3AJtbt8eEWNkuTF7SIpwxIMO6qhFl-_ZKBJQOnKvQOtm0mlxnzz3e0_d-6wZepCVvGPmWXAdHjQoJ73EbK0hau-KQmiD1MDFAgJw50vnXMijLoxABhKYwH1Q-oh07IC0pm9TOCQU8qiYQ2ck-WjulI-YEJ1hQUYeeCmOyPUCAPte97awWBNUcNkEF9YFNrdM2gTXEblLGC13pr7U1QJ6yzbesn956_g_fnJCNpJBlTKwc0pa89knnJH18mv-8jE7rw4CfoffvR-JTLqQ |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Proof-Relevant+Logical+Relations+for+Name+Generation&rft.jtitle=Logical+methods+in+computer+science&rft.au=Benton%2C+Nick&rft.au=Hofmann%2C+Martin&rft.au=Nigam%2C+Vivek&rft.date=2018-03-30&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=14%2C+Issue+1&rft_id=info:doi/10.23638%2FLMCS-14%281%3A25%292018&rft.externalDBID=n%2Fa&rft.externalDocID=10_23638_LMCS_14_1_25_2018 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |