Cargando...
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...
Guardado en:
| Publicado en: | J Symb Comput |
|---|---|
| Autores principales: | , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Elsevier Limited
2015
|
| Materias: | |
| Acceso en línea: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4599633/ https://ncbi.nlm.nih.gov/pubmed/26523088 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.jsc.2014.08.002 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|