The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vincent van Oostrom: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries
    Meaningless Terms in Rewriting. [Citation Graph (0, 0)][DBLP]
    ALP, 1996, pp:254-268 [Conf]
  2. Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
    Iterative Lexicographic Path Orders. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:541-554 [Conf]
  3. Dimitri Hendriks, Vincent van Oostrom
    adbmal [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:136-150 [Conf]
  4. Vincent van Oostrom
    Sub-Birkhoff. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:180-195 [Conf]
  5. Vincent van Oostrom
    Development Closed Critical Pairs. [Citation Graph (0, 0)][DBLP]
    HOA, 1995, pp:185-200 [Conf]
  6. Vincent van Oostrom, Femke van Raamsdonk
    Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    HOA, 1993, pp:276-304 [Conf]
  7. Vincent van Oostrom, Femke van Raamsdonk
    Weak Orthogonality Implies Confluence: The Higher Order Case. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:379-392 [Conf]
  8. Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
    Uniform Normalisation beyond Orthogonality. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:122-136 [Conf]
  9. Vincent van Oostrom
    Higher-Order Families. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:392-407 [Conf]
  10. Vincent van Oostrom
    Finite Family Developments. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:308-322 [Conf]
  11. Vincent van Oostrom
    Normalisation in Weakly Orthogonal Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:60-74 [Conf]
  12. Vincent van Oostrom, Erik P. de Vink
    Transition System Specifications in Stalk Formal with Bisimulation as a Congruence. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:569-580 [Conf]
  13. Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom
    Vicious Circles in Orthogonal Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:2, pp:65-77 [Journal]
  14. Zurab Khasidashvili, Vincent van Oostrom
    Context-sensitive conditional expression reduction systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  15. Vincent van Oostrom, Roel C. de Vrijer
    Four equivalent equivalences of reductions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:6, pp:- [Journal]
  16. Marc Bezem, Jan Willem Klop, Vincent van Oostrom
    Diagram Techniques for Confluence. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:141, n:2, pp:172-204 [Journal]
  17. Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
    Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:164, n:1, pp:118-151 [Journal]
  18. Joost Engelfriet, Vincent van Oostrom
    Regular Description of Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:556-574 [Journal]
  19. Joost Engelfriet, Vincent van Oostrom
    Logical Description of Contex-Free Graph Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:3, pp:489-503 [Journal]
  20. Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries
    Meaningless Terms in Rewriting. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1999, v:1999, n:1, pp:- [Journal]
  21. Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
    A geometric proof of confluence by decreasing diagrams. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:3, pp:437-460 [Journal]
  22. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
    Combinatory Reduction Systems: Introduction and Survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:279-308 [Journal]
  23. Bas Luttik, Vincent van Oostrom
    Decomposition orders another generalisation of the fundamental theorem of arithmetic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:2-3, pp:147-186 [Journal]
  24. Vincent van Oostrom
    Confluence by Decreasing Diagrams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:126, n:2, pp:259-280 [Journal]
  25. Vincent van Oostrom
    Developing Developments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:1, pp:159-181 [Journal]
  26. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
    Reduction Strategies and Acyclicity. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:89-112 [Conf]
  27. Vincent van Oostrom
    Random Descent. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:314-328 [Conf]

  28. Modularity of Confluence. [Citation Graph (, )][DBLP]


  29. Diagrammatic Confluence and Completion. [Citation Graph (, )][DBLP]


  30. Confluence by Decreasing Diagrams. [Citation Graph (, )][DBLP]


  31. Higher-Order (Non-)Modularity . [Citation Graph (, )][DBLP]


  32. Realising Optimal Sharing. [Citation Graph (, )][DBLP]


  33. Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. [Citation Graph (, )][DBLP]


Search in 0.057secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002