Travelled to:1 × Denmark
1 × Finland
1 × Israel
1 × Poland
1 × Sweden
1 × The Netherlands
1 × United Kingdom
2 × Germany
2 × Spain
3 × France
4 × Italy
5 × USA
Collaborated with:C.Kirchner P.Moreau P.Borovanský ∅ I.Gnaedig C.Ringeissen J.Jouannaud O.Fissore M.Fernández B.Pinaud O.Namet C.Hintermeier J.Meseguer J.Vallet G.Melançon E.Deplagne Q.H.Nguyen A.Mégrelis P.Réty P.Lescanne O.Bournez G.Côme V.Conraud L.Ibanescu M.Vittek
Talks about:rewrit (11) elan (9) strategi (8) termin (5) proof (5) rule (5) algorithm (4) program (4) complet (4) comput (4)
Person: Hélène Kirchner
DBLP: Kirchner:H=eacute=l=egrave=ne
Facilitated 4 volumes:
Ed
Ed
EdEdContributed to:
2015
2015
2014
201120062003200320032002200220001998
199820011998
1997199620021995
1994
19941992199119881988198719851984
19841983Wrote 34 papers:
- GaM-2015-ValletKPM #approach #modelling #network #social #visual notation
- A Visual Analytics Approach to Compare Propagation Models in Social Networks (JV, HK, BP, GM), pp. 65–79.
- RTA-2015-Kirchner #data analysis #graph
- Port Graphs, Rules and Strategies for Dynamic Data Analytics — Extended Abstract (HK), pp. 1–4.
- GRAPHITE-2014-FernandezKP #analysis #framework #graph grammar #interactive #modelling
- Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework (MF, HK, BP), pp. 15–29.
- LOPSTR-2011-FernandezKN #graph grammar
- A Strategy Language for Graph Rewriting (MF, HK, ON), pp. 173–188.
- PPDP-2006-GnaedigK #source code
- Computing constructor forms with non terminating rewrite programs (IG, HK), pp. 121–132.
- CADE-2003-DeplagneKKN #equation #induction #proving #theorem
- Proof Search and Proof Check for Equational and Inductive Theorems (ED, CK, HK, QHN), pp. 297–316.
- PPDP-2003-FissoreGK #rule-based #termination
- Simplification and termination of strategies in rule-based languages (OF, IG, HK), pp. 124–135.
- RTA-2003-BournezCCKI #approach #automation #generative #rule-based
- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms (OB, GMC, VC, HK, LI), pp. 30–45.
- PPDP-2002-FissoreGK #induction #proving #termination
- System Presentation — CARIBOO: An induction based proof tool for termination with strategies (OF, IG, HK), pp. 62–73.
- WRLA-2002-FissoreGK #termination
- Outermost ground termination (OF, IG, HK), pp. 188–207.
- WRLA-2000-KirchnerG #normalisation #proving #termination
- Termination and normalisation under strategy Proofs in ELAN (HK, IG), pp. 93–120.
- ALP-PLILP-1998-MoreauK #commutative #compilation #source code
- A Compiler for Rewrite Programs in Associative-Commutative Theories (PEM, HK), pp. 230–249.
- FLOPS-1998-BorovanskyKK #functional #semantics
- A Functional View of Rewriting and Strategies for a Semantics of ELAN (PB, CK, HK), pp. 143–166.
- FLOPS-J1-1998-BorovanskyKKR01 #functional #semantics
- Rewriting with Strategies in ELAN: A Functional Semantics (PB, CK, HK, CR), pp. 69–95.
- WRLA-1998-BorovanskyKKMR #overview
- An overview of ELAN (PB, CK, HK, PEM, CR), pp. 55–70.
- ASF+SDF-1997-BorovanskyK #partial evaluation
- Strategies of ELAN: meta-interpretation and partial evaluation (PB, HK), p. 2.
- ASF+SDF-1997-BorovanskyKK #logic #specification
- Rewriting as a unified specification tool for logic and control: the ELAN language (PB, CK, HK), p. 3.
- ASF+SDF-1997-MoreauK #commutative #compilation #normalisation
- Compilation techniques for associative-commutative normalisation (PEM, HK), p. 11.
- RWLW-1996-BorovanskyKK
- Controlling rewriting by rewriting (PB, CK, HK), pp. 169–189.
- RWLW-1996-BorovanskyKKMV #framework #logic #named
- ELAN: A logical framework based on computational systems (PB, CK, HK, PEM, MV), pp. 35–50.
- RWLW-1996-KirchnerM
- A reflective extension of ELAN (HK, PEM), pp. 149–168.
- WRLA-J-1996-BorovanskyKKM02 #logic #perspective
- ELAN from a rewriting logic point of view (PB, CK, HK, PEM), pp. 155–185.
- RTA-1995-KirchnerM #constraints #prototype #using
- Prototyping Completion with Constraints Using Computational Systems (HK, PEM), pp. 438–443.
- ICALP-1994-HintermeierKK #dynamic typing #equation #order
- Dynamically-Typed Computations for Order-Sorted Equational Presentations (CH, CK, HK), pp. 450–461.
- ICLP-1994-KirchnerR #algebra #constraints #theorem proving
- Constraint Solving by Narrowing in Combined Algebraic Domains (HK, CR), pp. 617–631.
- JICSLP-1992-KirchnerR #algebra #algorithm #constraints #finite #theorem proving #unification
- A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms (HK, CR), pp. 225–239.
- RTA-1991-Kirchner #proving #specification
- Proofs in Parameterized Specification (HK), pp. 174–187.
- ALP-1988-JouannaudKKM #named #programming
- OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization (JPJ, CK, HK, AM), pp. 41–52.
- ICALP-1988-KirchnerKM #semantics
- Operational Semantics of OBJ-3 (CK, HK, JM), pp. 287–301.
- RTA-1987-Kirchner #infinity #process #set
- Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.
- RTA-1985-RetyKKL #algorithm #logic programming #named #unification
- NARROWER: A New Algorithm for Unification and Its Application to Logic Programming (PR, CK, HK, PL), pp. 141–157.
- CADE-1984-Kirchner84a #algorithm #data type #induction
- A General Inductive Completion Algorithm and Application to Abstract Data Types (HK), pp. 282–302.
- POPL-1984-JouannaudK #equation #set
- Completion of a Set of Rules Modulo a Set of Equations (JPJ, HK), pp. 83–92.
- ICALP-1983-JouannaudKK #algorithm #equation #incremental #unification
- Incremental Construction of Unification Algorithms in Equational Theories (JPJ, CK, HK), pp. 361–373.