Vincent van Oostrom

According to our database, Vincent van Oostrom authored at least 49 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

α-Avoidance.

Samuel Frontull, Georg Moser, Vincent van Oostrom

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

On Causal Equivalence by Tracing in String Rewriting.

Vincent van Oostrom

Proceedings of the Proceedings Twelfth International Workshop on Computing with Terms and Graphs, 2022

2021

Z; Syntax-Free Developments.

Vincent van Oostrom

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2019

Confluence by Critical Pair Analysis Revisited (Extended Version).

Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi

CoRR, 2019

Confluence by Critical Pair Analysis Revisited.

Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi

Proceedings of the Automated Deduction - CADE 27, 2019

2017

Critical Peaks Redefined - $Φ\sqcup Ψ= \top$.

Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi

CoRR, 2017

2016

A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λβ-calculus in Nominal Isabelle.

Julian Nagele, Vincent van Oostrom, Christian Sternagel

CoRR, 2016

The Z Property.

Bertram Felgenhauer, Julian Nagele, Vincent van Oostrom, Christian Sternagel

Arch. Formal Proofs, 2016

Normalisation by Random Descent.

Vincent van Oostrom, Yoshihito Toyama

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

Layer Systems for Proving Confluence.

Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom

ACM Trans. Comput. Log., 2015

2014

Nested Term Graphs.

Clemens Grabmayer, Vincent van Oostrom

Proceedings of the Proceedings 8th International Workshop on Computing with Terms and Graphs, 2014

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples.

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom

Log. Methods Comput. Sci., 2014

2013

Proof Orders for Decreasing Diagrams.

Bertram Felgenhauer, Vincent van Oostrom

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012

Triangulation in Rewriting.

Vincent van Oostrom, Hans Zantema

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011

On equal μ-terms.

Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom

Theor. Comput. Sci., 2011

On the Termination of Russell's Description Elimination Algorithm.

Clemens Grabmayer, Joop Leo, Vincent van Oostrom, Albert Visser

Rev. Symb. Log., 2011

2010

Realising Optimal Sharing.

Vincent van Oostrom

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Higher-Order (Non-)Modularity .

Claus Appel, Vincent van Oostrom, Jakob Grue Simonsen

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Diagrammatic Confluence and Completion.

Jean-Pierre Jouannaud, Vincent van Oostrom

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Lambda calculus with patterns.

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer

Theor. Comput. Sci., 2008

Using groups for investigating rewrite systems.

Patrick Dehornoy, Vincent van Oostrom

Math. Struct. Comput. Sci., 2008

Modularity of Confluence.

Vincent van Oostrom

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

Random Descent.

Vincent van Oostrom

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Reduction Strategies and Acyclicity.

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Rewriting, 2007

2006

Iterative Lexicographic Path Orders.

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer

Proceedings of the Algebra, Meaning, and Computation, 2006

2005

Decomposition orders another generalisation of the fundamental theorem of arithmetic.

Bas Luttik, Vincent van Oostrom

Theor. Comput. Sci., 2005

2004

Vicious Circles in Orthogonal Term Rewriting Systems.

Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom

Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

Sub-Birkhoff.

Vincent van Oostrom

Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

2003

adbmal

Dimitri Hendriks, Vincent van Oostrom

Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002

Four equivalent equivalences of reductions.

Vincent van Oostrom, Roel C. de Vrijer

Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, 2002

2001

Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems.

Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom

Inf. Comput., 2001

Uniform Normalisation beyond Orthogonality.

Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000

A geometric proof of confluence by decreasing diagrams.

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer

J. Log. Comput., 2000

1999

Meaningless Terms in Rewriting.

Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries

J. Funct. Log. Program., 1999

Normalisation in Weakly Orthogonal Rewriting.

Vincent van Oostrom

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1998

Diagram Techniques for Confluence.

Marc Bezem, Jan Willem Klop, Vincent van Oostrom

Inf. Comput., 1998

1997

Developing Developments.

Vincent van Oostrom

Theor. Comput. Sci., 1997

Logical Description of Contex-Free Graph Languages.

Joost Engelfriet, Vincent van Oostrom

J. Comput. Syst. Sci., 1997

Finite Family Developments.

Vincent van Oostrom

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996

Regular Description of Context-Free Graph Languages.

Joost Engelfriet, Vincent van Oostrom

J. Comput. Syst. Sci., 1996

Higher-Order Families.

Vincent van Oostrom

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1995

Context-sensitive conditional expression reduction systems.

Zurab Khasidashvili, Vincent van Oostrom

Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

Development Closed Critical Pairs.

Vincent van Oostrom

Proceedings of the Higher-Order Algebra, 1995

1994

Confluence by Decreasing Diagrams.

Vincent van Oostrom

Theor. Comput. Sci., 1994

Transition System Specifications in Stalk Formal with Bisimulation as a Congruence.

Vincent van Oostrom, Erik P. de Vink

Proceedings of the STACS 94, 1994

Weak Orthogonality Implies Confluence: The Higher Order Case.

Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Combinatory Reduction Systems: Introduction and Survey.

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk

Theor. Comput. Sci., 1993

Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems.

Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Higher-Order Algebra, 1993