Curation
PascalFrancis
Racine
Curation
Checkpoint
PascalFrancis
Racine
PascalFrancis
Exploration
Accueil
Racine
Racine

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.

Towards abstract categorial grammars

Identifieur interne : 000A45 ( PascalFrancis/Curation ); précédent : 000A44; suivant : 000A46

Towards abstract categorial grammars

Auteurs : Philippe De Groote [France]

Source :

RBID : Francis:524-06-10173

Descripteurs français

English descriptors

Abstract

We introduce a new categorial formalism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. As a consequence, the formalism is reversible and provides different computational paradigms that may be freely composed together.
pA  
A08 01  1  ENG  @1 Towards abstract categorial grammars
A09 01  1  ENG  @1 39th annual meeting & 10th conference of the European Chapter : Toulouse, 9-11 July 2001
A11 01  1    @1 DE GROOTE (Philippe)
A14 01      @1 LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre lès Nancy @3 FRA @Z 1 aut.
A18 01  1    @1 Association for Computational Linguistics @3 INC @9 patr.
A20       @1 148-155
A21       @1 2001
A23 01      @0 ENG
A25 01      @1 Morgan Kaufman Publishers @2 [S. l.]
A26 01      @0 1-55860-767-6
A30 01  1  ENG  @1 Association for Computational Linguistics. Annual meeting @2 39 @3 Toulouse FRA @4 2001-07-09
A30 02  1  ENG  @1 Association for Computational Linguistics. Conference @2 10 @3 Toulouse FRA @4 2001-07-09
A43 01      @1 INIST @2 Y 38263 @5 354000124405670190
A44       @0 0000 @1 © 2006 INIST-CNRS. All rights reserved.
A45       @0 21 ref.
A47 01  1    @0 524-06-10173
A60       @1 C
A61       @0 A
A66 01      @0 INC
A68 01  1  FRE  @1 Vers des grammaires catégorielles abstraites
C01 01    ENG  @0 We introduce a new categorial formalism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. As a consequence, the formalism is reversible and provides different computational paradigms that may be freely composed together.
C02 01  L    @0 52458 @1 XII
C02 02  L    @0 524
C03 01  L  FRE  @0 Linguistique mathématique @2 NI @5 01
C03 01  L  ENG  @0 Mathematical linguistics @2 NI @5 01
C03 02  L  FRE  @0 Grammaire formelle @2 NI @5 02
C03 02  L  ENG  @0 Formal grammar @2 NI @5 02
C03 03  L  FRE  @0 Grammaire catégorielle @2 NI @5 03
C03 03  L  ENG  @0 Categorial grammar @2 NI @5 03
C03 04  L  FRE  @0 Linguistique informatique @2 NI @5 04
C03 04  L  ENG  @0 Computational linguistics @2 NI @5 04
C03 05  L  FRE  @0 Abstraction @2 NI @5 05
C03 05  L  ENG  @0 Abstraction @2 NI @5 05
C03 06  L  FRE  @0 Logique linéaire @2 NI @4 CD @5 96
C03 06  L  ENG  @0 Linear logic @2 NI @4 CD @5 96
N21       @1 002

Links toward previous steps (curation, corpus...)

Links to Exploration step

Francis:524-06-10173

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Towards abstract categorial grammars</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 wicri:level="1">
<inist:fA14 i1="01">
<s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">524-06-10173</idno>
<date when="2001">2001</date>
<idno type="stanalyst">FRANCIS 524-06-10173 INIST</idno>
<idno type="RBID">Francis:524-06-10173</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000498</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000A45</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Towards abstract categorial grammars</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 wicri:level="1">
<inist:fA14 i1="01">
<s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Abstraction</term>
<term>Categorial grammar</term>
<term>Computational linguistics</term>
<term>Formal grammar</term>
<term>Linear logic</term>
<term>Mathematical linguistics</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Linguistique mathématique</term>
<term>Grammaire formelle</term>
<term>Grammaire catégorielle</term>
<term>Linguistique informatique</term>
<term>Abstraction</term>
<term>Logique linéaire</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">We introduce a new categorial formalism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. As a consequence, the formalism is reversible and provides different computational paradigms that may be freely composed together.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA08 i1="01" i2="1" l="ENG">
<s1>Towards abstract categorial grammars</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>39th annual meeting & 10th conference of the European Chapter : Toulouse, 9-11 July 2001</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>DE GROOTE (Philippe)</s1>
</fA11>
<fA14 i1="01">
<s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1">
<s1>Association for Computational Linguistics</s1>
<s3>INC</s3>
<s9>patr.</s9>
</fA18>
<fA20>
<s1>148-155</s1>
</fA20>
<fA21>
<s1>2001</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA25 i1="01">
<s1>Morgan Kaufman Publishers</s1>
<s2>[S. l.]</s2>
</fA25>
<fA26 i1="01">
<s0>1-55860-767-6</s0>
</fA26>
<fA30 i1="01" i2="1" l="ENG">
<s1>Association for Computational Linguistics. Annual meeting</s1>
<s2>39</s2>
<s3>Toulouse FRA</s3>
<s4>2001-07-09</s4>
</fA30>
<fA30 i1="02" i2="1" l="ENG">
<s1>Association for Computational Linguistics. Conference</s1>
<s2>10</s2>
<s3>Toulouse FRA</s3>
<s4>2001-07-09</s4>
</fA30>
<fA43 i1="01">
<s1>INIST</s1>
<s2>Y 38263</s2>
<s5>354000124405670190</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>21 ref.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>524-06-10173</s0>
</fA47>
<fA60>
<s1>C</s1>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA66 i1="01">
<s0>INC</s0>
</fA66>
<fA68 i1="01" i2="1" l="FRE">
<s1>Vers des grammaires catégorielles abstraites</s1>
</fA68>
<fC01 i1="01" l="ENG">
<s0>We introduce a new categorial formalism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. As a consequence, the formalism is reversible and provides different computational paradigms that may be freely composed together.</s0>
</fC01>
<fC02 i1="01" i2="L">
<s0>52458</s0>
<s1>XII</s1>
</fC02>
<fC02 i1="02" i2="L">
<s0>524</s0>
</fC02>
<fC03 i1="01" i2="L" l="FRE">
<s0>Linguistique mathématique</s0>
<s2>NI</s2>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="L" l="ENG">
<s0>Mathematical linguistics</s0>
<s2>NI</s2>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="L" l="FRE">
<s0>Grammaire formelle</s0>
<s2>NI</s2>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="L" l="ENG">
<s0>Formal grammar</s0>
<s2>NI</s2>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="L" l="FRE">
<s0>Grammaire catégorielle</s0>
<s2>NI</s2>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="L" l="ENG">
<s0>Categorial grammar</s0>
<s2>NI</s2>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="L" l="FRE">
<s0>Linguistique informatique</s0>
<s2>NI</s2>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="L" l="ENG">
<s0>Computational linguistics</s0>
<s2>NI</s2>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="L" l="FRE">
<s0>Abstraction</s0>
<s2>NI</s2>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="L" l="ENG">
<s0>Abstraction</s0>
<s2>NI</s2>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="L" l="FRE">
<s0>Logique linéaire</s0>
<s2>NI</s2>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="06" i2="L" l="ENG">
<s0>Linear logic</s0>
<s2>NI</s2>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21>
<s1>002</s1>
</fN21>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation

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

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000A45 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Francis:524-06-10173
   |texte=   Towards abstract categorial grammars
}}
Wicri

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