Certifying Term Rewriting Proof in ELAN

Autor: Nguyen, Quang-Huy

Publikováno v: 2nd International Workshop on Rule-based Programming-RULE'01
2nd International Workshop on Rule-based Programming-RULE'01, Sep 2001, Firenze, Italy, 18 p

Colloque avec actes et comité de lecture. internationale.; International audience; Term rewriting has been shown to be a good environment for both programming and proving. We consider the proof term of term rewriting and propose a formalism based on

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a1c4bf9051132b0eda4bd56b03edb7bb
https://inria.hal.science/inria-00107875/document