home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!zaphod.mps.ohio-state.edu!uwm.edu!biosci!agate!doc.ic.ac.uk!uknet!edcastle!dcs.ed.ac.uk!alti
- From: alti@dcs.ed.ac.uk (Thorsten Altenkirch)
- Newsgroups: sci.logic
- Subject: Re: Types of type theory (Errata)
- Message-ID: <ALTI.92Nov16224220@tanera.dcs.ed.ac.uk>
- Date: 16 Nov 92 22:42:20 GMT
- References: <BxIxGz.D7x@access.digex.com> <1992Nov12.144654.7493@ucthpx.uct.ac.za>
- <ALTI.92Nov13131546@tanera.dcs.ed.ac.uk>
- <1992Nov13.123046.17412@husc3.harvard.edu>
- <ALTI.92Nov16194749@tanera.dcs.ed.ac.uk>
- Sender: cnews@dcs.ed.ac.uk (UseNet News Admin)
- Organization: LFCS, Edinburgh
- Lines: 19
- In-Reply-To: alti@dcs.ed.ac.uk's message of Mon, 16 Nov 1992 19:47:49 GMT
-
- In article <ALTI.92Nov16194749@tanera.dcs.ed.ac.uk> alti@dcs.ed.ac.uk (Thorsten Altenkirch) writes:
-
- Certainly, but this just means that you have to give up something to
- get classical reasoning AND propositions as types. I am not an expert
- in this area but as I understand it: You may have a computational
- interpretation of type theory if you 'fix' your evaluation strategy
- ^^^^^^^^^^^
- Should read: classical logic
-
- (i.e. you decide to use only the equations of the call-by-value
- \lambda calculus).
-
- Sorry.
- --
-
- Thorsten Altenkirch And there's a hand, my trusty fiere,
- Laboratory for Foundations And gie's a hand o' thine,
- of Computer Science And we'll tak a right guid-willie waught
- University of Edinburgh For auld lang syne!
-