[AMS89] [Art96] [AZ94] [AZ95a] [AZ95b] [BD86] [Bel95] [BHK89] J. Avenhaus, K.E. Madlener, and J. Steinbach. COMTES { An experimental environment for t

Size: px

Start display at page:

Download "[AMS89] [Art96] [AZ94] [AZ95a] [AZ95b] [BD86] [Bel95] [BHK89] J. Avenhaus, K.E. Madlener, and J. Steinbach. COMTES { An experimental environment for t"

Chrystal Horn
6 years ago
Views:

1 [AG96a] [AG96b] [AG96c] [AG96d] [AG97a] [AG97b] T. Arts and J. Giesl. Termination of constructor systems. Technical Report UU-CS , Utrecht University, PO Box , 3508 TB Utrecht, February T. Arts and J. Giesl. Termination of constructor systems. In H. Ganzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, volume 1103 of Lecture Notes in Computer Science, pages 63{77, New Brunswick, NJ, USA, July Springer Verlag, Berlin. T. Arts and J. Giesl. Automatically proving termination where simplication orderings fail. Technical Report UU-CS , Utrecht University, October T. Arts and J. Giesl. Proving innermost normalisation automatically. Technical Report IBN 96/39, Technische Hochschule Darmstadt, Germany, October T. Arts and J. Giesl. Automatically proving termination where simplication orderings fail. In M. Dauchet, editor, Proceedings of the 22nd International Colloquium on Trees in Algebra and Programming, CAAP'97, Lecture Notes in Computer Science, Lille, France, April Springer Verlag, Berlin. T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings of the 8th International Conference on Rewriting Techniques and Applications, RTA-97, Lecture Notes in Computer Science, Sitges, Spain, June Springer Verlag, Berlin. [AM93] G. Aguzzi and U. Modigliani. Proving termination of logic programs by transforming them into equivalent term rewriting systems. In R.K. Shyamasundar, editor, Proceedings of FST&TCS 13, volume 761 of Lecture Notes in Computer Science, pages 114{124, Bombay, December Springer Verlag, Berlin. 157

2 [AMS89] [Art96] [AZ94] [AZ95a] [AZ95b] [BD86] [Bel95] [BHK89] J. Avenhaus, K.E. Madlener, and J. Steinbach. COMTES { An experimental environment for the completion of term rewriting systems. In N. Dershowitz, editor, Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, RTA-89, volume 355 of Lecture Notes in Computer Science, pages 542{546, Chapel Hill, NC, USA, April Springer Verlag, Berlin. T. Arts. Termination by absence of innite chains of dependency pairs. In H. Kirchner, editor, Proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP'96, volume 1059 of Lecture Notes in Computer Science, pages 196{210, Linkoping, Sweden, April Springer Verlag, Berlin. T. Arts and H. Zantema. Termination of logic programs via labelled term rewrite systems. Technical Report UU-CS , Utrecht University, PO Box , 3508 TB Utrecht, May T. Arts and H. Zantema. Termination of logic programs using semantic unication. In M. Proietti, editor, Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, volume 1048 of Lecture Notes in Computer Science, pages 219{233, Utrecht, September Springer Verlag, Berlin. T. Arts and H. Zantema. Termination of logic programs via labelled term rewrite systems. In J.C. van Vliet, editor, Proceedings of Computer Science in the Netherlands, pages 22{34, Utrecht, November SION, Stichting Mathematisch Centrum (CWI), Amsterdam. L. Bachmair and N. Dershowitz. Commutation, transformation and termination. In J.H. Siekmann, editor, Proceedings of the 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 5{20, Oxford, England, July Springer Verlag, Berlin. F. Bellegarde. ASTRE: Towards a fully automated program transformation system. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications, RTA-95, volume 914 of Lecture Notes in Computer Science, pages 401{407, Kaiserslautern, Germany, April Springer Verlag, Berlin. J.A. Bergstra, J. Heering, and P. Klint. Algebraic Specication. ACM Press Frontier Series. ACM Press in co-operation with Addison-Wesley, [BL87] A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137{159,

3 [BL88] F. Bellegarde and P. Lescanne. Termination proofs based on transformation techniques. Technical report, Centre de Recherche en Informatique de Nancy, Nancy (France), March [BL90] F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1:79{96, [BL93] E. Bevers and J. Lewi. Proving termination of (conditional) rewrite systems. Acta Informatica, 30:537{568, [Ble77] W. Bledsoe. Non-resolution theorem proving. Articial Intelligence, 9:1{ 35, [BM79] R.S. Boyer and J S. Moore. A Computational Logic. Academic Press, [Cou90] [CR93] [Der79] [Der81] [Der82] [Der87] [Der93] [DH95] B. Courcelle. Recursive applicative program schemes. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 459{492. North-Holland, M. Chtourou and M. Rusinowitch. Methode transformationnelle pour la preuve de terminaison des programmes logiques. Unpublished manuscript in French, N. Dershowitz. Orderings for term rewriting systems. In S.R. Kosaraju, editor, Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 123{131, N. Dershowitz. Termination of linear rewriting systems. In S. Even and O. Kariv, editors, Proceedings of the 8th International Colloquium on Automata, Languages and Programming (ALP), volume 115 of Lecture Notes in Computer Science, pages 448{458, Acre, Israel, July Springer Verlag, Berlin. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279{301, N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 and 2):69{116, N. Dershowitz. 33 examples of termination. In H. Comon and J.-P. Jouannaud, editors, Term Rewriting, Proceedings Spring School of Theoretical Computer Science, volume 909 of Lecture Notes in Computer Science, pages 16{27, Font Romeux, France, May Springer Verlag, Berlin. N. Dershowitz and C. Hoot. Natural termination. Theoretical Computer Science, 142(2):179{207,

4 [DJ90] N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 243{320. North-Holland, [DKM90] J. Dick, J. Kalmus, and U. Martin. Automating the Knuth Bendix ordering. Acta Informatica, 28:95{119, [DM85] [Dro89] [DW88] [Fer95] P. Dembinski and J. Ma luszynski. And-parallelism with intelligent backtracking for annotated logic programs. Proceedings of the International Symposium on Logic Programming, pages 29{38, K. Drosten. Termersetzungssysteme: Grundlagen der Prototyp-Generierung algebraischer Spezikationen. Springer, Berlin, In German. S.K. Debray and D.S. Warren. Automatic mode inference for logic programs. Journal of Logic Programming, 5:207{229, M. Ferreira. Termination of Term Rewriting,Well-foundedness, Totality and Transformations. PhD thesis, Utrecht University, PO Box , 3508 TB Utrecht, The Netherlands, [Fri85] L. Fribourg. Slog: A logic programming language interpreter based on clausal superposition and rewriting. In Proceedings IEEE International Symposium on Logic Programming, pages 172{184, Boston, [FZ93] M. Ferreira and H. Zantema. Total termination of term rewriting. In C. Kirchner, editor, Proceedings of the 5th Conference on Rewrite Techniques and Applications, RTA-93, volume 690 of Lecture Notes in Computer Science, pages 213{227, Montreal, Canada, June Springer Verlag, Berlin. [FZ94] [FZ95] W. Fokkink and H. Zantema. Basic process algebra with iteration: Completeness of its equational axioms. The Computer Journal, 37(4):259{267, M. Ferreira and H. Zantema. Dummy elimination: making termination easier. In H. Reichel, editor, Proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT'95, volume 965 of Lecture Notes in Computer Science, pages 243{252, Dresden, Germany, August Springer Verlag, Berlin. [Gee91] M. Geerling. Termination of term rewriting systems. Master's thesis, Utrecht University, PO Box , 3508 TB Utrecht, The Netherlands,

5 [Geu89] O. Geupel. Overlap closures and termination of term rewriting systems. Technical Report MIP , Universitat Passau, Passau, Germany, [Gie95a] J. Giesl. Automatisierung von Terminierungsbeweisen fur rekursiv denierte Algorithmen. PhD thesis, Technische Hochschule Darmstadt, Germany, January In German. [Gie95b] J. Giesl. Generating polynomial orderings for termination proofs. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications, RTA-95, volume 914 of Lecture Notes in Computer Science, pages 426{431, Kaiserslautern, Germany, April Springer Verlag, Berlin. [Gie95c] [Gie95d] [Gie96] J. Giesl. POLO { a system for termination proofs using polynomial orderings. Technical Report IBN95-24, Technische Hochschule Darmstadt, Alexanderstr. 10, Darmstadt, Germany, J. Giesl. Termination analysis for functional programs using term orderings. In Proceedings of the Second International Static Analysis Symposium, SAS'95, volume 983 of Lecture Notes in Computer Science, pages 154{171, Glasgow, UK, September Springer Verlag, Berlin. J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 1996.To appear. [Gra92] B. Gramlich. Generalized sucient conditions for modular termination of rewriting. In H. Kirchner and G. Levi, editors, Proceedings of the 3rd International Conference on Algebraic and Logic Programming, ALP'92, volume 632 of Lecture Notes in Computer Science, pages 53{86, Volterra, Italy, September Springer Verlag, Berlin. [Gra95] [Gra96a] B. Gramlich. Abstract relations between restricted termination and con- uence properties of rewrite systems. Fundamenta Informaticae, 24:3{23, B. Gramlich. Termination and Conuence Properties of Structured Rewrite Systems. PhD thesis, Universitat Kaiserslautern, Kaiserslautern, Germany, [Gra96b] B. Gramlich. On proving termination by innermost termination. In H. Ganzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, volume 1103 of Lecture Notes in Computer Science, pages 93{107, New Brunswick, NJ, USA, July Springer Verlag, Berlin. 161

6 [GW92] [HH82] [HL78] H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. In M. Rusinowitch and J.L. Remy, editors, Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, CTRS-92, volume 656 of Lecture Notes in Computer Science, pages 430{437, Pont-a-Mousson, France, July Springer Verlag, Berlin. G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences, 25:239{299, G. Huet and D. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Le Chesnay, France, [HO80] G. Huet and D.C. Oppen. Equations and rewrite rules: a survey. In R. Book, editor, Formal language theory, perspectives and open problems, pages 349{405. Academic Press, New York, [Hol89] S. Holldobler. Foundations of Equational Logic Programming, volume 353 of Lecture Notes in Articial Intelligence. Springer Verlag, Berlin, [HSF + 96] R.M. Hoek, A.B. Smit, H. Frings, J.M. Vink, M. de Jong-Brink, and W.P.M. Geraerts. A new Ig-superfamily member, molluscan defence molecule (MDM) from Lymnea stagnalis, is down-regulated during parasitosis. European Journal of Immunology, 26(4):939{944, [Hud89] [Hue80] [Jon93] [KB70] [KKS91] [KL80] P. Hudak. Conception, evolution, and application of functional programming languages. ACM Computing Surveys, 21(3):359{411, G. Huet. Conuent reductions: Abstract properties and applications to term rewriting systems. Journal of the Association for Computing Machinery, 27(4):797{821, M.P. Jones. Release notes for Gofer Included as part of the standard Gofer distribution, D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. Computational problems in abstract algebra, pages 263{297, M.R.K. Krishna Rao, D. Kapur, and R.K. Shyamasundar. A transformational methodology for proving termination of logic programs. In E. Boger et al., editor, Proceedings of the 5th Workshop on Computer Science Logic, CSL'91, volume 626 of Lecture Notes in Computer Science, pages 213{226, Berne, Switzerland, October Springer Verlag, Berlin. S. Kamin and J.-J. Levy. Two generalizations of the recursive path ordering. Department of Computer Science, University of Illinois, IL,

7 [Klo90] [Klo92] J.W. Klop. Term rewriting systems. Technical Report CS-R9073, Centre for Mathematics and Computer Science (CWI), PO Box 94079, 1090 GB Amsterdam, The Netherlands, December J.W. Klop. Term rewriting systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Background: computational structures, volume 2 of Handbook of Logic in Computer Science, pages 1{116. Oxford University Press, New York, [Knu86] D.E. Knuth. The Metafontbook. Computers and Typesetting. Addison Wesley, [Knu91] D.E. Knuth. Theory and practice. Theoretical Computer Science, 90(1):1{ 15, [KO90] [Kol96] [Kri95] [Kri96] [Lan79] [Les83] M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems. Journal of IPS Japan, 31(5):633{642, T. Kolbe. Challenge problems for automated termination proofs of term rewriting systems. Technical Report IBN96-42, Technische Hochschule Darmstadt, Alexanderstr. 10, Darmstadt, Germany, M.R.K. Krishna Rao. Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science, 151:487{512, M.R.K. Krishna Rao. Some characteristics of strong innermost normalization. In M. Wirsing and M. Nivat, editors, Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology, AMAST'96, volume 1101 of Lecture Notes in Computer Science, pages 406{420, Munich, Germany, July Springer Verlag, Berlin. D.S. Lankford. On proving term rewriting systems are Noetherian. Technical Report Memo MTP-3, Louisiana Technical University, Ruston, LA, P. Lescanne. Computer experiments with the REVE term rewriting system generator. In Proceedings Tenth ACM Symposium on Principles of Programming Languages, pages 99{108, Austin, Texas, [Les84] P. Lescanne. Uniform termination of term rewrite systems: Recursive decomposition ordering with status. In Proceedings of the 9th International Colloquium on Trees in Algebra and Programming, CAAP'84, pages 181{ 194, Cambridge, UK, Cambridge University Press. 163

8 [Les86] P. Lescanne. REVE a rewrite rule laboratory. In J.H. Siekmann, editor, Proceedings of the 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 5{20, Oxford, England, July Springer Verlag, Berlin. [Lin96] B. van Linder. Modal Logics for Rational Agents. PhD thesis, Utrecht University, POBox , 3508 TB Utrecht, The Netherlands, June [Llo87] J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second extended edition, [LM78] D.S. Lankford and D.R. Musser. A nite termination criterion, [MA96] [Mar94] [Mar95] [Mat93] [Mel81] [Mid89] 164 D. McAllester and K. Arkoudas. Walther recursion. In M.A. McRobbie and J.K. Slaney, editors, Proceedings of the 13th International Conference onautomated Deduction, CADE-13, volume 1104 of Lecture Notes in Computer Science, pages 643{657, New Brunswick, NJ, USA, July/August Springer Verlag, Berlin. M. Marchiori. Logic programs as term rewrite systems. In G. Levi and M. Rodrguez-Artalejo, editors, Proceedings of the 4th International Conference on Algebraic and Logic Programming, ALP'94, volume 850 of Lecture Notes in Computer Science, pages 223{241, Madrid, Spain, September Springer Verlag, Berlin. M. Marchiori. Modularity of completeness revisited. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications, RTA-95, volume 914 of Lecture Notes in Computer Science, pages 2{10, Kaiserslautern, Germany, April Springer Verlag, Berlin. B. Matthews. MERILL: An equational reasoning system in standard ML. In C. Kirchner, editor, Proceedings of the 5th Conference on Rewrite Techniques and Applications, RTA-93, volume 690 of Lecture Notes in Computer Science, pages 198{212, Montreal, Canada, June Springer Verlag, Berlin. C.S. Mellish. The automatic generation of mode declarations for prolog programs. Technical Report DAI Research Paper 163, Department of Articial Intelligence, University of Edinburgh, 5 Forrest Hill, Edinburgh, UK, A. Middeldorp. A sucient condition for the termination of the direct sum of term rewriting systems. In Proceedings Fourth Annual IEEE Symposium on Logic in Computer Science, LICS'89, pages 396{401, Pacic Grove, California, June IEEE Computer Society Press.

9 [Mid90] A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Free University, Amsterdam, The Netherlands, [MN70] Z. Manna and S. Ness. On the termination of Markov algorithms. In Proceedings of the Third Hawaii International Conference on System Science, pages 789{792, Honolulu, [MOZ96] A. Middeldorp, H. Ohsaki, and H. Zantema. Transforming termination by self-labelling. In M.A. McRobbie and J.K. Slaney, editors, Proceedings of the 13th International Conference on Automated Deduction, CADE-13, volume 1104 of Lecture Notes in Computer Science, pages 373{387, New Brunswick, NJ, USA, July/August Springer Verlag, Berlin. [MT91] [MT93] [MZ94] [NAS95] [New42] A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. In R.V. Book, editor, Proceedings of the 4th International Conference on Rewriting Techniques and Applications, RTA-91, volume 488 of Lecture Notes in Computer Science, pages 188{199, Como, Italy, April Springer Verlag, Berlin. A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. Journal of Symbolic Computation, 15:331{348, September A. Middeldorp and H. Zantema. Simple termination revisited. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, CADE-12, volume 814 of Lecture Notes in Computer Science, pages 451{465, Nancy, France, June/July Springer Verlag, Berlin. Formal Methods Team of NASA. Formal Methods Specication and Veri- cation Guidbook for Software and Computer Systems, volume I: Planning and Technology Insertion. National Aeronautics and Space Administration, Washington, July M.H.A. Newman. On theories with a combinatorial denition of equivalence. Annals of Mathematics, 43(2):223{243, [O'D77] M.J. O'Donnell. Computing in Systems Described by Equations, volume 58 of Lecture Notes in Computer Science. Springer Verlag, Berlin, [Ohl94] [Pla78a] E. Ohlebusch. On the modularity of termination of term rewriting systems. Theoretical Computer Science, 136:333{360, February D.A. Plaisted. well-founded orderings for proving termination of systems of rewrite rules. Technical Report R , Department of Computer Science, University of Illinois, Urbana-Champaign, IL,

10 [Pla78b] [Pla93] [Plu90] [Raa97] [Red84] [Rob65] [Rus87] [SD94] [Ste89] [Ste92] [Ste94a] [Ste94b] D.A. Plaisted. A recursively dened ordering for proving termination of term rewriting systems. Technical Report R , Department of Computer Science, University of Illinois, Urbana-Champaign, IL, D.A. Plaisted. Equational reasoning and term rewriting systems. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Logical Foundations, volume 1 of Handbook of Logic in Articial Intelligence and Logic Programming, pages 273{364. Oxford University Press, New York, L. Plumer. Termination Proofs for Logic Programs, volume 446 of Lecture Notes in Articial Intelligence. Springer Verlag, Berlin, Subseries of Lecture Notes in Computer Science. F. van Raamsdonk. Translating logic programs into conditional rewriting systems. In L. Naish, editor, Proceedings of the 14th International Conference on Logic Programming, ICLP'97, Leuven, Belgium, July MIT Press. U.S. Reddy. Transformation of logic programs into functional programs. In Proceedings of the International Symposium on Logic Programming, pages 187{196, Atlantic City, NJ, February IEEE Computer Society. J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12(1):23{41, M. Rusinowitch. On termination of the direct sum of term-rewriting systems. Information Processing Letters, 26:65{70, D. de Schreye and S. Decorte. Termination of logic programs: The neverending story. Journal of Logic Programming, 19,20:199{260, J. Steinbach. Extensions and comparison and of simplication orderings. In N. Dershowitz, editor, Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, RTA-89, volume 355 of Lecture Notes in Computer Science, pages 434{448, Chapel Hill, NC, USA, April Springer Verlag, Berlin. J. Steinbach. Notes on transformation orderings. Technical Report SR-92-23, Universitat Kaiserslautern, Kaiserslautern, Germany, J. Steinbach. Generating polynomial orderings. Information Processing Letters, 49:85{93, J. Steinbach. Termination of rewriting { extension, comparison and automatic generation of simplication orderings. PhD thesis, Universitat Kaiserslautern, Kaiserslautern, Germany,

11 [Ste95a] J. Steinbach. Automatic termination proofs with transformation orderings. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications, RTA-95, volume 914 of Lecture Notes in Computer Science, pages 11{25, Kaiserslautern, Germany, April Springer Verlag, Berlin. Long version also appeared as Technical Report SR-92-23, Universitat Kaiserslautern, Germany, [Ste95b] J. Steinbach. Simplication orderings: history of results. Fundamenta Informaticae, 24:47{87, [TKB89] [TKB95] [Toy87a] [Toy87b] [VTS95] [Wal91] [Wal94] [Wir90] [Zan94] Y. Toyama, J.W. Klop, and H.P. Barendregt. Termination for the direct sum of left-linear term rewriting systems. In N. Dershowitz, editor, Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, RTA-89, volume 355 of Lecture Notes in Computer Science, pages 477{492, Chapel Hill, NC, USA, April Springer Verlag, Berlin. Y. Toyama, J.W. Klop, and H.P. Barendregt. Termination for direct sums of left-linear term rewriting systems. Journal of the Association for Computing Machinery, 42(6):1275{1304, November Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141{143, Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the Association for Computing Machinery, 34:128{143, T. Vullinghs, D. Tuijnman, and W. Schulte. Lightweight GUIs for functional programming. In M. Hermenegildo and S.D. Swierstra, editors, Proceedings 7th International Symposium PLILP95, volume 982 of Lecture Notes in Computer Science, pages 341{356, Utrecht, The Netherlands, September Springer Verlag, Berlin. C. Walther. Automatisierung von Terminierungsbeweisen. Vieweg Verlag, Braunschweig, C. Walther. On proving the termination of algorithms by machine. Articial Intelligence, 71(1):101{157, M. Wirsing. Algebraic specication. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 677{788. North-Holland, H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23{50,

12 [Zan95] H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89{105,

Jean-Louis Lassez Page 1 of 10 CURRICULUM VITAE

Jean-Louis Lassez Page 1 of 10 CURRICULUM VITAE JEAN-LOUIS LASSEZ classez@gilanet.com ADDRESS: P.O. Box 407, Magdalena, New Mexico 87825-0407 PHONE: 505 854 2253 (home), 505 835 5396 (work) PERSONAL: Date