↓ Skip to main content

Computer Science Logic

Overview of attention for book
Cover of 'Computer Science Logic'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 29 Four-valued diagnoses for stratified knowledge-bases
  3. Altmetric Badge
    Chapter 30 Fast cut-elimination by projection
  4. Altmetric Badge
    Chapter 31 On the subject reduction property for algebraic type systems
  5. Altmetric Badge
    Chapter 32 Presheaf models for concurrency
  6. Altmetric Badge
    Chapter 33 Directed virtual reductions
  7. Altmetric Badge
    Chapter 34 Bounded-variable fixpoint queries are PSPACE-complete
  8. Altmetric Badge
    Chapter 35 Graph rewriting semantics for functional programming languages
  9. Altmetric Badge
    Chapter 36 Computer Science Logic
  10. Altmetric Badge
    Chapter 37 Relative undecidability in term rewriting
  11. Altmetric Badge
    Chapter 38 Extending models of second order predicate logic to models of second order dependent type theory
  12. Altmetric Badge
    Chapter 39 Eta-expansions in F ω
  13. Altmetric Badge
    Chapter 40 Cut-free display calculi for relation algebras
  14. Altmetric Badge
    Chapter 41 Computational aspects of arity hierarchies
  15. Altmetric Badge
    Chapter 42 Weak semantics based on lighted button pressing experiments
  16. Altmetric Badge
    Chapter 43 Kleene algebra with tests: Completeness and decidability
  17. Altmetric Badge
    Chapter 44 Monadic NP and built-in trees
  18. Altmetric Badge
    Chapter 45 Coercive subtyping in type theory
  19. Altmetric Badge
    Chapter 46 Proofs in system F ω can be done in system F ω 1
  20. Altmetric Badge
    Chapter 47 Optimization problems with approximation schemes
  21. Altmetric Badge
    Chapter 48 Computational representations of herbrand models using grammars
  22. Altmetric Badge
    Chapter 49 Exact pairs for abstract bounded reducibilities
  23. Altmetric Badge
    Chapter 50 The logic of explicitly presentation-invariant circuits
  24. Altmetric Badge
    Chapter 51 Social confluence in client-server systems
  25. Altmetric Badge
    Chapter 52 A type-free resource-aware λ-calculus
  26. Altmetric Badge
    Chapter 53 Inductive definitions with decidable atomic formulas
  27. Altmetric Badge
    Chapter 54 Call-by-Value, call-by-name and the logic of values
  28. Altmetric Badge
    Chapter 55 On Cartesian monoids
  29. Altmetric Badge
    Chapter 56 New intuitionistic logical constants: Undecidability of the conservativeness problem
Attention for Chapter 31: On the subject reduction property for algebraic type systems
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
On the subject reduction property for algebraic type systems
Chapter number 31
Book title
Computer Science Logic
Published by
Springer, Berlin, Heidelberg, September 1996
DOI 10.1007/3-540-63172-0_31
Book ISBNs
978-3-54-063172-9, 978-3-54-069201-0
Authors

G. Barthe, P. -A. Mellies, Barthe, G., Mellies, P. -A.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Australia 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Librarian 1 50%
Student > Ph. D. Student 1 50%
Readers by discipline Count As %
Environmental Science 1 50%
Computer Science 1 50%