Unification of kinded infinite trees

DOI10.1016/0020-0190(95)00100-QMaRDI QIDQ1352126zbMATH OpenOpenAlexFDO

Authors Vasco T. Vasconcelos

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00100-q

zbMATH Keywords

AlgorithmsUnification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• Unification for infinite sets of equations between finite terms
• Generalizations of unification
• Infinite set unification with application to categorial grammar
• scientific article; zbMATH DE number 4110161
• scientific article; zbMATH DE number 68600

Cites work

• Complete sets of transformations for general E-unification
• Fundamental properties of infinite trees
• On the computational power of pushdown automata

Cited in

(6)

• Continuous monoids and yields of infinite trees
• scientific article; zbMATH DE number 68600 (Why is no real title available?)
• scientific article; zbMATH DE number 6680130 (Why is no real title available?)
• scientific article; zbMATH DE number 4110161 (Why is no real title available?)
• Some Wellfounded Trees in UniMath
• Representations of infinite tree sets

This page was built for publication: Unification of kinded infinite trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352126)