R.C. de Vrijer
VU University Amsterdam
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by R.C. de Vrijer.
Journal of Logic and Computation | 2000
Jan Willem Klop; V. van Oostrom; R.C. de Vrijer
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria in abstract rewriting, such as the strong confluence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of infinite reduction diagrams, arising from unsuccessful attempts to obtain a confluent diagram by tiling with elementary diagrams.
logic in computer science | 1996
Inge Bethke; Jan Willem Klop; R.C. de Vrijer
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
Term Rewriting Systems | 2003
Jan Willem Klop; R.C. de Vrijer; Terese
Term Rewriting Systems | 2003
Jan Willem Klop; R.C. de Vrijer; Terese
Term Rewriting Systems | 2003
Jan Willem Klop; R.C. de Vrijer; Terese
Logic group preprint series | 2002
V. van Oostrom; R.C. de Vrijer
Lecture Notes in Computer Science | 2009
Jörg Endrullis; Clemens Grabmayer; R.D.A. Hendriks; Jan Willem Klop; R.C. de Vrijer
Lecture Notes in Computer Science | 2005
Aart Middeldorp; V. van Oostrom; F. van Raamsdonk; R.C. de Vrijer
Term Rewriting Systems | 2003
V. van Oostrom; R.C. de Vrijer; Terese
Technical report ; CSI-R9921 | 1999
Inge Bethke; Jan Willem Klop; R.C. de Vrijer