Regular expression order-sorted unification and matching

We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and...

Descripción completa

Detalles Bibliográficos
Autores principales: Kutsia, Temur, Marin, Mircea
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier Limited 2015
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4599633/
https://www.ncbi.nlm.nih.gov/pubmed/26523088
http://dx.doi.org/10.1016/j.jsc.2014.08.002

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4599633/
https://www.ncbi.nlm.nih.gov/pubmed/26523088
http://dx.doi.org/10.1016/j.jsc.2014.08.002

Ejemplares similares