[Agda] Efficiency of type checking

[Thorsten Altenkirch]

I haven’t followed the ongoing discussion in detail but it seems to me that we need a different approach if we want to make dependently typed programming feasible in practice. I believe we need a programmable equality checker which has to be certified that it is sound so that equality checking can be modified by the user in a safe way. This would also alleviate the need for rewriting which is potentially unsound. I think this is vaguely in line with Andrej Bauer’s Andromeda proposal.

Thorsten




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.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.chalmers.se/pipermail/agda/attachments/20160204/f73fcab9/attachment.html