9. LICS 1994:
Paris, France
Proceedings of the Ninth Annual Symposium on Logic in Computer Science
(LICS '94), Paris, France, June, 1994.
IEEE Computer Society, ISBN 0-8186-6310-3
- Rod M. Burstall:
Terms, Proofs, and Refinement (Extended abstract).
2-7
- Yuri Gurevich, Neil Immerman, Saharon Shelah:
McColm's Conjecture.
10-19
- Anuj Dawar, Lauri Hella:
The Expressive Power of Finitely Many Generalized Quantifiers.
20-29
- Martin Otto:
Generalized Quantifiers for Simple Properties.
30-39
- Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto:
How to Define a Linear Order on Finite Models.
40-49
- Rajeev Alur, Thomas A. Henzinger:
Finitary Fairness.
52-61
- Peter Sewell:
Bisimulation is Not Finitely (First Order) Equationally Axiomatisable.
62-70
- Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
Foundations of Timed Concurrent Constraint Programming.
71-80
- Alan Jeffrey:
A Fully Abstract Semantics for Concurrent Graph Reduction.
82-91
- Marcelo P. Fiore, Gordon D. Plotkin:
An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC.
92-102
- Loïc Colson, Thomas Ehrhard:
On Strong Stability and Higher-Order Sequentiality.
103-108
- Michael Huth, Achim Jung, Klaus Keimel:
Linear Types, Approximation, and Topology.
110-114
- Abbas Edalat:
Domain Theory and Integration.
115-124
- Edmund M. Clarke:
Automatic Verification of Finite-State Concurrent Systems.
126
- Witold Charatonik, Leszek Pacholski:
Negative Set Constraints with Equality.
128-136
- Kjartan Stefánsson:
Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete.
137-141
- Henrik Reif Andersen, Colin Stirling, Glynn Winskel:
A Compositional Proof System for the Modal mu-Calculus.
144-153
- Shipei Zhang, Oleg Sokolsky, Scott A. Smolka:
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus.
154-163
- Edith Hemaspaandra:
Complexity Transfer for Modal Logic (Extended Abstract).
164-173
- J. B. Wells:
Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable.
176-185
- Jens Palsberg:
Efficient Inference of Object Types.
186-195
- Adolfo Piperno, Simona Ronchi Della Rocca:
Type Inference and Extensionality.
196-205
- Martin Hofmann, Thomas Streicher:
The Groupoid Model Refutes Uniqueness of Identity Proofs.
208-212
- Matthias Baaz, Christian G. Fermüller, Alexander Leitsch:
A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation.
213-219
- Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart:
Upper and Lower Bounds for Tree-Like Cutting Planes Proofs.
220-228
- Serge Abiteboul, Christos H. Papadimitriou, Victor Vianu:
The Power of Reflective Relational Machines.
230-240
- J. Antonio Medina, Neil Immerman:
A Syntactic Characterization of NP-Completeness.
241-250
- Robert F. Stärk:
The Declarative Semantics of the Prolog Selection Rule.
252-261
- Antonio Brogi, Franco Turini:
Semantics of Meta-Logic in an Algebra of Programs.
262-270
- Dale Miller:
A Multiple-Conclusion Meta-Logic.
272-281
- Patrick Lincoln, Natarajan Shankar:
Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi.
282-291
- Ralph Loader:
Linear Logic, Totality and Full Completeness.
292-298
- Pawel Urzyczyn:
The Emptiness Problem for Intersection Types.
300-309
- Gordon D. Plotkin, Martín Abadi, Luca Cardelli:
Subtyping and Parametricity.
310-319
- Herman Geuvers, Benjamin Werner:
On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study.
320-329
- Martín Abadi, Luca Cardelli:
A Semantics of Object Types.
332-341
- Uday S. Reddy:
Passivity and Independence.
342-352
- Eugenio Moggi:
A General Semantics for Evaluation Logic.
353-362
- E. P. Robinson, Giuseppe Rosolini:
Reflexive Graphs and Parametric Polymorphism.
364-371
- Carolyn Brown, Graham Hutton:
Categories, Allegories and Circuit Design.
372-381
- Leo Bachmair, Harald Ganzinger:
Rewrite Techniques for Transitive Relations.
384-393
- Claude Marché:
Normalised Rewriting and Normalised Completion.
394-403
- Franco Barbanera, Maribel Fernández, Herman Geuvers:
Modularity of Strong Normalization and Confluence in the algebraic-lambda-Cube.
406-415
- Zena M. Ariola, Jan Willem Klop:
Cyclic Lambda Graph Rewriting.
416-425
- Andrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier:
Paths in the lambda-calculus.
426-436
- P. S. Thiagarajan:
A Trace Based Extension of Linear Time Temporal Logic.
438-447
- Ron van der Meyden:
Axioms for Knowledge and Time in Distributed Systems with Perfect Recall.
448-457
- Edward Y. Chang, Zohar Manna, Amir Pnueli:
Compositional Verification of Real-Time Systems.
458-465
- Ofer Arieli, Arnon Avron:
Logical Bilattices and Inconsistent Data.
468-476
- Shai Ben-David, Rachel Ben-Eliyahu:
a modal logic for subjective default reasoning.
477-486
- Mati Pentus:
Language Completeness of the Lambek Calculus.
487-496
- Jean Goubault:
Rigid E-Unifiability is DEXPTIME-Complete.
498-506
- Christian Prehofer:
Higher-Order Narrowing.
507-516
Copyright © Tue Dec 8 20:15:26 2009
by Michael Ley (ley@uni-trier.de)
