default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th CSL 1996: Utrecht, The Netherlands
- Dirk van Dalen, Marc Bezem:
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 1997, ISBN 3-540-63172-0 - Ofer Arieli, Arnon Avron:
Four-Valued Diagnoses for Stratified Knowledge-Bases. 1-17 - Matthias Baaz, Alexander Leitsch:
Fast Cut-Elimination by Projection. 18-33 - Gilles Barthe, Paul-André Melliès:
On the Subject Reduction Property for Algebraic Type Systems. 34-57 - Gian Luca Cattani, Glynn Winskel:
Presheaf Models for Concurrency. 58-75 - Vincent Danos, Marco Pedicini
, Laurent Regnier:
Directed Virtual Reductions. 76-88 - 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 - Dexter Kozen, Frederick Smith:
Kleene Algebra with Tests: Completeness and Decidability. 244-259 - Martin Kreidler, Detlef Seese:
Monadic NP and Built-in Trees. 260-275 - 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 - Anna Philippou, David Walker:
Social Confluence in Client-Server Systems. 385-398 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
