Computer science logic : 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996 : selected papers
著者
書誌事項
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, 1258）
Springer, c1997
大学図書館所蔵 件 / 全53件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より