Search results for "CAAP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Björn Lisper	Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations.	CAAP	1996	DBLP DOI BibTeX RDF	reduction systems, recursive program schemes, program transformations, formal semantics, nondeterminism
1	Morten Heine Sørensen	Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi.	CAAP	1996	DBLP DOI BibTeX RDF	reduction strategies, effectiveness, calculus
1	Yukihide Takayama	Extraction of Concurrent Processes from Higher Dimensional Automata.	CAAP	1996	DBLP DOI BibTeX RDF	higher dimensional automata, geometric topology, process algebra
1	Maribel Fernández, Ian Mackie	Interaction Nets and Term Rewriting Systems (Extended Abstract).	CAAP	1996	DBLP DOI BibTeX RDF
1	John R. W. Glauert, Zurab Khasidashvili	Relative Normalization in Deterministic Residual Structures.	CAAP	1996	DBLP DOI BibTeX RDF
1	Samson Abramsky	Semantics of Interaction (Abstract).	CAAP	1996	DBLP DOI BibTeX RDF
1	Bernhard Gramlich	Confluence without Termination via Parallel Critical Pairs.	CAAP	1996	DBLP DOI BibTeX RDF
1	Thomas Arts	Termination by Absence of Infinite Chains of Dependency Pairs.	CAAP	1996	DBLP DOI BibTeX RDF
1	E. A. Cichon, Hélène Touzet	An Ordinal Calculus for Proving Termination in Term Rewriting.	CAAP	1996	DBLP DOI BibTeX RDF	ordinal recursion, termination, rewrite systems, primitive recursion
1	Gérard Boudol, Carolina Lavatelli	Full Abstraction for Lambda Calculus with Resources and Convergence Testing.	CAAP	1996	DBLP DOI BibTeX RDF	intersection type systems, calculus, full abstraction
1	Frank Pfenning	The Practice of Logical Frameworks.	CAAP	1996	DBLP DOI BibTeX RDF
1	Alexandre Boudet, Hubert Comon	Diophantine Equations, Presburger Arithmetic and Finite Automata.	CAAP	1996	DBLP DOI BibTeX RDF
1	Roope Kaivola	Axiomatising Extended Computation Tree Logic.	CAAP	1996	DBLP DOI BibTeX RDF
1	Allan Cheng, Mogens Nielsen	Open Maps, Behavioural Equivalences, and Congruences.	CAAP	1996	DBLP DOI BibTeX RDF	Open maps, P-bisimilarity, P-factorisability, process algebra, category theory, congruences
1	Hélène Kirchner (eds.)	Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings	CAAP	1996	DBLP DOI BibTeX RDF
1	Arend Rensink	Denotational, Causal, and Operational Determinism in Event Structures.	CAAP	1996	DBLP DOI BibTeX RDF	partial order models, trees, determinism, event structures, concurrent languages, behavioural models
1	Anne Bottreau, Yves Métivier	The Kronecker Product and Local Computations in Graphs.	CAAP	1996	DBLP DOI BibTeX RDF	Cut-edge, Cut-vertex, k-covering, Local computations on graphs, The Kronecker product, Planar, Subgraph, Minor
1	Armin Kühnemann	A Pumping Lemma for Output Languages of Macro Tree Transducers.	CAAP	1996	DBLP DOI BibTeX RDF	Macro tree transducer, Pumping Lemma, Primitive Recursion
1	Leo Bachmair, Ta Chen, C. R. Ramakrishnan 0001, I. V. Ramakrishnan	Subsumption Algorithms Based on Search Trees.	CAAP	1996	DBLP DOI BibTeX RDF
1	Michel Bidoit, Andrzej Tarlecki	Behavioural Satisfaction and Equivalence in Concrete Model Categories.	CAAP	1996	DBLP DOI BibTeX RDF
1	Marina Lenisa	Final Semantics for a Higher Order Concurrent Language.	CAAP	1996	DBLP DOI BibTeX RDF	second order assignment, F-coalgebra, F-bisimulation, final semantics, hyperset, complete metric space, mixed induction-coinduction, operational semantics, coinduction
1	Jerzy Tiuryn, Mitchell Wand	Untyped Lambda-Calculus with Input-Output.	CAAP	1996	DBLP DOI BibTeX RDF
1	Marina Madonia, Stefano Varricchio	Iterative Pairs and Multitape Automata.	CAAP	1996	DBLP DOI BibTeX RDF
1	Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri	The Area Determined by Underdiagonal Lattice Paths.	CAAP	1996	DBLP DOI BibTeX RDF	underdiagonal lattice paths, average area, first passage decomposition, generating functions, context-free grammars
1	Javier Esparza	On the Decidability of Model Checking for Several µ-calculi and Petri Nets.	CAAP	1994	DBLP DOI BibTeX RDF
1	Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo	Compilative Constructive Negation in Constraint Logic Programs.	CAAP	1994	DBLP DOI BibTeX RDF
1	Hubert Comon, Ralf Treinen	Ordering Constraints on Trees.	CAAP	1994	DBLP DOI BibTeX RDF
1	Nils Klarlund, Michael I. Schwartzbach	Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract).	CAAP	1994	DBLP DOI BibTeX RDF
1	Yves Métivier, Nasser Saheb	Probabilistic Analysis of an Election Algorithm in a Tree.	CAAP	1994	DBLP DOI BibTeX RDF	Labelled Graphs, Tree, Probabilistic analysis, Election, Median
1	Zurab Khasidashvili	On Higher Order Recursive Program Schemes.	CAAP	1994	DBLP DOI BibTeX RDF
1	Dietrich Kuske	Nondeterministic Automata with Concurrency Relations and Domains.	CAAP	1994	DBLP DOI BibTeX RDF
1	Bodonirina Ratoandromanana, Denis Robilliard	Superposition in Picture Languages.	CAAP	1994	DBLP DOI BibTeX RDF
1	Frank Drewes	A Lower Bound on the Growth of Functions Computed by Tree Transductions.	CAAP	1994	DBLP DOI BibTeX RDF
1	Reinhold Heckmann	Probabilistic Domains.	CAAP	1994	DBLP DOI BibTeX RDF
1	Jens Palsberg	Flobal Program Analysis in Constraint Form.	CAAP	1994	DBLP DOI BibTeX RDF
1	Fabio Alessi	Type Preorders.	CAAP	1994	DBLP DOI BibTeX RDF
1	Alain Cournier, Michel Habib	A New Linear Algorithm for Modular Decomposition.	CAAP	1994	DBLP DOI BibTeX RDF	autonomous subsets, clans, graph decomposition trees, vertex-splitting. cotrees, Graphs, modules, substitution, cographs, prime graphs
1	Thomas Noll 0001	On the First-Order Equivalence of Call-by-Name and Call-by-Value.	CAAP	1994	DBLP DOI BibTeX RDF
1	Joost Engelfriet	Graph Grammars and Tree Transducers.	CAAP	1994	DBLP DOI BibTeX RDF
1	Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri	Algebraic and Combinatorial Properties of Simple, Coloured Walks.	CAAP	1994	DBLP DOI BibTeX RDF
1	Dieter Hofbauer, Maria Huber, Gregory Kucherov	Some Results on Top-Context-Free Tree Languages.	CAAP	1994	DBLP DOI BibTeX RDF
1	Enno Ohlebusch	On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems.	CAAP	1994	DBLP DOI BibTeX RDF
1	Owen Rambow, Giorgio Satta	A Rank Hierarchy for Determinsitic Tree-Walking Transducers.	CAAP	1994	DBLP DOI BibTeX RDF
1	Raffaele Giancarlo, Filippo Mignosi	Generalizations of the Periodicity Theorem of Fine and Wilf.	CAAP	1994	DBLP DOI BibTeX RDF
1	Morten Heine Sørensen	Grammar-Based Data-Flow Analysis to Stop Deforestation.	CAAP	1994	DBLP DOI BibTeX RDF
1	Sophie Tison (eds.)	Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings	CAAP	1994	DBLP DOI BibTeX RDF
1	Doron A. Peled	On Projective and Separable Properties.	CAAP	1994	DBLP DOI BibTeX RDF
1	Philippe de Groote	A CPS-Translation of the Lambda-µ-Calculus.	CAAP	1994	DBLP DOI BibTeX RDF
1	Yves Bertot	Origin Functions in Lambda-Calculus and Term Rewriting Systems.	CAAP	1992	DBLP DOI BibTeX RDF
1	Jean-Claude Raoult (eds.)	CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings	CAAP	1992	DBLP DOI BibTeX RDF
1	Bart Vergauwen, Johan Lewi	A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems.	CAAP	1992	DBLP DOI BibTeX RDF	model checking, modal logics, transition systems
1	Bruno Courcelle	Monadic Second-Order Graph Transductions.	CAAP	1992	DBLP DOI BibTeX RDF
1	Mads Dam	CTL* and ECTL* as Fragments of the Modal µ-Calculus.	CAAP	1992	DBLP DOI BibTeX RDF
1	Wuxu Peng, S. Purushothaman	Empty Stack Pushdown Omega-Tree Automata.	CAAP	1992	DBLP DOI BibTeX RDF
1	Helmut Seidl	Finite Tree Automata with Cost Functions.	CAAP	1992	DBLP DOI BibTeX RDF
1	François Bergeron, Philippe Flajolet, Bruno Salvy	Varieties of Increasing Trees.	CAAP	1992	DBLP DOI BibTeX RDF
1	Wen-Jing Hsu, Carl V. Page, Jen-Shiuh Liu	Parallel Contraction of Fibonacci Trees and Prefix Computations on a Family of Interconnection Topologies.	CAAP	1992	DBLP DOI BibTeX RDF
1	Andreas Potthoff	Modulo Counting Quantifiers Over Finite Trees.	CAAP	1992	DBLP DOI BibTeX RDF
1	Ugo de'Liguoro, Adolfo Piperno	Must Preorder in Non-Deterministic Untyped Lambda-Calculus.	CAAP	1992	DBLP DOI BibTeX RDF
1	Anne-Cécile Caron	Decidability of Reachability and Disjoint Union of Term Rewriting Systems.	CAAP	1992	DBLP DOI BibTeX RDF
1	Franco Barbanera, Stefano Berardi	A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction.	CAAP	1992	DBLP DOI BibTeX RDF
1	Reinhold Heckmann	Power Domains Supporting Recursion and Failure.	CAAP	1992	DBLP DOI BibTeX RDF
1	Steffen van Bakel, Sjaak Smetsers, Simon Brock	Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems.	CAAP	1992	DBLP DOI BibTeX RDF
1	Uwe Wolter, Michael Löwe	Beyond Conditional Equations: Quasi-Initial Semantics for Parametric Algebraic Specifications.	CAAP	1992	DBLP DOI BibTeX RDF
1	Felice Cardone	An Algebraic Approach to the Interpretation of Recursive Types.	CAAP	1992	DBLP DOI BibTeX RDF
1	Mario Coppo, Paola Giannini	A Complete Type Inference Algorithm for Simple Intersection Types.	CAAP	1992	DBLP DOI BibTeX RDF
1	Andrea Maggiolo-Schettini, Józef Winkowski	A Programming Language for Deriving Hypergraphs.	CAAP	1992	DBLP DOI BibTeX RDF
1	Ugo Montanari, Francesca Rossi 0001	Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics.	CAAP	1992	DBLP DOI BibTeX RDF
1	Guy Louchard, René Schott	Probabilistic Analysis of Some Distributed Algorithms.	CAAP	1990	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Jean Néraud	Unitary Monoid with Two Generators: An Algorithmic Point of View.	CAAP	1990	DBLP DOI BibTeX RDF
1	Gérard Boudol, Kim Guldstrand Larsen	Graphical versus Logical Specifications.	CAAP	1990	DBLP DOI BibTeX RDF
1	Jiazhen Cai, Robert Paige, Robert Endre Tarjan	More Efficient Bottom-Up Tree Pattern Matching.	CAAP	1990	DBLP DOI BibTeX RDF
1	Xavier Gérard Viennot	Trees Everywhere.	CAAP	1990	DBLP DOI BibTeX RDF
1	Helmut Seidl	Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.	CAAP	1990	DBLP DOI BibTeX RDF
1	Marco Bellia, Michele Bugliesi, M. Eugenia Occhiuto	Combinatory Forms for Equational Programming: Instances, Unification and Narrowing.	CAAP	1990	DBLP DOI BibTeX RDF
1	Didier Caucal	On the Regular Structure of Prefix Rewriting.	CAAP	1990	DBLP DOI BibTeX RDF
1	Kristoffer Høgsbro Holm	Graph Matching in Operational Semantics and Typing.	CAAP	1990	DBLP DOI BibTeX RDF
1	Tirza Hirst, David Harel	On the Power of Bounded Concurrency II: The Pushdown Automata Level.	CAAP	1990	DBLP DOI BibTeX RDF
1	Pierre-Louis Curien, Giorgio Ghelli	Coherence of Subsumption.	CAAP	1990	DBLP DOI BibTeX RDF
1	Gian-Luigi Ferrari 0002, Ugo Montanari	Towards the Unification of Models for Concurrency.	CAAP	1990	DBLP DOI BibTeX RDF
1	Michael I. Schwartzbach	Infinite Values in Hierarchical Imperative Types.	CAAP	1990	DBLP DOI BibTeX RDF
1	A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn	ML Typability is DEXTIME-Complete.	CAAP	1990	DBLP DOI BibTeX RDF
1	Uffe Engberg, Glynn Winskel	Petri Nets as Models of Linear Logic.	CAAP	1990	DBLP DOI BibTeX RDF
1	Dominique Geniet, René Schott, Loÿs Thimonier	A Markovian Concurrency Measure.	CAAP	1990	DBLP DOI BibTeX RDF
1	Edmund M. Clarke, Anca Browne, Robert P. Kurshan	A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata.	CAAP	1990	DBLP DOI BibTeX RDF
1	André Arnold (eds.)	CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings	CAAP	1990	DBLP DOI BibTeX RDF
1	Emmanuel Kounalis	Testing for Inductive (Co)-Reducibility.	CAAP	1990	DBLP DOI BibTeX RDF	Proof by consistency, Ground terms in normal form, Term rewriting systems, Test Sets, Equations
1	Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner	Equational Completion in Order-Sorted Algebras (Extended Abstract).	CAAP	1988	DBLP DOI BibTeX RDF
1	Kim Guldstrand Larsen	Proof System for Hennessy-Milner Logic with Recursion.	CAAP	1988	DBLP DOI BibTeX RDF
1	Bernhard Möller, Andrzej Tarlecki, Martin Wirsing	Algebraic Specification with Built-in Domain Constructions.	CAAP	1988	DBLP DOI BibTeX RDF
1	Jochen Burghardt	A Tree Pattern Matching Algorithm with Reasonable Space Requirements.	CAAP	1988	DBLP DOI BibTeX RDF
1	Max Michel, Jean-Bernard Stefani	Interval Logics and Sequential Transducers.	CAAP	1988	DBLP DOI BibTeX RDF
1	Clemens Lautemann	Decomposition Trees: Structured Graph Representation and Efficient Algorithms.	CAAP	1988	DBLP DOI BibTeX RDF
1	Jean Françon, B. Randrianarimanana, René Schott	Analysis of Dynamic Algorithms in D. E. Knuth's Model.	CAAP	1988	DBLP DOI BibTeX RDF
1	Giorgio Ausiello	Directed Hypergraphs: Data Structures and Applications.	CAAP	1988	DBLP DOI BibTeX RDF
1	Roberto Gorrieri, Sergio Marchetti, Ugo Montanari	A²CCS: A Simple Extension of CCS for Handling Atomic Actions.	CAAP	1988	DBLP DOI BibTeX RDF
1	Jennifer Widom, Prakash Panangaden	Expressiveness Bounds for Completness in Trace-Based Network Proof Systems.	CAAP	1988	DBLP DOI BibTeX RDF
1	Helmut Seidl	Parameter-Reduction of Higher Level Grammars (Extended Abstract).	CAAP	1988	DBLP DOI BibTeX RDF
1	Richard Kennaway	Implementing Term Rewritin Languages in Dactl.	CAAP	1988	DBLP DOI BibTeX RDF
1	Johannes Köbler, Uwe Schöning, Jacobo Torán	On Counting and Approximation.	CAAP	1988	DBLP DOI BibTeX RDF

Publications at "CAAP"( http://dblp.L3S.de/Venues/CAAP )