[Agda] list of types

[Altenkirch Thorsten]

No but I only claim to be able to prove an equivalence. With UA you can prove them to be equal.

Thorsten

Sent from my iPhone

On 15 Apr 2013, at 14:50, "Bas Spitters" <spitters at cs.ru.nl> wrote:

> On Mon, Apr 15, 2013 at 5:59 PM, Altenkirch Thorsten
> <psztxa at exmail.nottingham.ac.uk> wrote:
>> What I mean is the following: there is an equivalence between
>>        A -> Set
>> and
>>        Sigma[ X : Set ] X -> A
>> 
>> this is a trivial instance of the Grothendieck construction between
>> families and fibrations.
> 
> I used UA to prove this, did you see a simpler construction?
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it.   Please do not use, copy or disclose the information contained in this message or in any attachment.  Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.

This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.