coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: "Edward Z. Yang" <ezyang AT mit.edu>
- To: Stéphane Glondu <steph AT glondu.net>
- Cc: coq-club <coq-club AT inria.fr>
- Subject: Re: [Coq-Club] Machine-parseable format for Coq terms
- Date: Thu, 05 Apr 2012 11:51:16 -0400
Hello Stephane,
Is there a way to access, say, hypotheses in an in-progress proof,
or the goals, and pass them to the Print XML facility? (Think of:
domain specific proof general application)
Edward
Excerpts from Stéphane Glondu's message of Thu Apr 05 09:09:09 -0400 2012:
> Le 04/04/2012 21:05, Edward Z. Yang a écrit :
> > Is there a nice, easy to parse format for Coq terms (e.g. "or False (or
> > False
> > (or False (or (((A -> B) -> A) -> A) False)))" or Set Printing All on
> > steroids)? I am building a parser for a fragment of the Coq term language
> > (since this doesn't involve patching Coq), but it would be much nicer if I
> > could get everything in a nicer format.
>
> Print XML
>
>
> Cheers,
>
- [Coq-Club] Machine-parseable format for Coq terms, Edward Z. Yang
- Re: [Coq-Club] Machine-parseable format for Coq terms,
Stéphane Glondu
- Re: [Coq-Club] Machine-parseable format for Coq terms, Edward Z. Yang
- Re: [Coq-Club] Machine-parseable format for Coq terms, Stéphane Glondu
- Re: [Coq-Club] Machine-parseable format for Coq terms, Edward Z. Yang
- Re: [Coq-Club] Machine-parseable format for Coq terms,
Stéphane Glondu
Archive powered by MhonArc 2.6.16.