Cantitate/Preț
Produs

Computer Science Logic: 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21 - 27, 1996, Selected Papers: Lecture Notes in Computer Science, cartea 1258

Editat de Dirk Van Dalen, Marc Bezem
en Limba Engleză Paperback – 18 iun 1997
This book constitutes the strictly refereed post-workshop proceedings of the 10th International Workshop on Computer Science Logic, CSL'96, held as the 5th Annual Conference of the European Association of Computer Science Logic (EACSL), in Utrecht, The Netherlands, in September 1996.
The volume presents 26 revised full papers selected from a total of initially 75 papers submitted; also included are two refereed invited contributions. The volume addresses all current issues in the area of computer science logic research, and is thus a unique record of recent progress in the area.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32895 lei

Preț vechi: 41119 lei
-20% Nou

Puncte Express: 493

Preț estimativ în valută:
6296 6642$ 5247£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540631729
ISBN-10: 3540631720
Pagini: 488
Ilustrații: IX, 479 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.68 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Four-valued diagnoses for stratified knowledge-bases.- Fast cut-elimination by projection.- On the subject reduction property for algebraic type systems.- Presheaf models for concurrency.- Directed virtual reductions.- Bounded-variable fixpoint queries are PSPACE-complete.- Graph rewriting semantics for functional programming languages.- An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory.- Relative undecidability in term rewriting.- Extending models of second order predicate logic to models of second order dependent type theory.- Eta-expansions in F ?.- Cut-free display calculi for relation algebras.- Computational aspects of arity hierarchies.- Weak semantics based on lighted button pressing experiments.- Kleene algebra with tests: Completeness and decidability.- Monadic NP and built-in trees.- Coercive subtyping in type theory.- Proofs in system F ? can be done in system F ? 1 .- Optimization problems with approximation schemes.- Computational representations of herbrand models using grammars.- Exact pairs for abstract bounded reducibilities.- The logic of explicitly presentation-invariant circuits.- Social confluence in client-server systems.- A type-free resource-aware ?-calculus.- Inductive definitions with decidable atomic formulas.- Call-by-Value, call-by-name and the logic of values.- On Cartesian monoids.- New intuitionistic logical constants: Undecidability of the conservativeness problem.