A Rho-Calculus of explicit constraint application

Autor: Horatiu Cirstea, Germain Faure, Claude Kirchner

Publikováno v: Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation, 2007, Special Issue on Rewriting Logic and its Applications, 20, pp.37-72. ⟨10.1007/s10990-007-9004-2⟩
Workshop on Rewriting Logic and Applications
Workshop on Rewriting Logic and Applications, Mar 2004, Barcelona (Spain), Spain
WRLA
Higher-Order and Symbolic Computation, Springer Verlag, 2007, Special Issue on Rewriting Logic and its Applications, 20, pp.37-72. ⟨10.1007/s10990-007-9004-2⟩

International audience; Theoretical presentations of the rho-calculus often treat the matching constraint computations as an atomic operation although matching constraints are explicitly expressed. Actual implementations have to take a much more real

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e28644f44bb32179d6f754b1a2f64da
https://inria.hal.science/inria-00000628v3/file/paper.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.