Computer science logic : 15th International Workshop, CSL 2001, 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 : proceedings
著者
書誌事項
Computer science logic : 15th International Workshop, CSL 2001, 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 : proceedings
(Lecture notes in computer science, 2142)
Springer, c2001
大学図書館所蔵 全30件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
The Annual Conference of the European Association for Computer Science Logic, CSL 2001, was held in Paris, Palais de la Mutualit' e, on September 10-13, 2001. This was the 15th in a series of annual meetings, originally intended as International Workshops on Computer Science Logic, and the 10th to be held as the Annual Conference of the EACSL. The conference was organized by La- ratoire Sp' eci?cation et V' eri?cation (CNRS & ENS Cachan). The CSL 2001 program committee selected 39 of 91 submitted papers for presentation at the conference and publication in this proceedings volume. The submittedpapersoriginatedfrom26di?erentcountries.Eachpaperwasrefereed by at least three reviewers. In addition to the contributed papers, the scienti?c program of CSL 2001 - cluded three invited talks (Jean-Yves Girard, Peter O'Hearn, and Jan Van den Bussche). This volume includes the papers provided by the invited speakers as well as the selected contributed papers. The topics of the papers include: linear logic, descriptive complexity, semantics, higher-order programs, modal logics, veri?cation, automata, ?-calculus, induction, equational calculus, and constr- tive theory of types.
I am most grateful to the members of the program committee and all the referees for their thorough work. I am also particularly indebted to Fran, cois Laroussinie, helped by Patricia Bouyer, Nicolas Markey, and Philippe Schn- belen, for the successful organization of this event. Special thanks to Emmanuel Fleury for the design of the beautiful "Notre-Dame de Paris" poster.
目次
Invited Papers.- Local Reasoning about Programs that Alter Data Structures.- Applications of Alfred Tarski's Ideas in Database Theory.- Locus Solum: From the Rules of Logic to the Logic of Rules.- Contributed Papers.- The Expressive Power of Horn Monadic Linear Logic.- Non-commutativity and MELL in the Calculus of Structures.- Quadratic Correctness Criterion for Non-commutative Logic.- Descriptive Complexity.- Capture Complexity by Partition.- An Existential Locality Theorem.- Actual Arithmetic and Feasibility.- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group.- Semantics.- An Algebraic Foundation for Higraphs.- Semantic Characterisations of Second-Order Computability over the Real Numbers.- An Abstract Look at Realizability.- The Anatomy of Innocence.- Higher-Order Programs.- An Improved Extensionality Criterion for Higher-Order Logic Programs.- A Logic for Abstract State Machines.- Constrained Hyper Tableaux.- Modal Logics.- Modal Logic and the Two-Variable Fragment.- A Logic for Approximate First-Order Reasoning.- Inflationary Fixed Points in Modal Logic.- Categorical and Kripke Semantics for Constructive S4 Modal Logic.- Verification.- Labelled Natural Deduction for Interval Logics.- Decidable Navigation Logics for Object Structures.- The Decidability of Model Checking Mobile Ambients.- Automata.- A Generalization of the Buchi-Elgot-Trakhtenbrot Theorem.- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.- Decision Procedure for an Extension of WS1S.- Lambda-Calculus.- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic.- Intersection Logic.- Life without the Terminal Type.- Fully Complete Minimal PER Models for the Simply Typed ?-Calculus.- Induction.- A Principle of Induction.- On a Generalisation of Herbrand's Theorem.- Well-Founded Recursive Relations.- Equational Calculus.- Stratified Context Unification Is in PSPACE.- Uniform Derivation of Decision Procedures by Superposition.- Complete Categorical Equational Deduction.- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.- Constructive Theory of Types.- Normalized Types.- Markov's Principle for Propositional Type Theory.- Recursion for Higher-Order Encodings.- Monotone Inductive and Coinductive Constructors of Rank 2.
「Nielsen BookData」 より