B. Courcelle, Fundamental properties of in nite trees, Theoret. Comput. Sci. 25 (2) (1983) 95-169. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Theory of Structural Subtyping - Kuncak, Rinard (2003) (Correct)
.... The decidability of the rst order theory of term algebras follows from Mal cev s work on locally free algebras [31, Chapter 23] 39] also gives an argument for decidability of term algebra and presents a uni cation algorithm based on congruence closure [38] In nite trees are studied in [12]. 30] presents a complete axiomatization for algebra of nite, in nite and rational trees. A proof in the style of [22] for an extension of free algebra with queues is presented in [43] Decidability of an extension of term algebras with membership tests is presented in [10] in the form of a ....
....subtyping. 45 We de ne the rst order structure of structural subtyping of recursive types similarly to the corresponding structure for non recursive types in Section 4; the only di erence is that the domain contains both nite and in nite terms. In nite terms correspond to in nite trees [12, 30]. We de ne in nite trees as follows. We use alphabet fl; rg to denote paths in the tree. A tree domain D is a nite or in nite subset of the set fl; rg 1. D is pre x closed: if w 2 fl; rg , x 2 fl; rg then w x 2 D implies w 2 D; 2. if w 2 D then exactly one of the following two ....
[Article contains additional citation context not shown here]
Bruno Courcelle. Fundamental properties of in nite trees. Theoretical Computer Science, 25(2):95-169, March 1983.
The Evaluation of First-Order Substitution is Monadic.. - Courcelle, Knapik Self-citation (Courcelle) (Correct)
.... , hence several structures S such that R (S ) S. But the structures g(S ) are all isomorphic. Although the transduction S 7 S= is deterministic, we need a parameter for de ning it as an MS transduction. 2 2. 2 Finite and in nite terms We review de nitions and notation from [3,11,12]. We let F be a nite set of function symbols, each of them, f , given with an arity (f) 2 N. We let X be a nite set of variables. We denote by T (F; X) resp. T (F; X) the set of nite (resp. nite or in nite) well formed terms written over F [ X. We let k F = Maxf (f) j f 2 Fg and F k = ff ....
....order and m is monotone, 7 by letting: m(t 1 ; t k ) sup n 0 (m(t k ) In this way we de ne an continuous mapping m : T D that extends m. continuous means monotone and continuous over in nite increasing sequences , sometimes also called chains ; see [3 5,11]) 2.3 Graphs All graphs will be directed and at most countable. An edge e of a graph G has a source src G (e) a target tgt G (e) and a label in a nite set of edge labels, usually denoted by A. All graphs will be simple which means that no two edges have same source, same target and same ....
[Article contains additional citation context not shown here]
B. Courcelle. Fundamental properties of in nite trees. Theoretical Comput. Sci., 25:95-169, 1983. 34
Induction, Coinduction, and Adjoints - Cockett, Santocanale (2002) (Correct)
No context found.
B. Courcelle, Fundamental properties of in nite trees, Theoret. Comput. Sci. 25 (2) (1983) 95-169.
A Verified Compiler for VLISP PreScheme - Oliva, Ramsdell, Wand (1993) (Correct)
No context found.
Courcelle, Bruno. Fundamental properties of in nite trees. Theoretical Computer Science, 25 (1983) 95-169.
Logical Construction of Final Coalgebras - Santocanale (2003) (Correct)
No context found.
B. Courcelle. Fundamental properties of in nite trees. Theoret. Comput. Sci., 25(2):95-169, 1983.
LISP AND SYMBOLIC COMPUTATION: An International Journal.. - Results And Conclusions (Correct)
No context found.
Bruno Courcelle. Fundamental properties of in nite trees. Theoretical Computer Science, 25:95-169, 1983.
The Definition of the NSP Type System - Draheim, Fehr, Weber (2002) (Correct)
No context found.
Bruno Courcelle. Fundamental Properties of In nite Trees. In: Theoretical Computer Science 25, pp.95-169. Norh-Holland Publishing Company, 1983.
Polytypic Programming with Ease - Hinze (2001) (8 citations) (Correct)
No context found.
Bruno Courcelle. Fundamental properties of in nite trees. Theoretical Computer Science, 25(2):95-169, March 1983.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC