Combining algebraic and set-theoretic specifications
Identifieur interne :
000C76 ( PascalFrancis/Corpus );
précédent :
000C75;
suivant :
000C77
Combining algebraic and set-theoretic specifications
Auteurs : C. Hintermeier ;
H. Kirchner ;
P. D. MossesSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 1996.
RBID : Pascal:97-0176073
Descripteurs français
English descriptors
Abstract
Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1130 |
|---|
| A08 | 01 | 1 | ENG | @1 Combining algebraic and set-theoretic specifications |
|---|
| A09 | 01 | 1 | ENG | @1 Recent trends in data type specification : Oslo, September 19-23, 1995, selected papers |
|---|
| A11 | 01 | 1 | | @1 HINTERMEIER (C.) |
|---|
| A11 | 02 | 1 | | @1 KIRCHNER (H.) |
|---|
| A11 | 03 | 1 | | @1 MOSSES (P. D.) |
|---|
| A12 | 01 | 1 | | @1 HAVERAAEN (Magne) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 OWE (Olaf) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 DAHL (Ole-Johan) @9 ed. |
|---|
| A14 | 01 | | | @1 CRIN-CNRS & INRIA-Lorraine, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. |
|---|
| A14 | 02 | | | @1 BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540 @2 8000 Aarhus C @3 DNK @Z 3 aut. |
|---|
| A20 | | | | @1 255-273 |
|---|
| A21 | | | | @1 1996 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000063979710160 |
|---|
| A44 | | | | @0 0000 @1 © 1997 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 20 ref. |
|---|
| A47 | 01 | 1 | | @0 97-0176073 |
|---|
| 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 Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory. |
|---|
| C02 | 01 | X | | @0 001D02A02 |
|---|
| C02 | 02 | X | | @0 001D02B07B |
|---|
| C03 | 01 | X | FRE | @0 Type abstrait @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Abstract data type @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Tipo abstracto @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Type donnée @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Data type @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Tipo dato @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Sémantique @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Semantics @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Semántica @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Spécification @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Specification @5 04 |
|---|
| C03 | 04 | X | GER | @0 Spezifikation @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Especificación @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Calcul prédicat @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Predicate calculus @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Cálculo predicado @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 |
|---|
| C03 | 07 | X | FRE | @0 Structure donnée @5 07 |
|---|
| C03 | 07 | X | ENG | @0 Data structure @5 07 |
|---|
| C03 | 07 | X | SPA | @0 Estructura datos @5 07 |
|---|
| C03 | 08 | X | FRE | @0 Théorie preuve @5 08 |
|---|
| C03 | 08 | X | ENG | @0 Proof theory @5 08 |
|---|
| C03 | 08 | X | SPA | @0 Teoría demonstración @5 08 |
|---|
| C03 | 09 | X | FRE | @0 Horn clause @4 INC @5 72 |
|---|
| N21 | | | | @1 083 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Workshop on specification of abstract data types @2 11 @3 Oslo NOR @4 1995-09-19 |
|---|
| A30 | 02 | 1 | ENG | @1 COMPASS workshop @2 8 @3 Oslo NOR @4 1995-09-19 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 97-0176073 INIST |
|---|
| ET : | Combining algebraic and set-theoretic specifications |
|---|
| AU : | HINTERMEIER (C.); KIRCHNER (H.); MOSSES (P. D.); HAVERAAEN (Magne); OWE (Olaf); DAHL (Ole-Johan) |
|---|
| AF : | CRIN-CNRS & INRIA-Lorraine, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540/8000 Aarhus C/Danemark (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1130; Pp. 255-273; Bibl. 20 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory. |
|---|
| CC : | 001D02A02; 001D02B07B |
|---|
| FD : | Type abstrait; Type donnée; Sémantique; Spécification; Calcul prédicat; Lambda calcul; Structure donnée; Théorie preuve; Horn clause |
|---|
| ED : | Abstract data type; Data type; Semantics; Specification; Predicate calculus; Lambda calculus; Data structure; Proof theory |
|---|
| GD : | Spezifikation |
|---|
| SD : | Tipo abstracto; Tipo dato; Semántica; Especificación; Cálculo predicado; Lambda cálculo; Estructura datos; Teoría demonstración |
|---|
| LO : | INIST-16343.354000063979710160 |
|---|
| ID : | 97-0176073 |
|---|
Links to Exploration step
Pascal:97-0176073
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Combining algebraic and set-theoretic specifications</title>
<author><name sortKey="Hintermeier, C" sort="Hintermeier, C" uniqKey="Hintermeier C" first="C." last="Hintermeier">C. Hintermeier</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, H" sort="Kirchner, H" uniqKey="Kirchner H" first="H." last="Kirchner">H. Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Mosses, P D" sort="Mosses, P D" uniqKey="Mosses P" first="P. D." last="Mosses">P. D. Mosses</name>
<affiliation><inist:fA14 i1="02"><s1>BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540</s1>
<s2>8000 Aarhus C</s2>
<s3>DNK</s3>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0176073</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 97-0176073 INIST</idno>
<idno type="RBID">Pascal:97-0176073</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C76</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Combining algebraic and set-theoretic specifications</title>
<author><name sortKey="Hintermeier, C" sort="Hintermeier, C" uniqKey="Hintermeier C" first="C." last="Hintermeier">C. Hintermeier</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, H" sort="Kirchner, H" uniqKey="Kirchner H" first="H." last="Kirchner">H. Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Mosses, P D" sort="Mosses, P D" uniqKey="Mosses P" first="P. D." last="Mosses">P. D. Mosses</name>
<affiliation><inist:fA14 i1="02"><s1>BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540</s1>
<s2>8000 Aarhus C</s2>
<s3>DNK</s3>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1996">1996</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abstract data type</term>
<term>Data structure</term>
<term>Data type</term>
<term>Lambda calculus</term>
<term>Predicate calculus</term>
<term>Proof theory</term>
<term>Semantics</term>
<term>Specification</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Type abstrait</term>
<term>Type donnée</term>
<term>Sémantique</term>
<term>Spécification</term>
<term>Calcul prédicat</term>
<term>Lambda calcul</term>
<term>Structure donnée</term>
<term>Théorie preuve</term>
<term>Horn clause</term>
</keywords><front><div type="abstract" xml:lang="en">Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1130</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Combining algebraic and set-theoretic specifications</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Recent trends in data type specification : Oslo, September 19-23, 1995, selected papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>HINTERMEIER (C.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>KIRCHNER (H.)</s1>
</fA11><fA11 i1="03" i2="1"><s1>MOSSES (P. D.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>HAVERAAEN (Magne)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>OWE (Olaf)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>DAHL (Ole-Johan)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="02"><s1>BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540</s1>
<s2>8000 Aarhus C</s2>
<s3>DNK</s3>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>255-273</s1>
</fA20><fA21><s1>1996</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000063979710160</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>20 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>97-0176073</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><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>Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A02</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02B07B</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Type abstrait</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Abstract data type</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Tipo abstracto</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Type donnée</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Data type</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Tipo dato</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Sémantique</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Semantics</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Semántica</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Spécification</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Specification</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="GER"><s0>Spezifikation</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Especificación</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Calcul prédicat</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Predicate calculus</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Cálculo predicado</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><fC03 i1="07" i2="X" l="FRE"><s0>Structure donnée</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Data structure</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Estructura datos</s0>
<s5>07</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Théorie preuve</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Proof theory</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Teoría demonstración</s0>
<s5>08</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Horn clause</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03><fN21><s1>083</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Workshop on specification of abstract data types</s1>
<s2>11</s2>
<s3>Oslo NOR</s3>
<s4>1995-09-19</s4>
</fA30><fA30 i1="02" i2="1" l="ENG"><s1>COMPASS workshop</s1>
<s2>8</s2>
<s3>Oslo NOR</s3>
<s4>1995-09-19</s4>
</fA30><server><NO>PASCAL 97-0176073 INIST</NO>
<ET>Combining algebraic and set-theoretic specifications</ET>
<AU>HINTERMEIER (C.); KIRCHNER (H.); MOSSES (P. D.); HAVERAAEN (Magne); OWE (Olaf); DAHL (Ole-Johan)</AU>
<AF>CRIN-CNRS & INRIA-Lorraine, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540/8000 Aarhus C/Danemark (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1130; Pp. 255-273; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory.</EA>
<CC>001D02A02; 001D02B07B</CC>
<FD>Type abstrait; Type donnée; Sémantique; Spécification; Calcul prédicat; Lambda calcul; Structure donnée; Théorie preuve; Horn clause</FD>
<ED>Abstract data type; Data type; Semantics; Specification; Predicate calculus; Lambda calculus; Data structure; Proof theory</ED>
<GD>Spezifikation</GD>
<SD>Tipo abstracto; Tipo dato; Semántica; Especificación; Cálculo predicado; Lambda cálculo; Estructura datos; Teoría demonstración</SD>
<LO>INIST-16343.354000063979710160</LO>
<ID>97-0176073</ID>
</server>
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 000C76 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C76 | 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:97-0176073
|texte= Combining algebraic and set-theoretic specifications
}}
| 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 |  |
