Del i serien Lecture Notes in Computer Science

Computer Science Logic

11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers

Häftad, Engelska, 1998

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997.The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state of the art in the area.

Produktinformation

Utgivningsdatum1998-05-20
Mått155 x 235 x 29 mm
Vikt791 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor520
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540645702

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Call-by-value games.- LISA: A specification language based on WS2S.- Evolution as a computational engine.- Timeless games.- From action calculi to linear logic.- A sequent calculus for circumscription.- Linear lower bounds and simulations in frege systems with substitutions.- A formulation of linear logic based on dependency-relations.- Resolution and the weak pigeonhole principle.- Higher-order matching and tree automata.- A proof-theoretical investigation of Zantema's problem.- Spectra with only unary function symbols.- Classical proofs via basic logic.- Canonization for Lk-equivalence is Hard.- Full abstractness for a functional/concurrent language with higher-order value-passing.- A duality theory for quantitative semantics.- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion.- Equational axioms of test algebra.- Mona & Fido: The logic-automaton connection in practice.- Existence of reduction hierarchies.- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion.- A conjunctive logical characterization of nondeterministic linear time.- On the computational complexity of type 2 functionals.- Categories with algebraic structure.- Concurrent constraint programming and non-commutative logic.- A hierarchical approach to monadic second-order logic over graphs.- The monadic quantifier alternation hierarchy over grids and pictures.- Padding and the expressive power of existential second-order logics.- Rich ?-words and monadic second-order arithmetic.- A simple ordinal recursive normalization of Gödel's T.

Du kanske också är intresserad av

CONCUR 2001 - Concurrency Theory

Kim G. Larsen, Mogens Nielsen

Häftad, 2001

719 kr

Automata, Languages and Programming

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas

Häftad, 2009

1 439 kr

STACS 2006

Bruno Durand, Wolfgang Thomas

Häftad, 2006

1 479 kr

TAPSOFT '95: Theory and Practice of Software Development

Peter D. Mosses, Mogens Nielsen, Michael I. Schwartzbach

Häftad, 1995

1 479 kr

Application and Theory of Petri Nets 2000

Mogens Nielsen, Dan Simpson

Häftad, 2000

739 kr

Foundations of Software Science and Computation Structures

Mogens Nielsen, Uffe Engberg

Häftad, 2002

739 kr

Mathematical Foundations of Computer Science 2000

Mogens Nielsen, Branislav Rovan

Häftad, 2000

1 479 kr

SOFSEM 2009: Theory and Practice of Computer Science

Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia

Häftad, 2009

1 479 kr

Del 291

Mathematical Logic

Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas

Häftad, 2022

719 kr

Automata, Languages and Programming

Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen

Häftad, 1999

1 479 kr

Del i serien Lecture Notes in Computer Science

Computer Science Logic

11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers

Häftad, Engelska, 1998

AvMogens Nielsen,Wolfgang Thomas

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1998-05-20
Mått155 x 235 x 29 mm
Vikt791 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor520
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540645702

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Call-by-value games.- LISA: A specification language based on WS2S.- Evolution as a computational engine.- Timeless games.- From action calculi to linear logic.- A sequent calculus for circumscription.- Linear lower bounds and simulations in frege systems with substitutions.- A formulation of linear logic based on dependency-relations.- Resolution and the weak pigeonhole principle.- Higher-order matching and tree automata.- A proof-theoretical investigation of Zantema's problem.- Spectra with only unary function symbols.- Classical proofs via basic logic.- Canonization for Lk-equivalence is Hard.- Full abstractness for a functional/concurrent language with higher-order value-passing.- A duality theory for quantitative semantics.- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion.- Equational axioms of test algebra.- Mona & Fido: The logic-automaton connection in practice.- Existence of reduction hierarchies.- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion.- A conjunctive logical characterization of nondeterministic linear time.- On the computational complexity of type 2 functionals.- Categories with algebraic structure.- Concurrent constraint programming and non-commutative logic.- A hierarchical approach to monadic second-order logic over graphs.- The monadic quantifier alternation hierarchy over grids and pictures.- Padding and the expressive power of existential second-order logics.- Rich ?-words and monadic second-order arithmetic.- A simple ordinal recursive normalization of Gödel's T.