default search action
Vincent van Oostrom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c31]Samuel Frontull
, Georg Moser
α-Avoidance. FSCD 2023: 22:1-22:22 - 2022
- [c30]Vincent van Oostrom
On Causal Equivalence by Tracing in String Rewriting. TERMGRAPH@FSCD 2022: 27-43 - 2021
- [c29]Vincent van Oostrom
Z; Syntax-Free Developments. FSCD 2021: 24:1-24:22
2010 – 2019
- 2019
- [c28]Nao Hirokawa
Confluence by Critical Pair Analysis Revisited. CADE 2019: 319-336 - [i4]Nao Hirokawa, Julian Nagele, Vincent van Oostrom
Confluence by Critical Pair Analysis Revisited (Extended Version). CoRR abs/1905.11733 (2019) - 2017
- [i3]Nao Hirokawa, Julian Nagele
Critical Peaks Redefined - $Φ\sqcup Ψ= \top$. CoRR abs/1708.07877 (2017) - 2016
- [j17]Bertram Felgenhauer, Julian Nagele, Vincent van Oostrom, Christian Sternagel:
The Z Property. Arch. Formal Proofs 2016 (2016) - [c27]Vincent van Oostrom
Normalisation by Random Descent. FSCD 2016: 32:1-32:18 - [i2]Julian Nagele
A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λβ-calculus in Nominal Isabelle. CoRR abs/1609.03139 (2016) - 2015
- [j16]Bertram Felgenhauer, Aart Middeldorp
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16(2): 14:1-14:32 (2015) - 2014
- [j15]Jörg Endrullis
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. 10(2) (2014) - [c26]Clemens Grabmayer, Vincent van Oostrom
Nested Term Graphs. TERMGRAPH 2014: 48-65 - [i1]Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. CoRR abs/1404.1225 (2014) - 2013
- [c25]Bertram Felgenhauer, Vincent van Oostrom
Proof Orders for Decreasing Diagrams. RTA 2013: 174-189 - 2012
- [c24]Vincent van Oostrom
Triangulation in Rewriting. RTA 2012: 240-255 - 2011
- [j14]Clemens Grabmayer, Joop Leo, Vincent van Oostrom
On the Termination of Russell's Description Elimination Algorithm. Rev. Symb. Log. 4(3): 367-393 (2011) - [j13]Jörg Endrullis
On equal μ-terms. Theor. Comput. Sci. 412(28): 3175-3202 (2011) - 2010
- [c23]Vincent van Oostrom:
Realising Optimal Sharing. RTA 2010: 5-6 - [c22]Claus Appel, Vincent van Oostrom
Higher-Order (Non-)Modularity . RTA 2010: 17-32 - [c21]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA 2010: 85-102
2000 – 2009
- 2009
- [c20]Jean-Pierre Jouannaud, Vincent van Oostrom
Diagrammatic Confluence and Completion. ICALP (2) 2009: 212-222 - 2008
- [j12]Patrick Dehornoy, Vincent van Oostrom
Using groups for investigating rewrite systems. Math. Struct. Comput. Sci. 18(6): 1133-1167 (2008) - [j11]Jan Willem Klop, Vincent van Oostrom
Lambda calculus with patterns. Theor. Comput. Sci. 398(1-3): 16-31 (2008) - [c19]Vincent van Oostrom
Modularity of Confluence. IJCAR 2008: 348-363 - [c18]Vincent van Oostrom
Confluence by Decreasing Diagrams. RTA 2008: 306-320 - 2007
- [c17]Jan Willem Klop, Vincent van Oostrom
Reduction Strategies and Acyclicity. Rewriting, Computation and Proof 2007: 89-112 - [c16]Vincent van Oostrom
Random Descent. RTA 2007: 314-328 - 2006
- [c15]Jan Willem Klop, Vincent van Oostrom
Iterative Lexicographic Path Orders. Essays Dedicated to Joseph A. Goguen 2006: 541-554 - 2005
- [j10]Bas Luttik, Vincent van Oostrom
Decomposition orders another generalisation of the fundamental theorem of arithmetic. Theor. Comput. Sci. 335(2-3): 147-186 (2005) - [e2]Aart Middeldorp, Vincent van Oostrom
Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 3838, Springer 2005, ISBN 3-540-30911-X [contents] - 2004
- [c14]Vincent van Oostrom
Sub-Birkhoff. FLOPS 2004: 180-195 - [c13]Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom
Vicious Circles in Orthogonal Term Rewriting Systems. WRS 2004: 65-77 - [e1]Vincent van Oostrom
Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings. Lecture Notes in Computer Science 3091, Springer 2004, ISBN 3-540-22153-0 [contents] - 2003
- [c12]Dimitri Hendriks, Vincent van Oostrom
adbmal. CADE 2003: 136-150 - 2002
- [c11]Vincent van Oostrom
Four equivalent equivalences of reductions. WRS 2002: 21-61 - 2001
- [j9]Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. Inf. Comput. 164(1): 118-151 (2001) - [c10]Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
Uniform Normalisation beyond Orthogonality. RTA 2001: 122-136 - 2000
- [j8]Jan Willem Klop, Vincent van Oostrom
A geometric proof of confluence by decreasing diagrams. J. Log. Comput. 10(3): 437-460 (2000)
1990 – 1999
- 1999
- [j7]Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries:
Meaningless Terms in Rewriting. J. Funct. Log. Program. 1999(1) (1999) - [c9]Vincent van Oostrom
Normalisation in Weakly Orthogonal Rewriting. RTA 1999: 60-74 - 1998
- [j6]Marc Bezem, Jan Willem Klop, Vincent van Oostrom
Diagram Techniques for Confluence. Inf. Comput. 141(2): 172-204 (1998) - 1997
- [j5]Joost Engelfriet, Vincent van Oostrom
Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. 55(3): 489-503 (1997) - [j4]Vincent van Oostrom
Developing Developments. Theor. Comput. Sci. 175(1): 159-181 (1997) - [c8]Vincent van Oostrom
Finite Family Developments. RTA 1997: 308-322 - 1996
- [j3]Joost Engelfriet, Vincent van Oostrom
Regular Description of Context-Free Graph Languages. J. Comput. Syst. Sci. 53(3): 556-574 (1996) - [c7]Richard Kennaway, Vincent van Oostrom
Meaningless Terms in Rewriting. ALP 1996: 254-268 - [c6]Vincent van Oostrom
Higher-Order Families. RTA 1996: 392-407 - 1995
- [c5]Vincent van Oostrom
Development Closed Critical Pairs. HOA 1995: 185-200 - [c4]Zurab Khasidashvili, Vincent van Oostrom
Context-sensitive conditional expression reduction systems. SEGRAGRA 1995: 167-176 - 1994
- [j2]Vincent van Oostrom
Confluence by Decreasing Diagrams. Theor. Comput. Sci. 126(2): 259-280 (1994) - [c3]Vincent van Oostrom
Weak Orthogonality Implies Confluence: The Higher Order Case. LFCS 1994: 379-392 - [c2]Vincent van Oostrom
Transition System Specifications in Stalk Formal with Bisimulation as a Congruence. STACS 1994: 569-580 - 1993
- [j1]Jan Willem Klop, Vincent van Oostrom
Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121(1&2): 279-308 (1993) - [c1]Vincent van Oostrom
Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. HOA 1993: 276-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: