Higher-Order Rewriting (1999)

Cached

Download Links

by Femke Van Raamsdonk
Venue:12th Int. Conf. on Rewriting Techniques and Applications, LNCS 2051
Citations:20 - 1 self

Documents Related by Co-Citation

44 The Higher-Order Recursive Path Ordering – J.-P. Jouannaud, A. Rubio - 1999
63 Higher-order rewrite systems and their confluence – Richard Mayr - 1998
944 Term Rewriting and All That – Franz Baader, Tobias Nipkow - 1998
9 Higher-Order Recursive Path Orderings à la carte – Jean-pierre Jouannaud, Albert Rubio
266 Orderings for term rewriting systems – N Dershowitz - 1982
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
249 Combinatory Reduction Systems – J W Klop - 1980
567 Term Rewriting Systems – J. W. Klop - 1992
9 Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development – François Leclerc - 1995
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
210 Termination of Term Rewriting Using Dependency Pairs – Thomas Arts, Jürgen Giesl - 2000
77 Confluence for Abstract and Higher-Order Rewriting – V van Oostrom - 1994
125 Higher-order critical pairs – T Nipkow - 1991
88 Conditional rewrite rules: Confluence and termination – J Bergstra, J Klop - 1986
10 Type Theory and the Integrated Logic of Programs – H Persson - 1999
8 Proving open properties by induction – J-C Raoult - 1988
65 Extracting constructive content from classical proofs – C R Murthy - 1990
5 Well-foundedness of the higher-order recursive path ordering in Coq – Adam Koprowski - 2004
14 Higher-Order Rewriting and Equational Reasoning – T Nipkow, C Prehofer - 1998