Zobrazeno 1 - 10
of 352
pro vyhledávání: '"Term rewriting systems"'
Autor:
Vítores Vicente, Miguel
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[ES] CONFident es una herramienta que demuestra la confluencia, una de las propiedades más importantes en el análisis de sistemas de reescritura. Para ello hace uso de algunas herramientas como infChecker o mu-term. Por ejemplo, infChecker es cruci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0ad66403f7588e1656ceb3b8a6deb5cb
http://hdl.handle.net/10251/182291
http://hdl.handle.net/10251/182291
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 30(4):349-360
This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::82672a49f3b16d6a854775c5cc356901
https://nagoya.repo.nii.ac.jp/records/28615
https://nagoya.repo.nii.ac.jp/records/28615
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Science of Computer Programming
Science of Computer Programming, Elsevier, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
Functional and Logic Programming-14th International Symposium, Proceedings
Functional and Logic Programming-14th International Symposium, Proceedings, May 2018, Nagoya, Japan
Functional and Logic Programming ISBN: 9783319906850
FLOPS
Science of Computer Programming, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
Science of Computer Programming, Elsevier, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
Functional and Logic Programming-14th International Symposium, Proceedings
Functional and Logic Programming-14th International Symposium, Proceedings, May 2018, Nagoya, Japan
Functional and Logic Programming ISBN: 9783319906850
FLOPS
Science of Computer Programming, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cbbbca1e102724c2f2ab4e39f97b66c
https://hal.inria.fr/hal-02381877
https://hal.inria.fr/hal-02381877
Autor:
Alberto Pettorossi
Publikováno v:
8th International Workshop on Verification and Program Transformation, pp. 1–28, Dublin, Ireland, 25-26/04/2020
info:cnr-pdr/source/autori:PETTOROSSI Alberto/congresso_nome:8th International Workshop on Verification and Program Transformation/congresso_luogo:/congresso_data:Dublin, Ireland, 25-26%2F04%2F2020/anno:2020/pagina_da:1/pagina_a:28/intervallo_pagine:1–28
VPT/HCVS@ETAPS
info:cnr-pdr/source/autori:PETTOROSSI Alberto/congresso_nome:8th International Workshop on Verification and Program Transformation/congresso_luogo:/congresso_data:Dublin, Ireland, 25-26%2F04%2F2020/anno:2020/pagina_da:1/pagina_a:28/intervallo_pagine:1–28
VPT/HCVS@ETAPS
This paper presents a brief account of some of the my early research interests. This historical account starts from my laurea thesis on Signal Theory and my master thesis on Computation Theory. It recalls some results in Combinatory Logic and Term Re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fe5ff80bef81de7ec36431a386054a0
http://www.cnr.it/prodotto/i/438556
http://www.cnr.it/prodotto/i/438556
Autor:
Yamaguchi, Masaomi, Aoto, Takahito
Uniqueness of normal forms w.r.t. conversion (UNC) of term rewriting systems (TRSs) guarantees that there are no distinct convertible normal forms. It was recently shown that the UNC property of TRSs is decidable for shallow TRSs (Radcliffe et al., 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59ffbc04fa9425576769875e22253c5b
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Lecture Notes in Computer Science. 9195:111-126
A term is weakly shallow if each defined function symbol occurs either at the root or in the ground subterms, and a term rewriting system is weakly shallow if both sides of a rewrite rule are weakly shallow. This paper proves that non-E-overlapping,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::1008fd41cd0d5c07e31dd4090e564414
http://hdl.handle.net/10119/14220
http://hdl.handle.net/10119/14220
Autor:
Genet, Thomas
Publikováno v:
[Research Report] IRISA, Inria Rennes. 2017
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo completeness theorems. The first one shows that, if the set of reachable terms is regular, thenthe equational tree automata completion can compute it. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b2e46f49853a9f409f82390dfade818f
https://hal.science/hal-01501744v3/file/mainLong.pdf
https://hal.science/hal-01501744v3/file/mainLong.pdf