10. CSL 1996: Utrecht, The Netherlands
Dirk van Dalen, Marc Bezem (Eds.): Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers. Springer 1997 Lecture Notes in Computer Science ISBN 3-540-63172-0- Gilles Barthe, Paul-André Melliès: On the Subject Reduction Property for Algebraic Type Systems. 34-57
- Stefan Dziembowski: Bounded-Variable Fixpoint Queries are PSPACE-complete. 89-105
- Marko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer: Graph Rewriting Semantics for Functional Programming Languages. 106-128
- Marcelo P. Fiore, Gordon D. Plotkin: An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. 129-149
- Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. 150-166
- Herman Geuvers: Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory. 167-181
- Neil Ghani: Eta-Expansions in Fomega. 182-197
- Rajeev Goré: Cut-free Display Calculi for Relation Algebras. 198-210
- Henrik Imhof: Computational Aspects of Arity Hierarchies. 211-225
- Anna Ingólfsdóttir: Weak Semantics Based on Lighted Button Pressing Experiments. 226-243
- Zhaohui Luo: Coercive Subtyping in Type Theory. 276-296
- Sophie Malecki: Proofs in System Fomega Can Be Done in System Fomega1. 297-315
- Anders Malmström: Optimization Problems with Approximation Schemes. 316-333
- Robert Matzinger: Computational Representations of Herbrand Models Using Grammars. 334-348
- Wolfgang Merkle: Exact Pairs for Abstract Bounded Reducibilities. 349-368
- Martin Otto: The Logic of Explicitly Presentation-Invariant Circuits. 369-384
- Luca Roversi: A Type-Free Resource-Aware Lambda-Calculus. 399-413
- Anton Setzer: Inductive Definitions with Decidable Atomic Formulas. 414-430
- Robert F. Stärk: Call-by-Value, Call-by-Name and the Logic of Values. 431-445
- Richard Statman: On Cartesian Monoids. 446-459
- A. D. Yashin: New Intuitionistic Logical Constants: Undecidability of the Conservativsness Problem. 460-471
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team