Developing developments

Theoretical Computer Science

Volumn 175, Issue 1, 1997, Pages 159-181

  Van Oostrom, Vincent ^a,b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b Kashino Diverse Brain Research Laboratory of NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; SET THEORY; THEOREM PROVING;

LAMBDA CALCULUS; REWRITING SYSTEMS;

COMPUTATIONAL GRAMMARS;

EID: 0031096224     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00173-9     Document Type: Article

References (57)

1. S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, Vol. 2, Background: Computational Structures (Oxford Univ. Press, New York, 1992).
2. P. Aczel, A general Church-Rosser theorem. Tech. Report, University of Manchester, July 1978.
3. Y. Akama, On Mints' reduction for ccc-calculus, in: [8, pp. 1-12].
4. A. Asperti and C. Laneve, Interaction systems I: the theory of optimal reductions. Math. Struct. Comput. Sci. 4 (1994) 457-504.
5. A. Asperti and C. Laneve, Interaction systems II: the practice of optimal reductions. Theoret. Comput. Sci. 159 (1996) 191-244.
6. H.P. Barendregt, The Lambda Calculus, its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics Vol. 103 (Elsevier, Amsterdam, revised edition, 1984).
7. H.P. Barendregt, Lambda calculi with types, in: [1, pp. 117-310].
8. M. Bezem and J.F. Groote, ed., in: Proc. Internat. Conf. on Typed Lambda Calculi and Applications, TLCA'93, March 1993, Utrecht, Netherlands, Lecture Notes in Computer Science, Vol. 664 (Springer Berlin, 1993).
9. M. Bognar, A survey of abstract rewriting. Master's Thesis, Vrije Universiteit, Amsterdam, June 1995.
10. A. Church, A set of postulates for the foundation of logic Ann. Math. 33 (1932) 346-366; 34 (1933) 839-864.
11. A. Church, A set of postulates for the foundation of logic Ann. Math. 33 (1932) 346-366; 34 (1933) 839-864.
12. A. Church and J.B. Rosser, Some properties of conversion. Trans. Amer. Math. Soc. 39 (1936) 472-482.
13. D. Čubric, Embedding of a free cartesian closed category into the category of sets. On triples.math.mcgill.ca as pub/cubric/frccc.ps.gz, April 1993.
14. H.B. Curry, Grundlagen der kombinatorischen Logik. Teil I, II, Amer. J. Math. LII (1930) 509-536 and 789-834.
15. H.B. Curry and R. Feys, Combinatory Logic, Vol. I. Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 1958).
16. N. Dershowitz and J.-P. Jouannaud. Rewrite systems, in: J. van Leeuwen, ed., Handhook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (Elsevier, Amsterdam, 1990) 243-320.
17. R. Di Cosmo and D. Kesner, Combining first order algebraic rewriting systems, recursion and extensional lambda calculi, in: S. Abiteboul and E. Shamir, eds., Automata, Languages and Programming, Proc. 21st Internat. Coll. ICALP'94, Jerusalem, Israel, 11-14, July 1994, Lecture Notes in Computer Science, Vol. 820 (Springer, Berlin, 1994) 462-472.
18. R. Di Cosmo and D. Kesner, Simulating expansions without expansions, Math. Struct. Comput. Sci. 4 (1994) 1-48.
19. R. Di Cosmo and A. Piperno, Expanding extensional polymorphism, in: M. Dezani-Ciancaglini and G. Plotkin, eds., Proc. 2nd Internat. Conf. on Typed Lambda Calculi and Applications, TLCA'95, Edinburgh, UK, 10-12 April, 1995, Lecture Notes in Computer Science, Vol. 902 (Springer, Berlin, 1995) 139-153.
20. G. Dowek, J. Heering, K. Meinke and B. Möller, eds., Higher-Order Algebra, Logic, and Term Rewriting, Proc. 2nd Internat. Workshop, HOA'95, Paderborn, Germany, September 1995. Selected Papers, Lecture Notes in Computer Science, Vol. 1074 (Springer, Berlin, 1996).
21. A. Geser, Relative termination, Ph.D. Thesis, University of Passau, 1990. Reprint, Ulmer Informatik-Berichte Nr. 91-03, Universität Ulm.
22. J.-Y. Girard, Y. Lafont and P. Taylor. Proofs and Types, Cambridge Tracts in Theoretical Computer Science, Vol. 7 (Cambridge Univ. Press, Cambridge, 1989; Cambridge, 1990 reprinting).
23. G. Gonthier, J.-J. Lévy and P.-A. Melliès, An abstract standardisation theorem, in: Proc. 7th Ann. IEEE Symp. on Logic in Computer Science, Santa Cruz. CA, 22-25 June, 1992 (IEEE Computer Society Press, Los Alamitos, CA, 1992) 72-81.
24. B. Gramlich, Confluence without termination via parallel critical pairs, in: Proc. CAAP'96, 1996.
25. J.R. Hindley, The Church-Rosser property and a result in combinatory logic. Ph.D. Thesis, University of Newcastle upon Tyne, 1964.
26. R. Hindley, Reductions of residuals are finite, Trans. Amer. Math. Soc. 240 (1978) 345-361.
27. G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems J. Assoc. Comput. Machinery 27 (1980) 797-821.
28. G. Huet, Residual theory in λ-calculus: a formal development. J. Functional Programming 4 (1994) 371-394.
29. S. Kahrs, Context rewriting, in: M. Rusinowitch and J.L. Rémy, eds., Conditional Term Rewriting Systems, 3rd Internat. Workshop, CTKS-92, Pont-à-Mousson, France, 8-10 July 1992, Lecture Notes in Computer Science, Vol. 656 (Springer, Berlin, 1993) 21-35.
30. Z.O. Khasidashvili, Expression reduction systems, in: Proc. I. Vekua Institute of Applied Mathematics, Vol. 36, Tbilisi (1990) 200-220.
31. Z. Khasidashvili, The Church-Rosser theorem in orthogonal combinatory reduction systems, Rapports de Recherche 1825, INRIA-Rocquencourt, December 1992.
32. J.W. Klop, Term rewriting systems, in: [1, pp. 1-116].
33. J.W. Klop, Combinatory reduction systems. Ph.D. Thesis, Rijksuniversiteit Utrecht, June 1980; Mathematical Centre Tracts, Vol. 127.
34. J.W. Klop, Combinatory reduction systems. Ph.D. Thesis, Rijksuniversiteit Utrecht, June 1980; Mathematical Centre Tracts, Vol. 127.
35. J.W. Klop, V. van Oostrom and F. van Raamsdonk, Combinatory reduction systems, introduction and survey. Theoret. Comput. Sci. 121 (1993) 279-308.
36. P.-A. Melliès, Description Abstraite des Systèmes de Réécriture, Thèse de doctorat, Université Paris VII, 1996, to appear.
37. D. Miller, A logic programming language with lambda-abstraction, function variables, and simple unification, in: P. Schroeder-Heister, ed., Extensions of Logic Programming, Proc. Internat. Workshop, Tübingen, FRG, 8-10 December 1989, Lecture Notes in Artificial Intelligence, Vol. 475 (Springer, Berlin, 1991) 253-281.
38. G.E. Mints, Closed categories and the theory of proofs, J. Sov. Math. 15 (1981) 45-62. Translation into English of [38, pp. 83-114].
39. R. Mayr and T. Nipkow, Higher-order rewrite systems and their confluence. On ftp.informatik.tu-muenchen.de as local/lehrstuhl/nipkow/hrs.dvi.gz, November 1994, Theoret. Comput. Sci., to appear.
40. G.E. Mints and V.P. Orevkov, eds., Theoretical Applications of the Method of Mathematical Logic, Part II, Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova AN SSSR, Vol. 68, 1977.
41. T. Nipkow. Orthogonal higher-order rewrite systems are confluent, in: [8, pp. 306-317].
42. T. Nipkow, Higher-order critical pairs, in: Proc. 6th Ann. IEEE Svmp. on Logic in Computer Science, Amsterdam, Netherlands, 15-18 July, 1991 (IEEE Computer Society Press, Los Alamitos, CA, 1991) 342-349.
43. V. van Oostrom, Development closed critical pairs, in: [19, pp. 185-200].
44. V. van Oostrom, Confluence for abstract and higher-order rewriting, Ph.D. Thesis, Vrije Universiteit, Amsterdam, March 1994.
45. V. van Oostrom, Developing developments, Tech. Report ISRL-94-4, Information Science Research Laboratory, Basic Research Laboratories, Nippon Telegraph and Telephone Corporation, December 1994; extended abstract.
46. V. van Oostrom and F. van Raamsdonk, Comparing combinatory reduction systems and higher-order rewrite systems, in: J. Heering, K. Meinke, B. Möller and T. Nipkow, eds., Higher-Order Algebra, Logic, and Term Rewriting, Proc. 1st Internat. Workshop, HOA'93, Amsterdam, Netherlands, 23-24 September, 1993, Selected Papers, Lecture Notes in Computer Science, Vol. 816 (Springer, Berlin, 1994) 276-304.
47. V. van Oostrom and F. van Raamsdonk, Weak orthogonality implies confluence: the higher-order case, in: A. Nerode and Yu. V. Matiyasevich, eds., Logical Foundations of Computer Science, Proc. 3rd Internat. Symp., LFCS'94, St. Petersburg, Russia, July 1994, Lecture Notes in Computer Science, Vol. 813 (Springer, Berlin, 1994) 379-392.
48. C. Prehofer, Solving higher-order equations: from logic to programming, Ph.D. Thesis, Technische Universität München, February 1995; Report TUM-19508.
49. F. van Raamsdonk, Confluence and superdevelopments, in: C. Kirchner, ed., Rewriting Techniques and Applications. Proc. 5th Internat. Conf., RTA'93, Montreal, Canada, 16-18 June, 1993, Lecture Notes in Computer Science, Vol. 690 (Springer, Berlin 1993) 168-182.
50. F. van Raamsdonk, Confluence and normalisation for higher-order rewriting, Ph.D. Thesis, Vrije Universiteit, Amsterdam, May 1996.
51. B.K. Rosen, Tree-manipulating systems and Church-Rosser theorems, J. Assoc. Comput. Machinery 20 (1973) 160-187.
52. D.E. Schroer, The Church-Rosser theorem, Ph.D. Thesis, Cornell University, Ithaca, NY, 1965.
53. J.G. Stell, Modelling term rewriting systems by sesqui-categories. Tech. Report TR94-02, Keele University, June 1994.
54. M. Takahashi, λ-calculi with conditional rules, in: [8, pp. 406-417].
55. Y. Toyama, On the Church-Rosser property of term rewriting systems, Tech. Report 17672, NTT ECL, December 1981 (in Japanese).
56. Y. Toyama, Commutativity of term rewriting systems, in: F. Fuchi and L. Kott, eds., Programming of Future Generation Computer, Vol. II (North-Holland, Amsterdam, 1988) 393-407.
57. D.A. Wolfram, The Clausal Theory of Types, Cambridge Tracts in Theoretical Computer Science, Vol. 21 (Cambridge Univ. Press, Cambridge, 1993).