Régis Curien, Zhenyu Qian, Hui Shi  Home/Search
Context Related
| unibremen.de/pub/UniBre...rta96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unibreme...shi_papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and... (Update)
Context of citations to this paper: More
...layer on the rigid side and every argument of the heading free variable with every subterm covered by the top layer . Curien, Qian and Shi [250] propose a new second order matching algorithm, which introduces no fresh free variables and just considers some selected top layers...
...of calculation strategies as shown in Section 4. There are a lot of work on developing fast implementation of matching algorithm [CPT92, CQS96, dMS99]. Particularly the Oxford Programming Tools Group (http: www.comlab.ox.ac.uk oucl groups progtools ) are now actively...
Cited by: More
Calculation Carrying Programs - Hu, Takeichi (1999) (Correct)
Calculation Carrying Programs - How to Code Program.. - Takeichi, Hu (2000) (Correct)
Higher-order Matching for Program Transformation - de Moor, Sittampalam (1999) (Correct)
Active bibliography (related documents): More All
0.6: Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997) (Correct)
0.4: Theory and Practice of Minimal Modular Higher-Order E-Unification - Müller, Weber (1994) (Correct)
0.4: Higher-Order Narrowing - Prehofer (1994) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: [31] Hongxing Zhou, Zhenyu Yang and Haitao Li, \A Note.. - Proc Chinese Distributed (Correct)
0.2: Structural Decidable Extensions of Bounded Quantification - Vorobyov (1994) (Correct)
0.1: Towards a Theory of Parallel Algorithms on Concrete Data.. - Stephen Brookes Shai (1992) (Correct)
Related documents from co-citation: More All
6: Proving and applying program transformations expressed with second order pattern.. (context) - Huet, Lang - 1978
5: Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
5: A language for examining abstract syntax trees (context) - Crew - 1997
BibTeX entry: (Update)
R. Curien, Z. Qian, and H. Shi. Efficient Second-Order Matching. In Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA-96), pages 317 -- 331, New Brunswick, NJ, USA, 1996. Springer LNCS 1103. http://citeseer.ist.psu.edu/curien96efficient.html More
@inproceedings{ curien96efficient,
author = "R{\'e}gis Curien and Zhenyu Qian and Hui Shi",
title = "Efficient Second-Order Matching",
booktitle = "Proceedings of the 7th International Conference on Rewriting Techniques and Applications",
publisher = "Springer-Verlag LNCS 1103",
address = "New Brunswick, New Jersey",
editor = "Harald Ganzinger",
pages = "317--331",
year = "1996",
url = "citeseer.ist.psu.edu/curien96efficient.html" }
Citations (may not include all citations):294 Isabelle - A Generic Theorem prover (context) - Paulson - 1994
174 A unification algorithm for typed -calculus (context) - Huet - 1975
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
56 Higher-order unification revisited: Complete sets of transfo.. (context) - Snyder, Gallier - 1989
42 Reusing proofs - Kolbe, Walther - 1994
23 ese de Doctorat d (context) - Huet, dans et al. - 1976
23 A Theorem Prover for a Computational Logic - Boyer, Moore - 1990
13 A Second-order Pattern Matching Algorithm in the Cube of Typ.. (context) - Dowek - 1991
11 Higher-order E-unification (context) - Snyder - 1990
10 Modular higher-order E-unification (context) - Nipkow, Qian - 1991
10 Outils pour la preuve par analogie (context) - Curien - 1995
9 Proof analogy in interactive theorem proving: A method to ex.. (context) - de la, Caferra - 1987
4 Extended Matching with Applications to Program Transformatio.. (context) - Shi - 1994
3 matching as a Tool for Automated Theorem Proving (context) - Curien, E-
3 unification for arbitrary theories (context) - Qian, Wang - 1992
1 A formale approach to some usually informal techniques used .. (context) - de la, Caferra - 1988
1 Efficiency for second-order matching: the syntactic and ACca.. (context) - Curien, Qian - 1995
1 effficient and reusable transformational developments (context) - Krieg-Bruchner, Liu et al. - 1995
1 University of Edinburg (context) - Harper, MacQueen et al. - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-bremen.de/~shi/papers/shi_papers.html): More
Combining Methods for the Livelock Analysis of a.. - Bettina Buth (1999) (Correct)
Deadlock Analysis for a Fault-Tolerant System - Buth, Kouvaras, Peleska, Shi (1997) (Correct)
Combining Methods for the Analysis of a Fault-Tolerant System - Shi, Peleska, Kouvaras (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC