Discussion of Homotopy Type Theory and Univalent Foundations
 help / color / mirror / Atom feed
From: Matt Oliveri <atmacen@gmail.com>
To: Homotopy Type Theory <HomotopyTypeTheory@googlegroups.com>
Subject: Re: [HoTT] Re: Why do we need judgmental equality?
Date: Sun, 17 Feb 2019 04:08:52 -0800 (PST)	[thread overview]
Message-ID: <e7fc68c9-0364-4c44-8343-06278c7c2157@googlegroups.com> (raw)
In-Reply-To: <CAOvivQwy_GEsWAjYnUXx+iBK3Z3WyWxL0jv9RPp8J=dgg12igw@mail.gmail.com>


[-- Attachment #1.1: Type: text/plain, Size: 3379 bytes --]

What about infinitary (non-elementary) limits? Are there infinitary 
homotopy-limits? They are more common than discrete inductive types, right? 
So what if I considered a stream of A to be essentially an omega-fold 
product of A. Would that have a strict extensionality principle?

More generally, I would try and say that a coinductive type is some limit 
of an external diagram of elimination spines. This might address Thomas 
Streicher's objection, since the collection of elimination spines is 
countable externally.

On Sunday, February 17, 2019 at 4:19:01 AM UTC-5, Michael Shulman wrote:
>
> Well, I'm not really convinced that coinductive types should be 
> treated as basic type formers, rather than simply constructed out of 
> inductive types and extensional functions.  For one thing, I have no 
> idea how to construct coinductive types as basic type formers in 
> homotopical models.  I think the issue that you raise, Thorsten, could 
> be regarded as another argument against treating them basically, or at 
> least against regarding them as really "negative" in the same way that 
> Pis and (negative) Sigmas are. 
>
> And as for adding random extra strict equalities pertaining certain 
> positive types that happen to hold in some particular model, Matt, I 
> would say similarly that the general perspective gives yet another 
> reason why you shouldn't do that.  (-: 
>
> But the real point is that the general perspective I was proposing 
> doesn't claim to be the *only* way to do things; obviously it isn't. 
> It's just a non-arbitrary "baseline" that is consistent and makes 
> sense and matches a common core of equalities used in many type 
> theories, so that when you deviate from it you're aware that you're 
> being deviant.  (-: 
>
> On Sat, Feb 16, 2019 at 11:56 PM Thorsten Altenkirch 
> <Thorsten....@nottingham.ac.uk <javascript:>> wrote: 
> > 
> > On 17/02/2019, 01:25, "homotopyt...@googlegroups.com <javascript:> on 
> behalf of Michael Shulman" <homotopyt...@googlegroups.com <javascript:> 
> on behalf of shu...@sandiego.edu <javascript:>> wrote: 
> > 
> >     However, I don't find it 
> >     arbitrary at all: *negative* types have strict eta, while positive 
> >     types don't. 
> > 
> > This is a very good point. However Streams are negative types but for 
> example agda doesn't use eta conversion on them, I think for a good reason. 
> Actually I am not completely sure whether this is undecidable. 
> > 
> > E.g. the following equation cannot be proven using refl (it can be 
> proven in cubical agda btw). The corresponding equation for Sigma types 
> holds definitionally. 
> > 
> > infix 5 _∷_ 
> > 
> > record Stream (A : Set) : Set where 
> >   constructor _∷_ 
> >   coinductive 
> >   field 
> >     hd : A 
> >     tl : Stream A 
> > 
> > open Stream 
> > etaStream : {A : Set}{s : Stream A} → hd s ∷ tl s ≡ s 
> > etaStream = {!refl!} 
> > 
> > CCed to the agda list. Maybe somebody can comment on the decidabilty 
> status? 
>

-- 
You received this message because you are subscribed to the Google Groups "Homotopy Type Theory" group.
To unsubscribe from this group and stop receiving emails from it, send an email to HomotopyTypeTheory+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[-- Attachment #1.2: Type: text/html, Size: 4677 bytes --]

  parent reply	other threads:[~2019-02-17 12:08 UTC|newest]

Thread overview: 71+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2019-01-30 11:54 [HoTT] " Felix Rech
2019-02-05 23:00 ` [HoTT] " Matt Oliveri
2019-02-06  4:13   ` Anders Mörtberg
2019-02-09 11:55     ` Felix Rech
2019-02-16 15:59     ` Thorsten Altenkirch
2019-02-17  1:25       ` Michael Shulman
2019-02-17  7:56         ` Thorsten Altenkirch
2019-02-17  9:14           ` Matt Oliveri
2019-02-17  9:18           ` Michael Shulman
2019-02-17 10:52             ` Thorsten Altenkirch
2019-02-17 11:35               ` streicher
2019-02-17 11:44                 ` Thorsten Altenkirch
2019-02-17 14:24                   ` Bas Spitters
2019-02-17 19:36                   ` Thomas Streicher
2019-02-17 21:41                     ` Thorsten Altenkirch
2019-02-17 12:08             ` Matt Oliveri [this message]
2019-02-17 12:13               ` Matt Oliveri
2019-02-20  0:22               ` Michael Shulman
2019-02-17 14:22           ` [Agda] " Andreas Abel
2019-02-17  9:05         ` Matt Oliveri
2019-02-17 13:29         ` Nicolai Kraus
2019-02-08 21:19 ` Martín Hötzel Escardó
2019-02-08 23:31   ` Valery Isaev
2019-02-09  1:41     ` Nicolai Kraus
2019-02-09  8:04       ` Valery Isaev
2019-02-09  1:58     ` Jon Sterling
2019-02-09  8:16       ` Valery Isaev
2019-02-09  1:30   ` Nicolai Kraus
2019-02-09 11:38   ` Thomas Streicher
2019-02-09 13:29     ` Thorsten Altenkirch
2019-02-09 13:40       ` Théo Winterhalter
2019-02-09 11:57   ` Felix Rech
2019-02-09 12:39     ` Martín Hötzel Escardó
2019-02-11  6:58     ` Matt Oliveri
2019-02-18 17:37   ` Martín Hötzel Escardó
2019-02-18 19:22     ` Licata, Dan
2019-02-18 20:23       ` Martín Hötzel Escardó
2019-02-09 11:53 ` Felix Rech
2019-02-09 14:04   ` Nicolai Kraus
2019-02-09 14:26     ` Gabriel Scherer
2019-02-09 14:44     ` Jon Sterling
2019-02-09 20:34       ` Michael Shulman
2019-02-11 12:17         ` Matt Oliveri
2019-02-11 13:04           ` Michael Shulman
2019-02-11 15:09             ` Matt Oliveri
2019-02-11 17:20               ` Michael Shulman
2019-02-11 18:17                 ` Thorsten Altenkirch
2019-02-11 18:45                   ` Alexander Kurz
2019-02-11 22:58                     ` Thorsten Altenkirch
2019-02-12  2:09                       ` Jacques Carette
2019-02-12 11:03                   ` Matt Oliveri
2019-02-12 15:36                     ` Thorsten Altenkirch
2019-02-12 15:59                       ` Matt Oliveri
2019-02-11 19:27                 ` Matt Oliveri
2019-02-11 21:49                   ` Michael Shulman
2019-02-12  9:01                     ` Matt Oliveri
2019-02-12 17:54                       ` Michael Shulman
2019-02-13  6:37                         ` Matt Oliveri
2019-02-13 10:01                           ` Ansten Mørch Klev
2019-02-11 20:11                 ` Matt Oliveri
2019-02-11  8:23       ` Matt Oliveri
2019-02-11 13:03         ` Jon Sterling
2019-02-11 13:22           ` Matt Oliveri
2019-02-11 13:37             ` Jon Sterling
2019-02-11  6:51   ` Matt Oliveri
2019-02-09 12:30 ` [HoTT] " Thorsten Altenkirch
2019-02-11  7:01   ` Matt Oliveri
2019-02-11  8:04     ` Valery Isaev
2019-02-11  8:28       ` Matt Oliveri
2019-02-11  8:37         ` Matt Oliveri
2019-02-11  9:32           ` Rafaël Bocquet

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=e7fc68c9-0364-4c44-8343-06278c7c2157@googlegroups.com \
    --to=atmacen@gmail.com \
    --cc=HomotopyTypeTheory@googlegroups.com \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).