Computer science logic : 10th international workshop, CSL 96 : Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996 : proceedings
This book constitutes the strictly refereed post-workshop proceedings of the 10th International Workshop on Computer Science Logic, CSL'96, held as the 5th Annual Conference of the European Association of Computer Science Logic (EACSL), in Utrecht, The Netherlands, in September 1996. The volume...
Bewaard in:
| Coauteurs: | , |
|---|---|
| Andere auteurs: | , |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
1258 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computer science logic, 10th international workshop, CSL 96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, proceedings, Dirk van Dalen, Marc Bezem, eds, 1997, New York, Springer, 1 vol. (VIII-471 p.), Lecture notes in computer science, 3-540-63172-0 • Computer Science Logic, Texte imprimé, 9783662169650 |
Inhoudsopgave:
- Four-valued diagnoses for stratified knowledge-bases
- Fast cut-elimination by projection
- On the subject reduction property for algebraic type systems
- Presheaf models for concurrency
- Directed virtual reductions
- Bounded-variable fixpoint queries are PSPACE-complete
- Graph rewriting semantics for functional programming languages
- An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory
- Relative undecidability in term rewriting
- Extending models of second order predicate logic to models of second order dependent type theory
- Eta-expansions in F ?
- Cut-free display calculi for relation algebras
- Computational aspects of arity hierarchies
- Weak semantics based on lighted button pressing experiments
- Kleene algebra with tests: Completeness and decidability
- Monadic NP and built-in trees
- Coercive subtyping in type theory
- Proofs in system F ? can be done in system F ? 1
- Optimization problems with approximation schemes
- Computational representations of herbrand models using grammars
- Exact pairs for abstract bounded reducibilities
- The logic of explicitly presentation-invariant circuits
- Social confluence in client-server systems
- A type-free resource-aware ?-calculus
- Inductive definitions with decidable atomic formulas
- Call-by-Value, call-by-name and the logic of values
- On Cartesian monoids
- New intuitionistic logical constants: Undecidability of the conservativeness problem.