A robust graph-based approach to observational equivalence

We propose a new step-wise approach to proving observational equivalence, and in particular reasoning about fragility of observational equivalence. Our approach is based on what we call local reasoning. The local reasoning exploits the graphical concept of neighbourhood, and it extracts a new, forma...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Logical methods in computer science Ročník 21, Issue 2
Hlavní autori: Ghica, Dan R., Muroya, Koko, Ambridge, Todd Waugh
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Logical Methods in Computer Science e.V 01.01.2025
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 We propose a new step-wise approach to proving observational equivalence, and in particular reasoning about fragility of observational equivalence. Our approach is based on what we call local reasoning. The local reasoning exploits the graphical concept of neighbourhood, and it extracts a new, formal, concept of robustness as a key sufficient condition of observational equivalence. Moreover, our proof methodology is capable of proving a generalised notion of observational equivalence. The generalised notion can be quantified over syntactically restricted contexts instead of all contexts, and also quantitatively constrained in terms of the number of reduction steps. The operational machinery we use is given by a hypergraph-rewriting abstract machine inspired by Girard's Geometry of Interaction. The behaviour of language features, including function abstraction and application, is provided by hypergraph-rewriting rules. We demonstrate our proof methodology using the call-by-value lambda-calculus equipped with (higher-order) state.
AbstractList We propose a new step-wise approach to proving observational equivalence, and in particular reasoning about fragility of observational equivalence. Our approach is based on what we call local reasoning. The local reasoning exploits the graphical concept of neighbourhood, and it extracts a new, formal, concept of robustness as a key sufficient condition of observational equivalence. Moreover, our proof methodology is capable of proving a generalised notion of observational equivalence. The generalised notion can be quantified over syntactically restricted contexts instead of all contexts, and also quantitatively constrained in terms of the number of reduction steps. The operational machinery we use is given by a hypergraph-rewriting abstract machine inspired by Girard's Geometry of Interaction. The behaviour of language features, including function abstraction and application, is provided by hypergraph-rewriting rules. We demonstrate our proof methodology using the call-by-value lambda-calculus equipped with (higher-order) state.
Author Muroya, Koko
Ambridge, Todd Waugh
Ghica, Dan R.
Author_xml – sequence: 1
  givenname: Dan R.
  surname: Ghica
  fullname: Ghica, Dan R.
– sequence: 2
  givenname: Koko
  surname: Muroya
  fullname: Muroya, Koko
– sequence: 3
  givenname: Todd Waugh
  surname: Ambridge
  fullname: Ambridge, Todd Waugh
BookMark eNpNkEtLAzEUhYNUsNb-AHez1MVo3pN0V4ovKLjRdbh5TDtlOhmTacF_bx8i3s25nMXH4btGoy52AaFbgh-4pFo9tluXS0ru6EzdU0zFBRoTJXEpdMVH__4rNM15gw_HGFFUjtFsXqRod3koVgn6dWkhB19A36cIbl0MsYg2h7SHoYkdtEX42jV7aEPnwg26rKHNYfqbE_T5_PSxeC2X7y9vi_mydAyrodTME8w0kTWnQKUiriYQpNVOHTZwqTgDX2MrtNegLSOuChUX1FlpHaWMTdDbmesjbEyfmi2kbxOhMacippWBNDSuDUZp70ItbO2F4i44LYVTmrNAK_BYygOLnFkuxZxTqP94BJuTS3N0aSgx1ChzdMl-AM1Iab8
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-21(2:8)2025
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_89dcef5bfd584cec965c8943e27ad066
10_46298_lmcs_21_2_8_2025
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-93d103916f42a2681cf1ae6b9c831846843adf0b59d9a9b31c7e7452cb6bc2233
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001476826000001&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:53:36 EDT 2025
Sat Nov 29 07:59:58 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c308t-93d103916f42a2681cf1ae6b9c831846843adf0b59d9a9b31c7e7452cb6bc2233
OpenAccessLink https://doaj.org/article/89dcef5bfd584cec965c8943e27ad066
ParticipantIDs doaj_primary_oai_doaj_org_article_89dcef5bfd584cec965c8943e27ad066
crossref_primary_10_46298_lmcs_21_2_8_2025
PublicationCentury 2000
PublicationDate 2025-01-01
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – month: 01
  year: 2025
  text: 2025-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2025
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.325972
Snippet We propose a new step-wise approach to proving observational equivalence, and in particular reasoning about fragility of observational equivalence. Our...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - programming languages
f.3.2
Title A robust graph-based approach to observational equivalence
URI https://doaj.org/article/89dcef5bfd584cec965c8943e27ad066
Volume 21, Issue 2
WOSCitedRecordID wos001476826000001&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/eLvHCXMwrV27TsMwFLVQxcDCG1Fe8sAASFYT2_GjW0GtGKBiANTN8lOqBC20KSPfjp2kVZlYWDJEieWc6_ica1vnAnCJPc-izLBIRjGEaDAMGU8l0pprkYcC86pm5OsDHw7FaCSf1kp9pTNhtT1wDVxHSGd9KExwkSqtt5IVNnmGe8y1i3yZZt-My7VkqpqDCUnCud7GpAxL0Xl7t3OE8yvcFdcx4y9-EdGaX39FLINdsN0oQtire7IHNvxkH-wsqy3A5uc7AN0enE3NYl7CymQaJf5xcOkJDsspnJrVEmts0H8uxnEYpZcPwcug_3x3j5rKB8iSTJRIEpe2aHMWKNaYidyGXHtmpBXxuygTlGgXMlNIJ7U0JLfcc1pga5ixkfDJEWhNphN_DGBUaDRKpgghIdQZapIBC8888SZIH3Qb3CxhUB-1wYWKiUGFmUqYKZwrrIRKmLXBbQJq9WDypq5uxIipJmLqr4id_Ecjp2ArdaheDDkDrXK28Odg036V4_nsohoM8fr43f8B_pC7Wg
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=A+robust+graph-based+approach+to+observational+equivalence&rft.jtitle=Logical+methods+in+computer+science&rft.au=Dan+R.+Ghica&rft.au=Koko+Muroya&rft.au=Todd+Waugh+Ambridge&rft.date=2025-01-01&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=21%2C+Issue+2&rft_id=info:doi/10.46298%2Flmcs-21%282%3A8%292025&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_89dcef5bfd584cec965c8943e27ad066
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