InforLorV4, Istex, Corpus, bibRecord, 002810

Classical Non-Associative Lambek Calculus

Identifieur interne : 002810 ( Istex/Corpus ); précédent : 002809; suivant : 002811

Classical Non-Associative Lambek Calculus

Auteurs : Philippe De Groote ; François Lamarche

Source :

Studia Logica [ 0039-3215 ] ; 2002-08-01.

RBID : ISTEX:A964F6DB983DBE7AAD56611885CD0BFF80E9F433

English descriptors

KwdEn :
- linear logic, non-associative Lambek calculus, proof-net.

Abstract

Abstract: We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.

Url:

https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/fulltext.pdf

DOI: 10.1023/A:1020520915016

Links to Exploration step

ISTEX:A964F6DB983DBE7AAD56611885CD0BFF80E9F433

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Classical Non-Associative Lambek Calculus</title>
<author><name sortKey="De Groote, Philippe" sort="De Groote, Philippe" uniqKey="De Groote P" first="Philippe" last="De Groote">Philippe De Groote</name>
<affiliation><mods:affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: degroote@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lamarche, Francois" sort="Lamarche, Francois" uniqKey="Lamarche F" first="François" last="Lamarche">François Lamarche</name>
<affiliation><mods:affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: lamarche@loria.fr</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:A964F6DB983DBE7AAD56611885CD0BFF80E9F433</idno>
<date when="2002" year="2002">2002</date>
<idno type="doi">10.1023/A:1020520915016</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002810</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002810</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Classical Non-Associative Lambek Calculus</title>
<author><name sortKey="De Groote, Philippe" sort="De Groote, Philippe" uniqKey="De Groote P" first="Philippe" last="De Groote">Philippe De Groote</name>
<affiliation><mods:affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: degroote@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Lamarche, Francois" sort="Lamarche, Francois" uniqKey="Lamarche F" first="François" last="Lamarche">François Lamarche</name>
<affiliation><mods:affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: lamarche@loria.fr</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Studia Logica</title>
<title level="j" type="sub">An International Journal for Symbolic Logic</title>
<title level="j" type="abbrev">Studia Logica</title>
<idno type="ISSN">0039-3215</idno>
<idno type="eISSN">1572-8730</idno>
<imprint><publisher>Kluwer Academic Publishers</publisher>
<pubPlace>Dordrecht</pubPlace>
<date type="published" when="2002-08-01">2002-08-01</date>
<biblScope unit="volume">71</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="page" from="355">355</biblScope>
<biblScope unit="page" to="388">388</biblScope>
</imprint>
<idno type="ISSN">0039-3215</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0039-3215</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>linear logic</term>
<term>non-associative Lambek calculus</term>
<term>proof-net</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.</div>
</front>
</TEI>
<istex><corpusName>springer-journals</corpusName>
<author><json:item><name>Philippe de Groote</name>
<affiliations><json:string>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</json:string>
<json:string>E-mail: degroote@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>François Lamarche</name>
<affiliations><json:string>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</json:string>
<json:string>E-mail: lamarche@loria.fr</json:string>
</affiliations>
</json:item>
</author>
<subject><json:item><lang><json:string>eng</json:string>
</lang>
<value>non-associative Lambek calculus</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>linear logic</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>proof-net</value>
</json:item>
</subject>
<articleId><json:string>5098765</json:string>
<json:string>Art5</json:string>
</articleId>
<arkIstex>ark:/67375/VQC-640NC27Q-2</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.</abstract>
<qualityIndicators><score>2.626</score>
<pdfWordCount>0</pdfWordCount>
<pdfCharCount>0</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>34</pdfPageCount>
<pdfPageSize>595 x 842 pts (A4)</pdfPageSize>
<refBibsNative>false</refBibsNative>
<abstractWordCount>48</abstractWordCount>
<abstractCharCount>314</abstractCharCount>
<keywordCount>3</keywordCount>
</qualityIndicators>
<title>Classical Non-Associative Lambek Calculus</title>
<genre><json:string>research-article</json:string>
</genre>
<host><title>Studia Logica</title>
<language><json:string>unknown</json:string>
</language>
<publicationDate>2002</publicationDate>
<copyrightDate>2002</copyrightDate>
<issn><json:string>0039-3215</json:string>
</issn>
<eissn><json:string>1572-8730</json:string>
</eissn>
<journalId><json:string>11225</json:string>
</journalId>
<volume>71</volume>
<issue>3</issue>
<pages><first>355</first>
<last>388</last>
</pages>
<genre><json:string>journal</json:string>
</genre>
<subject><json:item><value>Logic</value>
</json:item>
<json:item><value>Mathematical Logic and Foundations</value>
</json:item>
<json:item><value>Computational Linguistics</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/VQC-640NC27Q-2</json:string>
</ark>
<publicationDate>2002</publicationDate>
<copyrightDate>2002</copyrightDate>
<doi><json:string>10.1023/A:1020520915016</json:string>
</doi>
<id>A964F6DB983DBE7AAD56611885CD0BFF80E9F433</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Classical Non-Associative Lambek Calculus</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher scheme="https://scientific-publisher.data.istex.fr">Kluwer Academic Publishers</publisher>
<pubPlace>Dordrecht</pubPlace>
<availability><licence><p>Kluwer Academic Publishers, 2002</p>
</licence>
<p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p>
</availability>
<date>2002</date>
</publicationStmt>
<notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note>
<note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note>
</notesStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Classical Non-Associative Lambek Calculus</title>
<author xml:id="author-0000"><persName><forename type="first">Philippe</forename>
<surname>de Groote</surname>
</persName>
<email>degroote@loria.fr</email>
<affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</affiliation>
</author>
<author xml:id="author-0001"><persName><forename type="first">François</forename>
<surname>Lamarche</surname>
</persName>
<email>lamarche@loria.fr</email>
<affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</affiliation>
</author>
<idno type="istex">A964F6DB983DBE7AAD56611885CD0BFF80E9F433</idno>
<idno type="ark">ark:/67375/VQC-640NC27Q-2</idno>
<idno type="DOI">10.1023/A:1020520915016</idno>
<idno type="article-id">5098765</idno>
<idno type="article-id">Art5</idno>
</analytic>
<monogr><title level="j">Studia Logica</title>
<title level="j" type="sub">An International Journal for Symbolic Logic</title>
<title level="j" type="abbrev">Studia Logica</title>
<idno type="pISSN">0039-3215</idno>
<idno type="eISSN">1572-8730</idno>
<idno type="journal-ID">true</idno>
<idno type="issue-article-count">8</idno>
<idno type="volume-issue-count">3</idno>
<imprint><publisher>Kluwer Academic Publishers</publisher>
<pubPlace>Dordrecht</pubPlace>
<date type="published" when="2002-08-01"></date>
<biblScope unit="volume">71</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="page" from="355">355</biblScope>
<biblScope unit="page" to="388">388</biblScope>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>2002</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Abstract: We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.</p>
</abstract>
<textClass xml:lang="en"><keywords scheme="keyword"><list><item><term>non-associative Lambek calculus</term>
</item>
<item><term>linear logic</term>
</item>
<item><term>proof-net</term>
</item>
</list>
</keywords>
</textClass>
<textClass><keywords scheme="Journal Subject"><list><head>Philosophy</head>
<item><term>Logic</term>
</item>
<item><term>Mathematical Logic and Foundations</term>
</item>
<item><term>Computational Linguistics</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="2002-08-01">Published</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-journals not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Kluwer Academic Publishers</PublisherName>
<PublisherLocation>Dordrecht</PublisherLocation>
</PublisherInfo>
<Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>11225</JournalID>
<JournalPrintISSN>0039-3215</JournalPrintISSN>
<JournalElectronicISSN>1572-8730</JournalElectronicISSN>
<JournalTitle>Studia Logica</JournalTitle>
<JournalSubTitle>An International Journal for Symbolic Logic</JournalSubTitle>
<JournalAbbreviatedTitle>Studia Logica</JournalAbbreviatedTitle>
<JournalSubjectGroup><JournalSubject Type="Primary">Philosophy</JournalSubject>
<JournalSubject Type="Secondary">Logic</JournalSubject>
<JournalSubject Type="Secondary">Mathematical Logic and Foundations</JournalSubject>
<JournalSubject Type="Secondary">Computational Linguistics</JournalSubject>
</JournalSubjectGroup>
</JournalInfo>
<Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>71</VolumeIDStart>
<VolumeIDEnd>71</VolumeIDEnd>
<VolumeIssueCount>3</VolumeIssueCount>
</VolumeInfo>
<Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>3</IssueIDStart>
<IssueIDEnd>3</IssueIDEnd>
<IssueTitle Language="En">Special Issue: The Lambek Calculus in Logic and Linguistics edited by</IssueTitle>
<IssueArticleCount>8</IssueArticleCount>
<IssueHistory><CoverDate><Year>2002</Year>
<Month>8</Month>
</CoverDate>
</IssueHistory>
<IssueCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName>
<CopyrightYear>2002</CopyrightYear>
</IssueCopyright>
</IssueInfo>
<Article ID="Art5"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>5098765</ArticleID>
<ArticleDOI>10.1023/A:1020520915016</ArticleDOI>
<ArticleSequenceNumber>5</ArticleSequenceNumber>
<ArticleTitle Language="En">Classical Non-Associative Lambek Calculus</ArticleTitle>
<ArticleFirstPage>355</ArticleFirstPage>
<ArticleLastPage>388</ArticleLastPage>
<ArticleHistory><RegistrationDate><Year>2004</Year>
<Month>10</Month>
<Day>18</Day>
</RegistrationDate>
</ArticleHistory>
<ArticleCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName>
<CopyrightYear>2002</CopyrightYear>
</ArticleCopyright>
<ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ArticleGrants>
<ArticleContext><JournalID>11225</JournalID>
<VolumeIDStart>71</VolumeIDStart>
<VolumeIDEnd>71</VolumeIDEnd>
<IssueIDStart>3</IssueIDStart>
<IssueIDEnd>3</IssueIDEnd>
</ArticleContext>
</ArticleInfo>
<ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Philippe</GivenName>
<FamilyName>de Groote</FamilyName>
</AuthorName>
<Contact><Email>degroote@loria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>François</GivenName>
<FamilyName>Lamarche</FamilyName>
</AuthorName>
<Contact><Email>lamarche@loria.fr</Email>
</Contact>
</Author>
<Affiliation ID="Aff1"><OrgDivision>Projet Calligramme</OrgDivision>
<OrgName>LORIA UMR no 7503 — INRIA, Campus Scientifique</OrgName>
<OrgAddress><Postbox>B.P. 239</Postbox>
<Postcode>54506</Postcode>
<City>Vandœuvre lès Nancy Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.</Para>
</Abstract>
<KeywordGroup Language="En"><Keyword>non-associative Lambek calculus</Keyword>
<Keyword>linear logic</Keyword>
<Keyword>proof-net</Keyword>
</KeywordGroup>
</ArticleHeader>
<NoBody></NoBody>
</Article>
</Issue>
</Volume>
</Journal>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Classical Non-Associative Lambek Calculus</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Classical Non-Associative Lambek Calculus</title>
</titleInfo>
<name type="personal"><namePart type="given">Philippe</namePart>
<namePart type="family">de Groote</namePart>
<affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</affiliation>
<affiliation>E-mail: degroote@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">François</namePart>
<namePart type="family">Lamarche</namePart>
<affiliation>Projet Calligramme, LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France</affiliation>
<affiliation>E-mail: lamarche@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="research-article" displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre>
<originInfo><publisher>Kluwer Academic Publishers</publisher>
<place><placeTerm type="text">Dordrecht</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2002-08-01</dateIssued>
<copyrightDate encoding="w3cdtf">2002</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.</abstract>
<subject lang="en"><topic>non-associative Lambek calculus</topic>
<topic>linear logic</topic>
<topic>proof-net</topic>
</subject>
<relatedItem type="host"><titleInfo><title>Studia Logica</title>
<subTitle>An International Journal for Symbolic Logic</subTitle>
</titleInfo>
<titleInfo type="abbreviated"><title>Studia Logica</title>
</titleInfo>
<genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre>
<originInfo><publisher>Springer</publisher>
<dateIssued encoding="w3cdtf">2002-08-01</dateIssued>
<copyrightDate encoding="w3cdtf">2002</copyrightDate>
</originInfo>
<subject><genre>Philosophy</genre>
<topic>Logic</topic>
<topic>Mathematical Logic and Foundations</topic>
<topic>Computational Linguistics</topic>
</subject>
<identifier type="ISSN">0039-3215</identifier>
<identifier type="eISSN">1572-8730</identifier>
<identifier type="JournalID">11225</identifier>
<identifier type="IssueArticleCount">8</identifier>
<identifier type="VolumeIssueCount">3</identifier>
<part><date>2002</date>
<detail type="issue"><title>Special Issue: The Lambek Calculus in Logic and Linguistics edited by</title>
</detail>
<detail type="volume"><number>71</number>
<caption>vol.</caption>
</detail>
<detail type="issue"><number>3</number>
<caption>no.</caption>
</detail>
<extent unit="pages"><start>355</start>
<end>388</end>
</extent>
</part>
<recordInfo><recordOrigin>Kluwer Academic Publishers, 2002</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">A964F6DB983DBE7AAD56611885CD0BFF80E9F433</identifier>
<identifier type="ark">ark:/67375/VQC-640NC27Q-2</identifier>
<identifier type="DOI">10.1023/A:1020520915016</identifier>
<identifier type="ArticleID">5098765</identifier>
<identifier type="ArticleID">Art5</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Kluwer Academic Publishers, 2002</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource>
<recordOrigin>Kluwer Academic Publishers, 2002</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-640NC27Q-2/record.json</uri>
</json:item>
</metadata>
<serie></serie>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002810 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002810 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:A964F6DB983DBE7AAD56611885CD0BFF80E9F433
   |texte=   Classical Non-Associative Lambek Calculus
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Classical Non-Associative Lambek Calculus

Classical Non-Associative Lambek Calculus

Source :

English descriptors

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri