Vincent van Oostrom

56 papers A 4B 3Misc 2Journal 23Unranked 22

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