InforLorV4, PascalFrancis, Corpus, bibRecord, 000B16

Hol-λσ : An intentional first-order expression of higher-order logic

Identifieur interne : 000B16 ( PascalFrancis/Corpus ); précédent : 000B15; suivant : 000B17

Hol-λσ : An intentional first-order expression of higher-order logic

Auteurs : G. Dowek ; T. Hardin ; C. Kirchner

Source :

Lecture notes in computer science [ 0302-9743 ] ; 1999.

RBID : Pascal:99-0409398

Descripteurs français

Pascal (Inist)
- Informatique théorique, Système réécriture, Programmation logique, Optimisation programme, Preuve programme, Lambda calcul.

English descriptors

KwdEn :
- Computer theory, Lambda calculus, Logical programming, Program optimization, Program proof, Rewriting systems.

Abstract

We propose a first-order presentation of higher-order logic based on explicit substitutions. It is intentionally equivalent to the usual presentation of higher-order logic based on λ-calculus, i.e. a proposition can be proved without the extensionality axioms in one theory if and only if it can in the other. The Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. This allows to simulate higher-order resolution step by step and furthermore leaves room for further optimizations and extensions.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1631`
A08	`01`	`1`	`ENG`	`@1 Hol-λσ : An intentional first-order expression of higher-order logic`
A09	`01`	`1`	`ENG`	`@1 RTA-99 : rewriting techniques and applications : Trento, 2-4 July 1999`
A11	`01`	`1`		`@1 DOWEK (G.)`
A11	`02`	`1`		`@1 HARDIN (T.)`
A11	`03`	`1`		`@1 KIRCHNER (C.)`
A12	`01`	`1`		`@1 NARENDRAN (Paliath) @9 ed.`
A12	`02`	`1`		`@1 RUSINOWITCH (Michael) @9 ed.`
A14	`01`			`@1 INRIA-Rocquencourt, B.P. 105 @2 78153 Le Chesnay Cedex @3 FRA @Z 1 aut.`
A14	`02`			`@1 LIP6, UPMC, 4 place Jussieu @2 75252 Paris @3 FRA @Z 2 aut.`
A14	`03`			`@1 LORIA & INRIA, 615, rue du Jardin Botanique @2 54600 Villers-lès-Nancy @3 FRA @Z 3 aut.`
A20				`@1 317-331`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-66201-4`
A43	`01`			`@1 INIST @2 16343 @5 354000084541270260`
A44				`@0 0000 @1 © 1999 INIST-CNRS. All rights reserved.`
A45				`@0 1 p.1/4`
A47	`01`	`1`		`@0 99-0409398`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	@0 We propose a first-order presentation of higher-order logic based on explicit substitutions. It is intentionally equivalent to the usual presentation of higher-order logic based on λ-calculus, i.e. a proposition can be proved without the extensionality axioms in one theory if and only if it can in the other. The Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. This allows to simulate higher-order resolution step by step and furthermore leaves room for further optimizations and extensions.
C02	`01`	`X`		`@0 001D02A07`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`3`	`FRE`	`@0 Système réécriture @5 02`
C03	`02`	`3`	`ENG`	`@0 Rewriting systems @5 02`
C03	`03`	`X`	`FRE`	`@0 Programmation logique @5 03`
C03	`03`	`X`	`ENG`	`@0 Logical programming @5 03`
C03	`03`	`X`	`SPA`	`@0 Programación lógica @5 03`
C03	`04`	`X`	`FRE`	`@0 Optimisation programme @5 04`
C03	`04`	`X`	`ENG`	`@0 Program optimization @5 04`
C03	`04`	`X`	`SPA`	`@0 Optimización programa @5 04`
C03	`05`	`X`	`FRE`	`@0 Preuve programme @5 05`
C03	`05`	`X`	`ENG`	`@0 Program proof @5 05`
C03	`05`	`X`	`SPA`	`@0 Prueba programa @5 05`
C03	`06`	`X`	`FRE`	`@0 Lambda calcul @5 06`
C03	`06`	`X`	`ENG`	`@0 Lambda calculus @5 06`
C03	`06`	`X`	`SPA`	`@0 Lambda cálculo @5 06`
N21				`@1 263`

A30	`01`	`1`	`ENG`	`@1 Rewriting techniques and applications. International conference @2 10 @3 Trento ITA @4 1999-07-02`

Format Inist (serveur)

NO :	PASCAL 99-0409398 INIST
ET :	Hol-λσ : An intentional first-order expression of higher-order logic
AU :	DOWEK (G.); HARDIN (T.); KIRCHNER (C.); NARENDRAN (Paliath); RUSINOWITCH (Michael)
AF :	INRIA-Rocquencourt, B.P. 105/78153 Le Chesnay Cedex/France (1 aut.); LIP6, UPMC, 4 place Jussieu/75252 Paris/France (2 aut.); LORIA & INRIA, 615, rue du Jardin Botanique/54600 Villers-lès-Nancy/France (3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1631; Pp. 317-331; Bibl. 1 p.1/4
LA :	Anglais
EA :	We propose a first-order presentation of higher-order logic based on explicit substitutions. It is intentionally equivalent to the usual presentation of higher-order logic based on λ-calculus, i.e. a proposition can be proved without the extensionality axioms in one theory if and only if it can in the other. The Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. This allows to simulate higher-order resolution step by step and furthermore leaves room for further optimizations and extensions.
CC :	001D02A07
FD :	Informatique théorique; Système réécriture; Programmation logique; Optimisation programme; Preuve programme; Lambda calcul
ED :	Computer theory; Rewriting systems; Logical programming; Program optimization; Program proof; Lambda calculus
SD :	Informática teórica; Programación lógica; Optimización programa; Prueba programa; Lambda cálculo
LO :	INIST-16343.354000084541270260
ID :	99-0409398

Links to Exploration step

Pascal:99-0409398

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Hol-λσ : An intentional first-order expression of higher-order logic</title>
<author><name sortKey="Dowek, G" sort="Dowek, G" uniqKey="Dowek G" first="G." last="Dowek">G. Dowek</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA-Rocquencourt, B.P. 105</s1>
<s2>78153 Le Chesnay Cedex</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hardin, T" sort="Hardin, T" uniqKey="Hardin T" first="T." last="Hardin">T. Hardin</name>
<affiliation><inist:fA14 i1="02"><s1>LIP6, UPMC, 4 place Jussieu</s1>
<s2>75252 Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA & INRIA, 615, rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0409398</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0409398 INIST</idno>
<idno type="RBID">Pascal:99-0409398</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B16</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Hol-λσ : An intentional first-order expression of higher-order logic</title>
<author><name sortKey="Dowek, G" sort="Dowek, G" uniqKey="Dowek G" first="G." last="Dowek">G. Dowek</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA-Rocquencourt, B.P. 105</s1>
<s2>78153 Le Chesnay Cedex</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hardin, T" sort="Hardin, T" uniqKey="Hardin T" first="T." last="Hardin">T. Hardin</name>
<affiliation><inist:fA14 i1="02"><s1>LIP6, UPMC, 4 place Jussieu</s1>
<s2>75252 Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA & INRIA, 615, rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1999">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term>
<term>Lambda calculus</term>
<term>Logical programming</term>
<term>Program optimization</term>
<term>Program proof</term>
<term>Rewriting systems</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Système réécriture</term>
<term>Programmation logique</term>
<term>Optimisation programme</term>
<term>Preuve programme</term>
<term>Lambda calcul</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose a first-order presentation of higher-order logic based on explicit substitutions. It is intentionally equivalent to the usual presentation of higher-order logic based on λ-calculus, i.e. a proposition can be proved without the extensionality axioms in one theory if and only if it can in the other. The Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. This allows to simulate higher-order resolution step by step and furthermore leaves room for further optimizations and extensions.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1631</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Hol-λσ : An intentional first-order expression of higher-order logic</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>RTA-99 : rewriting techniques and applications : Trento, 2-4 July 1999</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DOWEK (G.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>HARDIN (T.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KIRCHNER (C.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>NARENDRAN (Paliath)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>RUSINOWITCH (Michael)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>INRIA-Rocquencourt, B.P. 105</s1>
<s2>78153 Le Chesnay Cedex</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LIP6, UPMC, 4 place Jussieu</s1>
<s2>75252 Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LORIA & INRIA, 615, rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>317-331</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-66201-4</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000084541270260</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1 p.1/4</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0409398</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We propose a first-order presentation of higher-order logic based on explicit substitutions. It is intentionally equivalent to the usual presentation of higher-order logic based on λ-calculus, i.e. a proposition can be proved without the extensionality axioms in one theory if and only if it can in the other. The Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. This allows to simulate higher-order resolution step by step and furthermore leaves room for further optimizations and extensions.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Optimisation programme</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Program optimization</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Optimización programa</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Preuve programme</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Program proof</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Prueba programa</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Lambda calcul</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Lambda calculus</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Lambda cálculo</s0>
<s5>06</s5>
</fC03>
<fN21><s1>263</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Rewriting techniques and applications. International conference</s1>
<s2>10</s2>
<s3>Trento ITA</s3>
<s4>1999-07-02</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 99-0409398 INIST</NO>
<ET>Hol-λσ : An intentional first-order expression of higher-order logic</ET>
<AU>DOWEK (G.); HARDIN (T.); KIRCHNER (C.); NARENDRAN (Paliath); RUSINOWITCH (Michael)</AU>
<AF>INRIA-Rocquencourt, B.P. 105/78153 Le Chesnay Cedex/France (1 aut.); LIP6, UPMC, 4 place Jussieu/75252 Paris/France (2 aut.); LORIA & INRIA, 615, rue du Jardin Botanique/54600 Villers-lès-Nancy/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1631; Pp. 317-331; Bibl. 1 p.1/4</SO>
<LA>Anglais</LA>
<EA>We propose a first-order presentation of higher-order logic based on explicit substitutions. It is intentionally equivalent to the usual presentation of higher-order logic based on λ-calculus, i.e. a proposition can be proved without the extensionality axioms in one theory if and only if it can in the other. The Extended Narrowing and Resolution first-order proof-search method can be applied to this theory. This allows to simulate higher-order resolution step by step and furthermore leaves room for further optimizations and extensions.</EA>
<CC>001D02A07</CC>
<FD>Informatique théorique; Système réécriture; Programmation logique; Optimisation programme; Preuve programme; Lambda calcul</FD>
<ED>Computer theory; Rewriting systems; Logical programming; Program optimization; Program proof; Lambda calculus</ED>
<SD>Informática teórica; Programación lógica; Optimización programa; Prueba programa; Lambda cálculo</SD>
<LO>INIST-16343.354000084541270260</LO>
<ID>99-0409398</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

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

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:99-0409398
   |texte=   Hol-λσ : An intentional first-order expression of higher-order logic
}}

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

Hol-λσ : An intentional first-order expression of higher-order logic

Hol-λσ : An intentional first-order expression of higher-order logic

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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