Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Lean Theorem Prover

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Lean Theorem Prover


Chronological Thread 
  • From: roux cody <cody.roux AT gmail.com>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Lean Theorem Prover
  • Date: Thu, 25 Feb 2016 22:18:54 -0500
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=cody.roux AT gmail.com; spf=Pass smtp.mailfrom=cody.roux AT gmail.com; spf=None smtp.helo=postmaster AT mail-ob0-f175.google.com
  • Ironport-phdr: 9a23:+YuJIxeZaz8rTPoolFj6EmcmlGMj4u6mDksu8pMizoh2WeGdxc65Zh7h7PlgxGXEQZ/co6odzbGG7Oa+Ayddsd6oizMrTt9lb1c9k8IYnggtUoauKHbQC7rUVRE8B9lIT1R//nu2YgB/Ecf6YEDO8DXptWZBUiv2OQc9HOnpAIma153xjLDtvcOJKFgYzBOGIppMbzyO5T3LsccXhYYwYo0Q8TDu5kVyRuJN2GlzLkiSlRuvru25/Zpk7jgC86l5r50IAu3GePEzSqUdBzA7OUg04tfqvF/NV1ih/HwZB38RjwoACA/J/VmuVZD9o23gsfdt8CafNMzyC7szXGLxvO9QVBb0hXJfZHYC+2bNh5kogQ==

I hope someone with more expertise will weigh in here, since I am a bit out of my depth. Still I'll try to answer some of the questions with the caveat that I'm not really an expert.

On 02/25/2016 10:29 AM, roux cody wrote:
> (though the Agda-style unicode bindings are just so fun!).
What do you mean?

I just mean I like the agda-style input which replaces \forall by the unicode ∀ seamlessly. It's possible that this is supported in coq as well I guess (I'm a little behind the times).

> Is there anything in lean-mode that is not described in https://leanprover.github.io/presentations/20150123_lean-mode/lean-mode.pdf ?

You'd really have to ask Soonho directly.

> Is there a way in Lean for users to define new tactics, as with Ltac?

Not really at the moment. This is a definite drawback (though Isabelle users don't seem so gung-ho about this). You can sort of pretend with the Lua bindings, I think.

> Is there any extraction capability?

It's in the works.

> As for building-in proof irrelevance (while having a separate HoTT mode) that might not bother anyone but me: I (ab)use proof *relevance* in Coq as a way to get really good erasability.

I'm confused about this. Could you elaborate? Proof-irrelevance and proof erasure seem to go rather well together, in my mind.

> I wonder if runs into the same issues that Coq did. See "Meta-theory à la
> Carte", section "The Problem of Church Encodings and Induction",
> http://people.csail.mit.edu/bendy/MTC/.

Unless I misunderstand, the problem there seems to concern church encodings in pure CoC (as opposed to CIC), so not much to do with how inductives are implemented.


Best,
Cody





This email has been sent from a virus-free computer protected by Avast.
www.avast.com

On Thu, Feb 25, 2016 at 6:01 PM, Daniel Schepler <dschepler AT gmail.com> wrote:
On Thu, Feb 25, 2016 at 2:46 PM, Abhishek Anand
<abhishek.anand.iitg AT gmail.com> wrote:
> MathClasses has something similar, which I like a lot:
>
> http://www.cs.cornell.edu/~aa755/ROSCoq/coqdoc/MathClasses.misc.decision.html

OK, there's a lot of stuff otherwise in MathClasses that I wish would
make its way into the standard library, too.  I just hadn't noticed
that one - though it does seem like it could still use more extension
along the lines I was thinking.  (For example, I see and_dec and
or_dec there, but no impl_dec.)
--
Daniel Schepler




Archive powered by MHonArc 2.6.18.

Top of Page