You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Are there any models of type theory in which function extensionality fails (well, except for the syntactic one)? In categorical semantics it is always true. Is there some version of the categorical semantics in which it does not hold?
In her thesis Polynomials and Models of Type Theory, Tamara von Glehn constructs a model of dependent type theory that does not satisfy function extensionality, using polynomial functors.
And some models from game semantics.
Nathanael Arkor said:
In her thesis Polynomials and Models of Type Theory, Tamara von Glehn constructs a model of dependent type theory that does not satisfy function extensionality, using polynomial functors.
Formalised by András Kovács here: https://github.com/AndrasKovacs/polynomial-model if you're into that kind of thing.
There's a somewhat trivial model that violates function extensionality in Garner's On the strength of dependent products in the type theory of Martin-Löf (section 4): replace the "real" exponential by two copies of itself.
Whether this rule "always" holds in categorical semantics depends on the definition of "categorical semantics" -- if by the latter you mean semantics where exponentials are interpreted by categorical exponentials, then of course funext always holds by definition, but you can also write down what a categorical semantics of type theory without funext would be, and then build models of it as have been mentioned.
The next 700 syntactical models of type theory uses a similar method to obtain models of type theory satisfying and various other forms of anti-extensionality.
Reid Barton said:
The next 700 syntactical models of type theory uses a similar method to obtain models of type theory satisfying and various other forms of anti-extensionality.
I seem to recall that the "function" types in this paper are not actually exponentials (i.e. don't have an eta law). To me it is more interesting to try and violate function extensionality where functions types are actually exponentials.
(Hope I am not mixing up the papers I'm referring to!)
I think Garner's models fail the eta-rule too. I don't know of any models that satisfy eta but not funext, do you?
I think I might know one... I have to go and check if it does what I think.
I believe there is a realizability model due to Van Oosten (?), where you can generate a notion of homotopy using the codiscrete interval --- this models the identity type, but function extensionality fails. If I recall correctly, this would satisfy our constraints. But I hope I'm not mis-remembering.
I always felt that the other "counter-models" should be referred to as violating "non-function extensionality" rather than "function extensionality" (-:
Jonathan Sterling said:
I believe there is a realizability model due to Van Oosten (?), where you can generate a notion of homotopy using the codiscrete interval --- this models the identity type, but function extensionality fails. If I recall correctly, this would satisfy our constraints. But I hope I'm not mis-remembering.
There was some improvement to this by Dan Frumin (IIRC) that did model funext. Anyway, both were interesting to me for different reasons.
A relatively simple model of is the parametric exceptional model from this paper (section 4.2)
The polynomial functors/containers model from Tamara von Glehn's thesis has eta but not funext. I formalised it in Agda https://gist.github.com/bobatkey/0d1f04057939905d35699f1b1c323736 and @András Kovács made a tidier formalisation https://github.com/AndrasKovacs/polynomial-model
Oh, I see it linked to above. But the point is that it does support for -types.
Awesome, thanks everyone!
Someone should record this somewhere, maybe on the nlab.