7. LICS 1992: Santa Cruz, California, USA
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), Santa Cruz, California, USA, June 22-25, 1992. IEEE Computer Society 1992 ISBN 0-8186-2735-2- Gilles Dowek: Third Order Matching is Decidable. 2-10
- Deepak Kapur, Paliath Narendran: Double-exponential Complexity of Computing a Complete Set of AC-Unifiers. 11-21
- Grigori Schwarz: Minimal Model Semantics for Nonmonotonic Modal Logics. 34-43
- Phokion G. Kolaitis, Moshe Y. Vardi: Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory. 46-57
- Alexei P. Stolboushkin: Axiomatizable Classes of Finite Models and Definability of Linear Order. 64-70
- Hiroshi Nakano: A Constructive Formalization of the Catch and Throw Mechanism. 82-89
- Chetan R. Murthy: A Computational Analysis of Girard's Translation and LC. 90-101
- Davide Sangiorgi: The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract). 102-109
- Jeannette M. Wing: Specification in Software Development. 112
- Eugene W. Stark: A Calculus of Dataflow Networks (Extended Abstract). 125-136
- Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi: Asynchronous Communication in Process Algebra. 137-147
- Irek Ulidowski: Equivalences on Observable Processes. 148-159
- Thomas P. Jensen: Disjunctive Strictness Analysis. 174-185
- Max I. Kanovich: Horn Programming in Linear Logic Is NP-Complete. 200-210
- Vaughan R. Pratt: Origins of the Calculus of Binary Relations. 248-254
- Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud: Decidable Problems in Shallow Equational Theories (Extended Abstract). 255-265
- Didier Caucal: Monadic Theory of Term Rewritings. 266-273
- Yoshihito Toyama: Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems. 274-284
- Anil Seth: There is No Recursive Axiomatization for Feasible Functionals of Type~2. 286-295
- Peter Clote: Cutting Planes and constant depth Frege proofs. 296-307
- Jerzy Tiuryn: Subtype Inequalities. 308-315
- Vijay A. Saraswat: The Category of Constraint Systems is Cartesian-Closed. 341-345
- Phokion G. Kolaitis, Jouko A. Väänänen: Generalized Quantifiers and Pebble Games on Finite Structures. 348-359
- Lauri Hella: Logical Hierarchies in PTIME. 360-368
- Nils Klarlund: Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. 382-393
- Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine: Symbolic Model Checking for Real-time Systems. 394-406
- Laurent Fribourg: Mixing List Recursion and Arithmetic. 419-429
- Pierre-Louis Curien: Observable Algorithms on Concrete Data Structures. 432-443
- Herman Geuvers: The Church-Rosser Property for beta-eta-reduction in Typed lambda-Calculi. 453-460
- Ugo de'Liguoro, Adolfo Piperno, Richard Statman: Retracts in simply typed lambda-beta-eta-calculus. 461-469
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team