[Agda] Running a classical proof with choice in Agda
Martin Escardo
m.escardo at cs.bham.ac.uk
Mon May 9 13:55:16 CEST 2011
On 09/05/11 12:38, Nils Anders Danielsson wrote:
> The introduction of the postulate may have meant that huge "thunks"
> started building up in the heap.
Is there any way around this?
Also, I suspect that the original ProgramsWithoutSpecification.agda
should strongly normalize (despite what I said earlier), because it is
the same things as the main "theorem", with the proof obligations
projected out.
Martin
More information about the Agda
mailing list