Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Réécriture modulo"'
Autor:
Dupont, Benjamin
In categorical representation theory, numerous families of categories are defined by presentations by diagrammatic generators and relations. One of the main questions in order to study these categories is to compute linear bases for the morphisms spa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::734dd1372dd37d10fbba296d26a5403f
https://theses.hal.science/tel-03610806
https://theses.hal.science/tel-03610806
Autor:
Lamarche, François
Publikováno v:
[Interne] A03-R-423 || lamarche03a, 2003, 8 p
Rapport interne.; Nous soutenons que de multiples problèmes qu'on trouve dans différentes branches de l'informatique théorique peuvent être approchés et résolus au moyen de méthodes développées pour la géométrie moderne. Nous identifions c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a4b1c23c021aa4cbac03c369aca0d521
https://hal.inria.fr/inria-00099779
https://hal.inria.fr/inria-00099779
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
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
https://inria.hal.science/inria-00107875/document