21st International Colloquium Linköping, Sweden, April 22-24, 1996 Proceedings
نام نخستين پديدآور
edited by Hélène Kirchner.
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Berlin, Heidelberg
نام ناشر، پخش کننده و غيره
Springer Berlin Heidelberg
تاریخ نشرو بخش و غیره
1996
مشخصات ظاهری
نام خاص و کميت اثر
(VIII, 336 p. :)
فروست
عنوان فروست
Lecture notes in computer science, 1059.
یادداشتهای مربوط به مندرجات
متن يادداشت
Semantics of interaction --; The Kronecker product and local computations in graphs --; Iterative pairs and multitape automata --; Diophantine equations, Presburger arithmetic and finite automata --; A pumping lemma for output languages of macro tree transducers --; The area determined by underdiagonal lattice paths --; Extraction of concurrent processes from higher dimensional automata --; Axiomatising extended computation tree logic --; Final semantics for a higher order concurrent language --; The practice of logical frameworks --; Subsumption algorithms based on search trees --; Interaction nets and term rewriting systems (extended abstract) --; Computing in unpredictable environments: Semantics, reduction strategies, and program transformations --; Relative normalization in Deterministic Residual Structures --; Termination by absence of infinite chains of dependency pairs --; Confluence without termination via parallel critical pairs --; An ordinal calculus for proving termination in term rewriting --; Behavioural satisfaction and equivalence in concrete model categories --; Open maps, behavioural equivalences, and congruences --; Denotational, causal, and operational determinism in event structures --; Effective longest and infinite reduction paths in untyped ?-calculi --; Full abstraction for lambda calculus with resources and convergence testing --; Untyped lambda-calculus with input-output.
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
This book constitutes the refereed proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP '96, held in Linköping, Sweden, in April 1996. The 21 full revised papers presented were selected from 44 submissions; also included are invited papers by Samson Abramsky and Frank Pfenning. In keeping with the tradition of the CAAP conferences, this volume covers algebraic, logical, and combinatorial properties of discrete structures and their application to computer science, in particular to the theory of computation and to programming theory.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Computer programming.
موضوع مستند نشده
Computer science.
موضوع مستند نشده
Programming languages (Electronic computers)
رده بندی کنگره
شماره رده
QA166
.
2
نشانه اثر
E358
1996
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )