[Agda] termination proofs

Altenkirch Thorsten psztxa at exmail.nottingham.ac.uk
Mon Sep 24 22:51:02 CEST 2012

Ok by "write down" I meant write down *here* and *now*. And post it to the
list please. :-)

This is also my definition of "natural".


On 24/09/2012 21:43, "Martin Escardo" <m.escardo at cs.bham.ac.uk> wrote:

>On 24/09/12 20:30, Altenkirch Thorsten wrote:
>> Let g : Nat -> Nat -> Nat be the function which to compute g m n
>> interprets m as the binary encoding of an Agda program and which returns
>> (f n)+1 if the program type checks and defines a function f : Nat -> Nat
>> and 0 otherwiseŠ Then define the function f : Nat -> Nat with f x = g x
>> Another question: Is there such a program which we can actually write
>Well, of course: (0) A Martin-Lof type theory term normalizer, (1) An
>Agda type checker, (2) a Haskell interpreter, (3) a bar-recursor
>relizing the double-negation shift.
>Agda mailing list
>Agda at lists.chalmers.se

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.

More information about the Agda mailing list