Specification of Term Rewriting in Linear Logic

Delzanno, Giorgio

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Specification of Term Rewriting in Linear Logic

MPS-Authors

/persons/resource/persons44290

Delzanno, Giorgio
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Delzanno, G. (1998). Specification of Term Rewriting in Linear Logic. In D. Galmiche (Ed.), Proceedings of Workshop on Proof-Search in Type-Theoretic Languages. Amsterdam, the Netherlands: Elsevier.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-388F-9

Abstract

We present an axiomatization of term rewriting systems in Forum, a presentation of linear logic in terms of uniform proofs, which allows us to relate provability and derivability in a natural way. The resulting theory can be used to prove properties of the original system. Vice versa the structure of the formulas used in the encoding suggests us a possible operational interpretation of Forum. The considered fragment turns out to be an extension of previously proposed multi-conclusion logics.