Vincent van Oostrom

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 9

Top Topics

Theorem Proving

Causal Interactions

Top Venues

ACM Trans. Comput. Log.

Arch. Formal Proofs

Publications

Samuel Frontull, Georg Moser, Vincent van Oostrom
α-Avoidance. FSCD (2023)
Vincent van Oostrom
On Causal Equivalence by Tracing in String Rewriting. CoRR (2023)
Vincent van Oostrom
Z; Syntax-Free Developments. FSCD (2021)
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
Confluence by Critical Pair Analysis Revisited. CADE (2019)
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
Confluence by Critical Pair Analysis Revisited (Extended Version). CoRR (2019)
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
Critical Peaks Redefined - $Φ\sqcup Ψ= \top$. CoRR (2017)
Julian Nagele, Vincent van Oostrom, Christian Sternagel
A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λβ-calculus in Nominal Isabelle. CoRR (2016)
Bertram Felgenhauer, Julian Nagele, Vincent van Oostrom, Christian Sternagel
The Z Property. Arch. Formal Proofs 2016 (2016)
Vincent van Oostrom, Yoshihito Toyama
Normalisation by Random Descent. FSCD (2016)
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16 (2) (2015)
Clemens Grabmayer, Vincent van Oostrom
Nested Term Graphs. TERMGRAPH (2014)
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. CoRR (2014)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. 10 (2) (2014)
Bertram Felgenhauer, Vincent van Oostrom
Proof Orders for Decreasing Diagrams. RTA (2013)
Vincent van Oostrom, Hans Zantema
Triangulation in Rewriting. RTA (2012)
Clemens Grabmayer, Joop Leo, Vincent van Oostrom, Albert Visser
On the Termination of Russell's Description Elimination Algorithm. Rev. Symb. Log. 4 (3) (2011)
Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom
On equal μ-terms. Theor. Comput. Sci. 412 (28) (2011)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA (2010)
Claus Appel, Vincent van Oostrom, Jakob Grue Simonsen
Higher-Order (Non-)Modularity . RTA (2010)
Vincent van Oostrom
Realising Optimal Sharing. RTA (2010)
Jean-Pierre Jouannaud, Vincent van Oostrom
Diagrammatic Confluence and Completion. ICALP (2) (2009)
Patrick Dehornoy, Vincent van Oostrom
Using groups for investigating rewrite systems. Math. Struct. Comput. Sci. 18 (6) (2008)
Vincent van Oostrom
Confluence by Decreasing Diagrams. RTA (2008)
Vincent van Oostrom
Modularity of Confluence. IJCAR (2008)
Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
Lambda calculus with patterns. Theor. Comput. Sci. 398 (1-3) (2008)
Vincent van Oostrom
Random Descent. RTA (2007)
Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
Reduction Strategies and Acyclicity. Rewriting, Computation and Proof (2007)
Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
Iterative Lexicographic Path Orders. Essays Dedicated to Joseph A. Goguen (2006)
Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom
Vicious Circles in Orthogonal Term Rewriting Systems. Electron. Notes Theor. Comput. Sci. 124 (2) (2005)
Bas Luttik, Vincent van Oostrom
Decomposition orders another generalisation of the fundamental theorem of arithmetic. Theor. Comput. Sci. 335 (2-3) (2005)
Vincent van Oostrom
Sub-Birkhoff. FLOPS (2004)
Dimitri Hendriks, Vincent van Oostrom
adbmal CADE (2003)
Vincent van Oostrom, Roel C. de Vrijer
Four equivalent equivalences of reductions. Electron. Notes Theor. Comput. Sci. 70 (6) (2002)
Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
Uniform Normalisation beyond Orthogonality. RTA (2001)
Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. Inf. Comput. 164 (1) (2001)
Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
A geometric proof of confluence by decreasing diagrams. J. Log. Comput. 10 (3) (2000)
Vincent van Oostrom
Normalisation in Weakly Orthogonal Rewriting. RTA (1999)
Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries
Meaningless Terms in Rewriting. J. Funct. Log. Program. 1999 (1) (1999)
Marc Bezem, Jan Willem Klop, Vincent van Oostrom
Diagram Techniques for Confluence. Inf. Comput. 141 (2) (1998)
Joost Engelfriet, Vincent van Oostrom
Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. 55 (3) (1997)
Vincent van Oostrom
Developing Developments. Theor. Comput. Sci. 175 (1) (1997)
Vincent van Oostrom
Finite Family Developments. RTA (1997)
Vincent van Oostrom
Higher-Order Families. RTA (1996)
Joost Engelfriet, Vincent van Oostrom
Regular Description of Context-Free Graph Languages. J. Comput. Syst. Sci. 53 (3) (1996)
Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries
Meaningless Terms in Rewriting. ALP (1996)
Zurab Khasidashvili, Vincent van Oostrom
Context-sensitive conditional expression reduction systems. Electron. Notes Theor. Comput. Sci. 2 (1995)
Vincent van Oostrom
Development Closed Critical Pairs. HOA (1995)
Vincent van Oostrom
Confluence by Decreasing Diagrams. Theor. Comput. Sci. 126 (2) (1994)
Vincent van Oostrom, Femke van Raamsdonk
Weak Orthogonality Implies Confluence: The Higher Order Case. LFCS (1994)
Vincent van Oostrom, Erik P. de Vink
Transition System Specifications in Stalk Formal with Bisimulation as a Congruence. STACS (1994)
Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121 (1&2) (1993)
Vincent van Oostrom, Femke van Raamsdonk
Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. HOA (1993)