On the equivalence of persistent term rewriting systems and recursive program schemes

The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal term rewriting systems (OTRSs). In particular, recursive (applicative) program schemes (RPSs) considered as TRSs, are persistent. Two PTRSs R and R' are syntactically eq...

Full description

Saved in:
Bibliographic Details
Published in[1993] The 2nd Israel Symposium on Theory and Computing Systems pp. 240 - 249
Main Author Khasidashvili, Z.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1993
Subjects
Algebra
Programming profession
Online AccessGet full text

Cover

Abstract The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal term rewriting systems (OTRSs). In particular, recursive (applicative) program schemes (RPSs) considered as TRSs, are persistent. Two PTRSs R and R' are syntactically equivalent when any term t has an R-normal form if it has an R'-normal form and they coincide. He proves that syntactic equivalence is decidable for PTRSs. Further, he shows that the equivalence problem (over all continuous interpretations) is decidable for RPSs with unary basic functions by reducing the question to a decidable number-theory problem. Finally, he shows that weak and strong normalization and the reducibility problem also are decidable in PTRSs.< >
AbstractList The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal term rewriting systems (OTRSs). In particular, recursive (applicative) program schemes (RPSs) considered as TRSs, are persistent. Two PTRSs R and R' are syntactically equivalent when any term t has an R-normal form if it has an R'-normal form and they coincide. He proves that syntactic equivalence is decidable for PTRSs. Further, he shows that the equivalence problem (over all continuous interpretations) is decidable for RPSs with unary basic functions by reducing the question to a decidable number-theory problem. Finally, he shows that weak and strong normalization and the reducibility problem also are decidable in PTRSs.< >
Author Khasidashvili, Z.
Author_xml – sequence: 1
  givenname: Z.
  surname: Khasidashvili
  fullname: Khasidashvili, Z.
  organization: INRIA-Rocquencourt, Le Chesnay, France
BookMark eNp9jr0KwjAUhQMq-PsAOt0XsCYmrXYWRSeH6iyh3taISWtuVHx7Czp7lgPfd4bTZ21XOWRsLHgkBE9nu-ywyiKRpjKax1IlcYv1-VIsE5lIzrtsRHTlTZSKlVr02HHvIFwQ8P4wT31DlyNUBdToyVBAFyCgt-Dx5U0wrgR6N9gSaHduaP5odk-E2lel1xYov6BFGrJOoW-Eo18P2GSzPqy2U4OIp9obq_379D0o_8oPx4pDCg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISTCS.1993.253465
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 249
ExternalDocumentID 253465
GroupedDBID 6IE
6IK
6IL
AAJGR
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-ieee_primary_2534653
IEDL.DBID RIE
ISBN 0818636300
9780818636301
IngestDate Wed Jun 26 19:25:25 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-ieee_primary_2534653
ParticipantIDs ieee_primary_253465
PublicationCentury 1900
PublicationDate 19930000
PublicationDateYYYYMMDD 1993-01-01
PublicationDate_xml – year: 1993
  text: 19930000
PublicationDecade 1990
PublicationTitle [1993] The 2nd Israel Symposium on Theory and Computing Systems
PublicationTitleAbbrev ISTCS
PublicationYear 1993
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000445447
Score 2.4702396
Snippet The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal term rewriting systems (OTRSs)....
SourceID ieee
SourceType Publisher
StartPage 240
SubjectTerms Algebra
Programming profession
Title On the equivalence of persistent term rewriting systems and recursive program schemes
URI https://ieeexplore.ieee.org/document/253465
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFH4RTp5QxCio6cErY2Ntt56JBE38kQAJN7JunTHGgmzTxL_evnZgNBy8rU3WvGRdX7-v7_sKcB1HeSw5y8zODSU51MCdWCZBH6FIFpmUJlOkBu4f-GRO7xZsUftsWy2MUsoWnykPH-1ZfrZKK6TKBkMWUs4a0IiEcFKtHZ3iU8oojazDYxDzEJ2kan-dbTuoDzUDXwxup7PRFJV6oecG_XW5is0t45YTbRfWkhBLSl69qpRe-vXHsPGfYR9B50fER5526ekYDpRuQ2t7iwOpf-oTmD9qYnaBRL1XL2ba2fdWOVkjkWamgC4Jrt5koz7R_0g_E2f-XJBEZ6Y3RbrhQ5G60IsYtKzeVNGB7vhmNpr0MdDl2nlaLF2M4Sk09UqrMyCCSTqUqWQ8F9QPaWLAWhIZQIsWbZyKc2jvGaC7t7cHh65OEJmLC2iWm0pdmlxeyiv7Fb8BtaOflQ
link.rule.ids 310,311,783,787,792,793,799,4057,4058,27937,55086
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFH5RPOgJRYzirx68Mhhru-1MJKCAJkDCjaxbMcbQIWya-Nfb1w6MhoO3rcmal6zbe9_X930FuAv8eSA4S3TlhpIcquFOICK3jlAk8XVKEzFSA4Mh707ow5RNC59to4WRUprmM-ngpdnLT9I4R6qs0WIe5WwfDnRZHXAr1toSKk1KGaW-8Xh0A-6hl1ThsLO5d4ttTbcZNnqjcXuEWj3PsdP-Ol7FZJdO2cq218aUEJtK3pw8E0789cey8Z-BH0P1R8ZHnrcJ6gT2pKpAeXOOAyk-61OYPCmi60Ai3_NXvfDMc-mcLJFK04tAZQT_32QlP9EBSb0Qa_-8JpFK9GiMhMOHJEWrF9F4WS7kugq1zv243a1joLOldbWY2Ri9MyipVMlzICETtCViwfg8pE2PRhquRb6GtGjSxml4AZUdE9R2jt7CYXc86M_6veHjJRzZrkHkMa6glK1yea0zeyZuzBv9BjxhouA
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%3Abook&rft.genre=proceeding&rft.title=%5B1993%5D+The+2nd+Israel+Symposium+on+Theory+and+Computing+Systems&rft.atitle=On+the+equivalence+of+persistent+term+rewriting+systems+and+recursive+program+schemes&rft.au=Khasidashvili%2C+Z.&rft.date=1993-01-01&rft.pub=IEEE&rft.isbn=9780818636301&rft.spage=240&rft.epage=249&rft_id=info:doi/10.1109%2FISTCS.1993.253465&rft.externalDocID=253465
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818636301/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818636301/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818636301/sc.gif&client=summon&freeimage=true