On the Semantic Expressiveness of Iso- and Equi-Recursive Types

Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive data-types (e.g., lists). Two formulations of recursive types exist: iso-recursive and equi-recursive. The relative advantages of iso- and equi-...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Logical methods in computer science Ročník 20, Issue 4
Hlavní autori: Devriese, Dominique, Martin, Eric Mark, Patrignani, Marco
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Logical Methods in Computer Science e.V 14.11.2024
Predmet:
computer science - programming languages
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 Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive data-types (e.g., lists). Two formulations of recursive types exist: iso-recursive and equi-recursive. The relative advantages of iso- and equi-recursion are well-studied when it comes to their impact on type-inference. However, the relative semantic expressiveness of the two formulations remains unclear so far. This paper studies the semantic expressiveness of STLC with iso- and equi-recursive types, proving that these formulations are equally expressive. In fact, we prove that they are both as expressive as STLC with only term-level recursion. We phrase these equi-expressiveness results in terms of full abstraction of three canonical compilers between these three languages (STLC with iso-, with equi-recursive types and with term-level recursion). Our choice of languages allows us to study expressiveness when interacting over both a simply-typed and a recursively-typed interface. The three proofs all rely on a typed version of a proof technique called approximate backtranslation. Together, our results show that there is no difference in semantic expressiveness between STLCs with iso- and equi-recursive types. In this paper, we focus on a simply-typed setting but we believe our results scale to more powerful type systems like System F.
AbstractList Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive data-types (e.g., lists). Two formulations of recursive types exist: iso-recursive and equi-recursive. The relative advantages of iso- and equi-recursion are well-studied when it comes to their impact on type-inference. However, the relative semantic expressiveness of the two formulations remains unclear so far. This paper studies the semantic expressiveness of STLC with iso- and equi-recursive types, proving that these formulations are equally expressive. In fact, we prove that they are both as expressive as STLC with only term-level recursion. We phrase these equi-expressiveness results in terms of full abstraction of three canonical compilers between these three languages (STLC with iso-, with equi-recursive types and with term-level recursion). Our choice of languages allows us to study expressiveness when interacting over both a simply-typed and a recursively-typed interface. The three proofs all rely on a typed version of a proof technique called approximate backtranslation. Together, our results show that there is no difference in semantic expressiveness between STLCs with iso- and equi-recursive types. In this paper, we focus on a simply-typed setting but we believe our results scale to more powerful type systems like System F.
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive data-types (e.g., lists). Two formulations of recursive types exist: iso-recursive and equi-recursive. The relative advantages of iso- and equi-recursion are well-studied when it comes to their impact on type-inference. However, the relative semantic expressiveness of the two formulations remains unclear so far. This paper studies the semantic expressiveness of STLC with iso- and equi-recursive types, proving that these formulations are equally expressive. In fact, we prove that they are both as expressive as STLC with only term-level recursion. We phrase these equi-expressiveness results in terms of full abstraction of three canonical compilers between these three languages (STLC with iso-, with equi-recursive types and with term-level recursion). Our choice of languages allows us to study expressiveness when interacting over both a simply-typed and a recursively-typed interface. The three proofs all rely on a typed version of a proof technique called approximate backtranslation. Together, our results show that there is no difference in semantic expressiveness between STLCs with iso- and equi-recursive types. In this paper, we focus on a simply-typed setting but we believe our results scale to more powerful type systems like System F.
Author Martin, Eric Mark
Patrignani, Marco
Devriese, Dominique
Author_xml – sequence: 1
  givenname: Dominique
  surname: Devriese
  fullname: Devriese, Dominique
– sequence: 2
  givenname: Eric Mark
  surname: Martin
  fullname: Martin, Eric Mark
– sequence: 3
  givenname: Marco
  surname: Patrignani
  fullname: Patrignani, Marco
BookMark eNpNkMtKAzEUhoNUsNa-gKssdTGa22QSNyKlaqFQ0LoOuZzolHamJq3Yt3faing2_7nAx-E7R72mbQChS0puhGRa3S5XPheMXIk7Kq4ZYeIE9amSpCh1JXr_-jM0zHlBuuKcKib76H7W4M0H4FdY2WZTezz-XifIuf6CpgvcRjzJbYFtE_D4c1sXL-C3aX_G890a8gU6jXaZYfibA_T2OJ6Pnovp7GkyepgWnhO1KWKpuOdSlaCck8FJXlUV0yFCpWgJUQQpqHVAAw_ChRBpFYQSkUvQjpKSD9DkyA2tXZh1qlc27Uxra3NYtOnd2NT9vwRjOSsjYyCi1MIrZR1jykXQ4LR3AjoWO7J8anNOEP94lJiDUbM3alg3GSrM3ij_AZLpbAk
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-20(4:14)2024
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_a325f22e4f694c88ab228bfe9eb9cb4e
10_46298_lmcs_20_4_14_2024
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-f583c3685e8bb6db6377729dfe7815ef4d641abe1d3d4bddf17d484f36e9b1053
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001357362300001&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 06:21:52 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c308t-f583c3685e8bb6db6377729dfe7815ef4d641abe1d3d4bddf17d484f36e9b1053
OpenAccessLink https://doaj.org/article/a325f22e4f694c88ab228bfe9eb9cb4e
ParticipantIDs doaj_primary_oai_doaj_org_article_a325f22e4f694c88ab228bfe9eb9cb4e
crossref_primary_10_46298_lmcs_20_4_14_2024
PublicationCentury 2000
PublicationDate 2024-11-14
PublicationDateYYYYMMDD 2024-11-14
PublicationDate_xml – month: 11
  year: 2024
  text: 2024-11-14
  day: 14
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2024
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.328512
Snippet Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive...
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - programming languages
Title On the Semantic Expressiveness of Iso- and Equi-Recursive Types
URI https://doaj.org/article/a325f22e4f694c88ab228bfe9eb9cb4e
Volume 20, Issue 4
WOSCitedRecordID wos001357362300001&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/eLvHCXMwrV3LSgMxFA1SXLjxLb7JwoUioZ0kTTJuRKVFQav4gO6GPKFgp9ppxZXf7s3MVOrKjZuBeRDCuTc35wzJCUJH0jotKTWgTbgkkCGapFYG4l1LapAHQMlLy_xb2eupfj99mDvqK64Jq-yBK-CamtF2oNTzIFJuoS1DqTLBp96k1nAfqy-wnjkxVdZgxiJxrnbJcEFT1Xwd2gJy4pifJfwEJD__NRPNGfaXM0t3FS3XlBBfVF1ZQws-X0crs-MWcD36NtD5fY6BruEnPwQ4BhZ3PqtVrFW9wqOAb4oRwTp3uPM-HZDH-C89vsZRbRab6KXbeb66JvX5B8SylpqQ0FbMRoN4r4wRzggmIxd2wUuVtH3gTvBEG5845rhxLiTSccUDEz41wJvYFmrko9xvI5wY64WT3sJw4yGAKmppkzpNNRVWGLaDTmdYZG-VzUUG8qBELovIZRTuQCdkEbkddBnh-vkyWlSXDyBwWR247K_A7f5HI3toKXYobg5M-D5qTMZTf4AW7cdkUIwPy5yA691X5xtu1b5N
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=On+the+Semantic+Expressiveness+of+Iso-+and+Equi-Recursive+Types&rft.jtitle=Logical+methods+in+computer+science&rft.au=Devriese%2C+Dominique&rft.au=Martin%2C+Eric+Mark&rft.au=Patrignani%2C+Marco&rft.date=2024-11-14&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=20%2C+Issue+4&rft_id=info:doi/10.46298%2Flmcs-20%284%3A14%292024&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_20_4_14_2024
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