STRIP : Structural sharing and intuitionistic proof-search
Identifieur interne : 002C59 ( Crin/Corpus ); précédent : 002C58; suivant : 002C60STRIP : Structural sharing and intuitionistic proof-search
Auteurs : Didier Galmiche ; Dominique Larchey-Wendling ; Daniel MérySource :
English descriptors
- KwdEn :
Abstract
The STRIP system is an intuitionistic theorem prover, based on a duplication free logical system for intuitionistic propositional logic (IPL), in which the structural sharing management leads to efficient implementations of proof-search in an imperative language. For a given formula or sequent, STRIP builds a proof if it is provable or a counter-model if not.
Links to Exploration step
CRIN:galmiche00hLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="241">STRIP : Structural sharing and intuitionistic proof-search</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:galmiche00h</idno>
<date when="2000" year="2000">2000</date>
<idno type="wicri:Area/Crin/Corpus">002C59</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">STRIP : Structural sharing and intuitionistic proof-search</title>
<author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name>
</author>
<author><name sortKey="Larchey Wendling, Dominique" sort="Larchey Wendling, Dominique" uniqKey="Larchey Wendling D" first="Dominique" last="Larchey-Wendling">Dominique Larchey-Wendling</name>
</author>
<author><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>countermodels</term>
<term>duplication</term>
<term>intuitionistic logic</term>
<term>sharing</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1691">The STRIP system is an intuitionistic theorem prover, based on a duplication free logical system for intuitionistic propositional logic (IPL), in which the structural sharing management leads to efficient implementations of proof-search in an imperative language. For a given formula or sequent, STRIP builds a proof if it is provable or a counter-model if not.</div>
</front>
</TEI>
<BibTex type="techreport"><ref>galmiche00h</ref>
<crinnumber>A00-R-342</crinnumber>
<category>15</category>
<equipe>TYPES</equipe>
<author><e>Galmiche, Didier</e>
<e>Larchey-Wendling, Dominique</e>
<e>Méry, Daniel</e>
</author>
<title>STRIP : Structural sharing and intuitionistic proof-search</title>
<year>2000</year>
<type>Rapport de recherche</type>
<keywords><e>intuitionistic logic</e>
<e>sharing</e>
<e>duplication</e>
<e>countermodels</e>
</keywords>
<abstract>The STRIP system is an intuitionistic theorem prover, based on a duplication free logical system for intuitionistic propositional logic (IPL), in which the structural sharing management leads to efficient implementations of proof-search in an imperative language. For a given formula or sequent, STRIP builds a proof if it is provable or a counter-model if not.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002C59 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 002C59 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Corpus |type= RBID |clé= CRIN:galmiche00h |texte= STRIP : Structural sharing and intuitionistic proof-search }}
This area was generated with Dilib version V0.6.33. |