Roel C. de Vrijer

Affiliations:
  • VU University Amsterdam, Netherlands


According to our database1, Roel C. de Vrijer authored at least 19 papers between 1975 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
Local Termination: theory and practice
Log. Methods Comput. Sci., 2010

2009
Local Termination.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008
Lambda calculus with patterns.
Theor. Comput. Sci., 2008

Proving Infinitary Normalization.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

Reduction Under Substitution.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2006
Iterative Lexicographic Path Orders.
Proceedings of the Algebra, Meaning, and Computation, 2006

2005
Infinitary Normalization.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two, 2005

2002
Four equivalent equivalences of reductions.
Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, 2002

2001
A Calculus of Lambda Calculus Contexts.
J. Autom. Reason., 2001

2000
A geometric proof of confluence by decreasing diagrams.
J. Log. Comput., 2000

Descendants and Origins in Term Rewriting.
Inf. Comput., 2000

1999
Extending partial combinatory algebras.
Math. Struct. Comput. Sci., 1999

1996
Completing Partial Combinatory Algebras With Unique Head-Normal Forms.
Proceedings of the Proceedings, 1996

1994
Modularity of Confluence: A Simplified Proof.
Inf. Process. Lett., 1994

1990
Extended Term Rewriting Systems.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

1989
Unique Normal Forms for Lambda Calculus with Surjective Pairing
Inf. Comput., February, 1989

Extending the Lambda Calculus with Surjective Pairing is Conservative
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1985
A Direct Proof of the Finite Developments Theorem.
J. Symb. Log., 1985

1975
Big trees in a lambda - calculus with lambda - expressions as types.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975


  Loading...