Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version. Authors:Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea ...
Sep 15, 2004 · Zaffanella, Finite-tree analysis for constraint logic-based languages: The complete unabridged version, Quaderno 363, Dipartimento di ...
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the ...
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification ...
Missing: Unabridged | Show results with:Unabridged
Finite-tree analysis is proposed aimed at identifying those program variables (the finite variables) that are not currently bound to infinite terms, ...
Missing: Unabridged | Show results with:Unabridged
Abstract. Logic languages based on the theory of rational, possibly in- finite, trees have much appeal in that rational trees allow for faster unifi-.
Missing: Unabridged | Show results with:Unabridged
Finite-tree analysis for constraint logic-based languages
www.sciencedirect.com › article › pii › pdf
May 28, 2004 · The second component of the finite-tree domain should maintain any kind of information that may be useful for computing finiteness information.
Applications of rational trees in logic programming include graphics [6], parser generation and grammar manipulation [1,7], and computing with finite-state.
Zaffanella, Finite-tree analysis for constraint logic-based languages: The complete unabridged version ... Full text. 2006, Functional and Logic Programming ...
Bibliographic details on Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version.