Computer science logic : 7th workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993 : selected papers
This volume contains the final versions of a collection of papers presented at the Annual Conference of the European Association for Computer Science Logic, CSL '93, held at Swansea, UK in September 1993. The 21 full papers included were selected from a total of 62 submissions and essentially c...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
832 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, 7th workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, selected papers, Egon Börger, Yuri Gurevich, Karl Meinke, eds, 1994, Berlin, Springer-Verlag, 1 vol. (viii-336 p.), Lecture notes in computer science, 3-540-58277-0 • Computer Science Logic, Texte imprimé, 9783662166383 |
Taula de continguts:
- The complexity of set constraints
- On duality for the modal ?-calculus
- Short proofs of tautologies using the schema of equivalence
- Process algebra with combinators
- Is game semantics necessary?
- The model theory of concurrency
- From semantics to rules: A machine assisted analysis
- On the reasons for average superlinear speedup in parallel backtrack search
- Negation as inconsistency in PROLOG via intuitionistic logic
- Approximable minimization problems and optimal solutions on random inputs
- Bounded-arity hierarchies in fixed-point logics
- Petri nets and the equivalence problem
- Logical aspects of set constraints
- Oracles and quantifiers
- A Horn clause that implies an undecidable set of Horn clauses
- Higher-order action calculi
- A generic strong normalization argument: Application to the Calculus of Constructions
- Data types, infinity and equality in system AF 2
- Normalization for typed lambda calculi with explicit substitution
- Program transformation and proof transformation
- Incorporating generalized quantifiers and the least fixed point operator
- The semantics of the C programming language .