A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

DOI10.1017/S1471068403001868zbMath1088.68027WikidataQ60501149 ScholiaQ60501149MaRDI QIDQ4669646

Enea Zaffanella, Roberto Bagnara, Patricia M. Hill

Publication date: 15 April 2005

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

logic programming; abstract unification

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N17: Logic programming