Category:LNCS 1059

From BibNetWiki

Lecture Notes in Computer Science, Volume 1059

Articles in category "LNCS 1059"

There are 24 articles in this category.

A A Pumping Lemma for Output Languages of Macro Tree Transducers An Ordinal Calculus for Proving Termination in Term Rewriting Axiomatising Extended Computation Tree Logic B Behavioural Satisfaction and Equivalence in Concrete Model Categories C Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations Confluence without Termination via Parallel Critical Pairs D Denotational, Causal, and Operational Determinism in Event Structures Diophantine Equations, Presburger Arithmetic and Finite Automata

E Effective Longest and Infinite Reduction Paths in Untyped lambda-Calculi Extraction of Concurrent Processes from Higher Dimensional Automata F Final Semantics for a Higher Order Concurrent Language Full Abstraction for Lambda Calculus with Resources and Convergence Testing I Interaction Nets and Term Rewriting Systems Iterative Pairs and Multitape Automata O Open Maps, Behavioural Equivalences, and Congruences R Relative Normalization in Deterministic Residual Structures S Semantics of Interaction

S cont. Subsumption Algorithms Based on Search Trees T Termination by Absence of Infinite Chains of Dependency Pairs The Area Determined by Underdiagonal Lattice Paths The Kronecker Product and Local Computations in Graphs The Practice of Logical Framework Trees in algebra and programming-CAAP '96: 21st international colloquium, Linkoping, Sweden, April 22-24, 1996, proceedings U Untyped Lambda-Calculus with Input-Output