- •Sense, Denotation and Semantics
- •Sense and denotation in logic
- •The algebraic tradition
- •The syntactic tradition
- •The two semantic traditions
- •Tarski
- •Heyting
- •Natural Deduction
- •The calculus
- •The rules
- •Interpretation of the rules
- •The Curry-Howard Isomorphism
- •Lambda Calculus
- •Types
- •Terms
- •Operational significance
- •Conversion
- •Description of the isomorphism
- •Relevance of the isomorphism
- •The Normalisation Theorem
- •The weak normalisation theorem
- •Proof of the weak normalisation theorem
- •Degree and substitution
- •Degree and conversion
- •Conversion of maximal degree
- •Proof of the theorem
- •The strong normalisation theorem
- •Sequent Calculus
- •The calculus
- •Sequents
- •Structural rules
- •The intuitionistic case
- •Logical rules
- •Some properties of the system without cut
- •The last rule
- •Subformula property
- •Asymmetrical interpretation
- •Sequent Calculus and Natural Deduction
- •Properties of the translation
- •Strong Normalisation Theorem
- •Reducibility
- •Properties of reducibility
- •Atomic types
- •Product type
- •Arrow type
- •Reducibility theorem
- •Pairing
- •Abstraction
- •The theorem
- •The calculus
- •Types
- •Terms
- •Intended meaning
- •Conversions
- •Normalisation theorem
- •Expressive power: examples
- •Booleans
- •Integers
- •Expressive power: results
- •Canonical forms
- •Representable functions
- •Coherence Spaces
- •General ideas
- •Coherence Spaces
- •The web of a coherence space
- •Interpretation
- •Stable functions
- •Parallel Or
- •Direct product of two coherence spaces
- •The Function-Space
- •The trace of a stable function
- •Representation of the function space
- •The Berry order
- •Partial functions
- •Denotational Semantics of T
- •Simple typed calculus
- •Types
- •Terms
- •Properties of the interpretation
- •Booleans
- •Integers
- •Sums in Natural Deduction
- •Defects of the system
- •Standard conversions
- •The need for extra conversions
- •Subformula Property
- •Extension to the full fragment
- •Commuting conversions
- •Properties of conversion
- •The associated functional calculus
- •Empty type
- •Sum type
- •Additional conversions
- •System F
- •The calculus
- •Comments
- •Representation of simple types
- •Booleans
- •Product of types
- •Empty type
- •Sum type
- •Existential type
- •Representation of a free structure
- •Free structure
- •Representation of the constructors
- •Induction
- •Representation of inductive types
- •Integers
- •Lists
- •Binary trees
- •Trees of branching type U
- •The Curry-Howard Isomorphism
- •Coherence Semantics of the Sum
- •Direct sum
- •Lifted sum
- •dI-domains
- •Linearity
- •Characterisation in terms of preservation
- •Linear implication
- •Linearisation
- •Linearised sum
- •Tensor product and units
- •Cut Elimination (Hauptsatz)
- •The key cases
- •The principal lemma
- •The Hauptsatz
- •Resolution
- •Strong Normalisation for F
- •Idea of the proof
- •Reducibility candidates
- •Remarks
- •Reducibility with parameters
- •Substitution
- •Universal abstraction
- •Universal application
- •Reducibility theorem
- •Representation Theorem
- •Representable functions
- •Numerals
- •Total recursive functions
- •Provably total functions
- •Proofs into programs
- •Formulation of HA2
- •Translation of HA2 into F
- •Representation of provably total functions
- •Semantics of System F
- •What is Linear Logic?
8.5. THE FUNCTION-SPACE |
65 |
8.5.4Partial functions
Let us see how this construction works by calculating Int ! Int. We have
Intn ' N [ f?g and jIntj = N, so jInt ! Intj ' (N [ f?g) N where
i)(n; m) _^ (n0; m0) if n = n0 ) m = m0
ii)(?; m) _^ (?; m)
with incoherence otherwise. This is the direct sum (see section 12.1) of the coherence space which represents partial functions with the space which represents the constants \by vocation". Let us ignore the latter part and concentrate on the space PF de ned on the web N N by condition (i).
What |
is |
the order relation on PF? Well |
f 2 PF is a |
set |
of pairs (n; m) |
such that |
if |
(n; m); (n; m0) 2 f then m = m0, |
which is just |
the |
usual \graph" |
representation of a partial function. Since the Berry order corresponds simply to containment, it is the usual extension order on partial functions.
In the Berry order, the partial functions |
f |
and the constants by vocation |
|||
|
|
|
|
_ |
|
n are incomparable. However pointwise we have f < 0 for any partial function |
|||||
which takes no other value than zero, of |
which there are in nitely many. One |
||||
|
e |
phenomenon of compact5 objects |
|||
advantage of our semantics is that it avoids this |
|||||
e |
|
with in nitely many objects below them.
Another consequence of the Berry order arises at an even simpler type: in the function-space Sgl ! Sgl, where Sgl is the coherence space with just one token (section 12.6). In the pointwise (Scott) order, the identity function is below the constant \by vocation" f g, whilst in the Berry order they are incomparable. This means that in the stable semantics, unlike the Scott semantics, it is possible for a test program to succeed on the identity (which reads its input) but fail on the constant (which does not).
5The notion of compactness in topology is purely order-theoretic: if a S" I for some directed set I then a b for some b 2 I. Besides Scott's domain theory, this also arises in ring theory as Noetherianness and in universal algebra as nite presentability.