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.

Extensions of initial models and their second-order proof systems

Identifieur interne : 003378 ( Istex/Curation ); précédent : 003377; suivant : 003379

Extensions of initial models and their second-order proof systems

Auteurs : Pierre-Yves Schobbens

Source :

RBID : ISTEX:DB032FD0F28BEABCFE7B856F40B9D41D133E9137

Abstract

Abstract: Besides explicit axioms, an algebraic specification language contains model-theoretic constraints such as initiality. For proving properties of specifications and refining them to programs, an axiomatization of these constraints is needed; unfortunately, no effective, sound and complete proof system can be constructed for initial models, and a fortiori for their extensions. In this paper, we construct non-effective second-order axiomatizations for the initiality constraint, and its recently proposed extensions (minimal, quasi-free and surjective models) designed to deal with disjunction and existential quantification.

Url:
DOI: 10.1007/3-540-58233-9_15

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


Links to Exploration step

ISTEX:DB032FD0F28BEABCFE7B856F40B9D41D133E9137

Curation

No country items

Pierre-Yves Schobbens
<affiliation>
<mods:affiliation>Fac. Univ. Notre-Dame de la Paix, Institut d'Informatique, Rue Grandgagnage 21, B-5000, Namur</mods:affiliation>
<wicri:noCountry code="subField">Namur</wicri:noCountry>
</affiliation>

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Extensions of initial models and their second-order proof systems</title>
<author>
<name sortKey="Schobbens, Pierre Yves" sort="Schobbens, Pierre Yves" uniqKey="Schobbens P" first="Pierre-Yves" last="Schobbens">Pierre-Yves Schobbens</name>
<affiliation>
<mods:affiliation>Fac. Univ. Notre-Dame de la Paix, Institut d'Informatique, Rue Grandgagnage 21, B-5000, Namur</mods:affiliation>
<wicri:noCountry code="subField">Namur</wicri:noCountry>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:DB032FD0F28BEABCFE7B856F40B9D41D133E9137</idno>
<date when="1994" year="1994">1994</date>
<idno type="doi">10.1007/3-540-58233-9_15</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-HTG195TJ-L/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003420</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003420</idno>
<idno type="wicri:Area/Istex/Curation">003378</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Extensions of initial models and their second-order proof systems</title>
<author>
<name sortKey="Schobbens, Pierre Yves" sort="Schobbens, Pierre Yves" uniqKey="Schobbens P" first="Pierre-Yves" last="Schobbens">Pierre-Yves Schobbens</name>
<affiliation>
<mods:affiliation>Fac. Univ. Notre-Dame de la Paix, Institut d'Informatique, Rue Grandgagnage 21, B-5000, Namur</mods:affiliation>
<wicri:noCountry code="subField">Namur</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: Besides explicit axioms, an algebraic specification language contains model-theoretic constraints such as initiality. For proving properties of specifications and refining them to programs, an axiomatization of these constraints is needed; unfortunately, no effective, sound and complete proof system can be constructed for initial models, and a fortiori for their extensions. In this paper, we construct non-effective second-order axiomatizations for the initiality constraint, and its recently proposed extensions (minimal, quasi-free and surjective models) designed to deal with disjunction and existential quantification.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003378 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 003378 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Curation
   |type=    RBID
   |clé=     ISTEX:DB032FD0F28BEABCFE7B856F40B9D41D133E9137
   |texte=   Extensions of initial models and their second-order proof systems
}}

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