Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers

We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi. To establish the method, we use a variation of semantic labelling translation and Blanqui...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 18, Issue 2
Main Author: Hamana, Makoto
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science e.V 14.06.2022
Subjects:
computer science - logic in computer science
computer science - symbolic computation
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi. To establish the method, we use a variation of semantic labelling translation and Blanqui's General Schema: a syntactic criterion of strong normalisation. As an application, we apply this method to show termination of a variant of call-by-push-value calculus with algebraic effects and effect handlers. We also show that our tool SOL is effective to solve higher-order termination problems.
AbstractList We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi. To establish the method, we use a variation of semantic labelling translation and Blanqui's General Schema: a syntactic criterion of strong normalisation. As an application, we apply this method to show termination of a variant of call-by-push-value calculus with algebraic effects and effect handlers. We also show that our tool SOL is effective to solve higher-order termination problems.
We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi. To establish the method, we use a variation of semantic labelling translation and Blanqui's General Schema: a syntactic criterion of strong normalisation. As an application, we apply this method to show termination of a variant of call-by-push-value calculus with algebraic effects and effect handlers. We also show that our tool SOL is effective to solve higher-order termination problems.
Author Hamana, Makoto
Author_xml – sequence: 1
  givenname: Makoto
  surname: Hamana
  fullname: Hamana, Makoto
BookMark eNpNkLFOwzAQhi1UJErpCzB5hCHgsx3HYauqApWKKkGZLcd2qlRuHNnpwNsTGoS44e703-kbvms0aUPrELoF8sAFLeWjP5qUgbyjTyDvKaH0Ak1BCpLlZcEn__YrNE_pQIZiDCQVU2Tegj15HfHOxWPT6r4JLa5DxB_OhNZm22hdxMtw7E79eHw_eZewbi1edJ1vzJj2AS_83lVRNwav6tqZHr8OT97FdIMua-2Tm__OGfp8Xu2Wr9lm-7JeLjaZYQXvMy04p0ZqJgw1VrOyBgY1yUHyshQShCMAHIgsmMhlXgoDjLPKEktywVnBZmg9cm3QB9XF5qjjlwq6UecgxL3SsW-Md0oMfJMLCtIwTiqhZcms04SKyjkHdmDRkWViSCm6-o8HRJ2tqx_rCqSi5zZYZ98z1nc5
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-18(2:18)2022
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_6da3c56218c340b6a893dea026beee1d
10_46298_lmcs_18_2_18_2022
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-c374t-a6442c8a36c2cda39f131f05184996816e011410873658596c1343bd0d0564373
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000811858200001&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:32:17 EDT 2025
Sat Nov 29 06:21:51 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-c374t-a6442c8a36c2cda39f131f05184996816e011410873658596c1343bd0d0564373
ORCID 0000-0002-3064-8225
OpenAccessLink https://doaj.org/article/6da3c56218c340b6a893dea026beee1d
ParticipantIDs doaj_primary_oai_doaj_org_article_6da3c56218c340b6a893dea026beee1d
crossref_primary_10_46298_lmcs_18_2_18_2022
PublicationCentury 2000
PublicationDate 2022-06-14
PublicationDateYYYYMMDD 2022-06-14
PublicationDate_xml – month: 06
  year: 2022
  text: 2022-06-14
  day: 14
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2022
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.235385
Snippet We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving...
We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - logic in computer science
computer science - symbolic computation
Title Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers
URI https://doaj.org/article/6da3c56218c340b6a893dea026beee1d
Volume 18, Issue 2
WOSCitedRecordID wos000811858200001&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/eLvHCXMwrV07T8MwELZQxcDCG1Fe8sAAQlbjRxObrSCqDrwEBXWLHNtBlUqL2sLIb-cubqFMLCweEieyvrN998nn7wg5zgz3iXcZM2VpmWomnungBQtBWJgfwurq1vvzdXZ7q3s9c79Q6gtzwqI8cASukXorHThprp1USZFacLA-WKAORQiBe9x9k8wskKlqD5YSA-d4S0alwujG4NVNGNcn4pzrU6D84pcnWhDsrzxLe52szkJC2opD2SBLYbhJ1ublFuhs9W0RdzPymDRKuzGBBSGlEHPSRyS1nt2hiiaN38WXD--DMKF26Gnr55yaTke0NXjBA-O-o1G9mHYqsYXxZJs8ta-6lx02q5HAnMzUlFmIZ4TTVqZOOIDKlFzyElaaBiqTap4GZDw80ZmEWKNpUselkgXYByIflDXaIbXhaBh2CVUmKRKHeoFNpax3hcJCxEqUTmtvpKyTszle-VuUwsiBQlTo5ohuznUuqgbQrZMLhPS7J8pYVw_AuPnMuPlfxt37j5_skxUcEOZ3cXVAatPxezgky-5j2p-Mj6p5A-3N59UXnQnIag
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=Modular+Termination+for+Second-Order+Computation+Rules+and+Application+to+Algebraic+Effect+Handlers&rft.jtitle=Logical+methods+in+computer+science&rft.au=Hamana%2C+Makoto&rft.date=2022-06-14&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=18%2C+Issue+2&rft_id=info:doi/10.46298%2Flmcs-18%282%3A18%292022&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_18_2_18_2022
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