A reflective extension of ELAN
Identifieur interne : 00A350 ( Main/Merge ); précédent : 00A349; suivant : 00A351A reflective extension of ELAN
Auteurs : Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]Source :
- Electronic Notes in Theoretical Computer Science [ 1571-0661 ] ; 1996.
English descriptors
- Teeft :
- Axiom, Candidate rule, Computational, Computational systems, Computer science, Concatenation operator, Conditional parts, Deduction rules, Earley algorithm, Ectation, Ectations, Ection, Ective, Ective capabilities, Ective extension, Ective logics, Ective transformations, Elan, Elan module, Elan program, Elan programs, Elan system, Electronic notes, Elim, Elim whereelim, Empty list, Entailment, Entailment relation, Entailment system, Erent, Erent approaches, Erent proofs, Exivity, Function symbols, Identi, Induction hypothesis, International workshop, Kirchner, List identi, List type, Local identities, Logic programming, Module, Module msterm, Moreau, Nite, Nite number, Normal form, Object theory, Parallel move lemma, Previous section, Programming languages, Proof term, Proof term equivalent, Proof terms, Proofterm, Record subproofs, Representable theories, Representation function, Rulebody, Rwrule, Same sequent, Sequent, Sequents, Several applications, Sort type, Strategy language, Subproof terms, Substitution, Successive applications, Technical report irst, Theoretical computer science, Transitivity, Transitivity building, Translation mechanism, Universal theory.
Abstract
Abstract: The expressivity of rewriting logic as meta-logic has been already convincingly illustrated. The goal of this paper is to explore the reflective capabilities of ELAN, a language based on the concepts of computational systems and rewriting logic. We define a universal theory for the class of ELAN programs and the representation function associated to this universal theory. Then we detail the effective transformations to implement and propose the definition of two built-in modules that provide the last step to get the reflective capabilities we want for the ELAN system.
Url:
DOI: 10.1016/S1571-0661(04)00038-6
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001936
- to stream Istex, to step Curation: 001917
- to stream Istex, to step Checkpoint: 002022
Links to Exploration step
ISTEX:6CDB0E2C607FA9B4D8CD655FD02A65AD2A456350Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A reflective extension of ELAN</title><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name></author><author><name sortKey="Moreau, Pierre Etienne" sort="Moreau, Pierre Etienne" uniqKey="Moreau P" first="Pierre-Etienne" last="Moreau">Pierre-Etienne Moreau</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6CDB0E2C607FA9B4D8CD655FD02A65AD2A456350</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1016/S1571-0661(04)00038-6</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-RZVL73C7-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001936</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001936</idno><idno type="wicri:Area/Istex/Curation">001917</idno><idno type="wicri:Area/Istex/Checkpoint">002022</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002022</idno><idno type="wicri:doubleKey">1571-0661:2000:Kirchner H:a:reflective:extension</idno><idno type="wicri:Area/Main/Merge">00A350</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A reflective extension of ELAN</title><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Moreau, Pierre Etienne" sort="Moreau, Pierre Etienne" uniqKey="Moreau P" first="Pierre-Etienne" last="Moreau">Pierre-Etienne Moreau</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Electronic Notes in Theoretical Computer Science</title><title level="j" type="abbrev">ENTCS</title><idno type="ISSN">1571-0661</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1996">1996</date><biblScope unit="volume">4</biblScope><biblScope unit="supplement">C</biblScope><biblScope unit="page" from="149">149</biblScope><biblScope unit="page" to="168">168</biblScope></imprint><idno type="ISSN">1571-0661</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1571-0661</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Axiom</term><term>Candidate rule</term><term>Computational</term><term>Computational systems</term><term>Computer science</term><term>Concatenation operator</term><term>Conditional parts</term><term>Deduction rules</term><term>Earley algorithm</term><term>Ectation</term><term>Ectations</term><term>Ection</term><term>Ective</term><term>Ective capabilities</term><term>Ective extension</term><term>Ective logics</term><term>Ective transformations</term><term>Elan</term><term>Elan module</term><term>Elan program</term><term>Elan programs</term><term>Elan system</term><term>Electronic notes</term><term>Elim</term><term>Elim whereelim</term><term>Empty list</term><term>Entailment</term><term>Entailment relation</term><term>Entailment system</term><term>Erent</term><term>Erent approaches</term><term>Erent proofs</term><term>Exivity</term><term>Function symbols</term><term>Identi</term><term>Induction hypothesis</term><term>International workshop</term><term>Kirchner</term><term>List identi</term><term>List type</term><term>Local identities</term><term>Logic programming</term><term>Module</term><term>Module msterm</term><term>Moreau</term><term>Nite</term><term>Nite number</term><term>Normal form</term><term>Object theory</term><term>Parallel move lemma</term><term>Previous section</term><term>Programming languages</term><term>Proof term</term><term>Proof term equivalent</term><term>Proof terms</term><term>Proofterm</term><term>Record subproofs</term><term>Representable theories</term><term>Representation function</term><term>Rulebody</term><term>Rwrule</term><term>Same sequent</term><term>Sequent</term><term>Sequents</term><term>Several applications</term><term>Sort type</term><term>Strategy language</term><term>Subproof terms</term><term>Substitution</term><term>Successive applications</term><term>Technical report irst</term><term>Theoretical computer science</term><term>Transitivity</term><term>Transitivity building</term><term>Translation mechanism</term><term>Universal theory</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The expressivity of rewriting logic as meta-logic has been already convincingly illustrated. The goal of this paper is to explore the reflective capabilities of ELAN, a language based on the concepts of computational systems and rewriting logic. We define a universal theory for the class of ELAN programs and the representation function associated to this universal theory. Then we detail the effective transformations to implement and propose the definition of two built-in modules that provide the last step to get the reflective capabilities we want for the ELAN system.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A350 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00A350 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:6CDB0E2C607FA9B4D8CD655FD02A65AD2A456350
|texte= A reflective extension of ELAN
}}
| This area was generated with Dilib version V0.6.33. |  |