
Conferences in DBLP
 Franco Barbanera, Stefano Berardi
A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:123 [Conf]
 François Bergeron, Philippe Flajolet, Bruno Salvy
Varieties of Increasing Trees. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:2448 [Conf]
 Yves Bertot
Origin Functions in LambdaCalculus and Term Rewriting Systems. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:4965 [Conf]
 Felice Cardone
An Algebraic Approach to the Interpretation of Recursive Types. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:6685 [Conf]
 AnneCécile Caron
Decidability of Reachability and Disjoint Union of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:86101 [Conf]
 Mario Coppo, Paola Giannini
A Complete Type Inference Algorithm for Simple Intersection Types. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:102123 [Conf]
 Bruno Courcelle
Monadic SecondOrder Graph Transductions. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:124144 [Conf]
 Mads Dam
CTL* and ECTL* as Fragments of the Modal µCalculus. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:145164 [Conf]
 Reinhold Heckmann
Power Domains Supporting Recursion and Failure. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:165181 [Conf]
 WenJing Hsu, Carl V. Page, J. Liu
Parallel Contraction of Fibonacci Trees and Prefix Computations on a Family of Interconnection Topologies. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:182202 [Conf]
 Ugo de'Liguoro, Adolfo Piperno
Must Preorder in NonDeterministic Untyped LambdaCalculus. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:203220 [Conf]
 Andrea MaggioloSchettini, Józef Winkowski
A Programming Language for Deriving Hypergraphs. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:221231 [Conf]
 Ugo Montanari, Francesca Rossi
Graph Grammars as ContextDependent Rewriting Systems: A Partial Ordering Semantics. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:232247 [Conf]
 Wuxu Peng, S. Purushothaman
Empty Stack Pushdown OmegaTree Automata. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:248264 [Conf]
 Andreas Potthoff
Modulo Counting Quantifiers Over Finite Trees. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:265278 [Conf]
 Helmut Seidl
Finite Tree Automata with Cost Functions. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:279299 [Conf]
 Steffen van Bakel, Sjaak Smetsers, Simon Brock
Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:300321 [Conf]
 Bart Vergauwen, Johan Lewi
A Linear Algorithm for Solving FixedPoint Equations on Transition Systems. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:322341 [Conf]
 Uwe Wolter, Michael Löwe
Beyond Conditional Equations: QuasiInitial Semantics for Parametric Algebraic Specifications. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:342361 [Conf]
