1 option
Computer Science Logic : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / edited by Mogens Nielsen, Wolfgang Thomas.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1414.
- Lecture Notes in Computer Science, 0302-9743 ; 1414
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Computer architecture.
- Logic, Symbolic and mathematical.
- Computer logic.
- Artificial Intelligence.
- Computer System Implementation.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Mathematical Logic and Foundations.
- Local Subjects:
- Artificial Intelligence.
- Computer System Implementation.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Mathematical Logic and Foundations.
- Physical Description:
- 1 online resource (VIII, 520 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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 and 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69353-6
- 9783540693536
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.