Joint papers with Maribel Fernández (in chronological order).
- S. van Bakel and M. Fernández.
Strong Normalization of Typeable Rewrite Systems. In Jan Heering, Karl
Meinke, Bernhard Möller, and Tobias Nipkow, editors, Proceedings of
HOA '93. First International Workshop on Higher Order Algebra, Logic and
Term Rewriting, Amsterdam, the Netherlands. Selected Papers.
Volume 816 of Lecture Notes in Computer Science, pages 20-39.
Springer-Verlag, 1994.
[Abstract in plain text and
paper in gzip-ed postscript format.]
- S. van Bakel and M. Fernández.
(Head-)Normalization of Typeable Rewrite Systems.
In Jieh Hsiang, editor, Proceedings of RTA '95. 6th International
Conference on Rewriting Techniques and Applications, Kaiserslautern,
Germany.
Volume 914 of Lecture Notes in Computer Science, pages 279-293.
Springer-Verlag, 1995.
[Abstract in plain text and
paper in gzip-ed postscript format.]
- S. van Bakel and M. Fernández.
Approximation and Normalization Results for Typeable Term Rewriting Systems.
In Gilles Dowek, Jan Heering, Karl Meinke, and Bernhard Möller, editors,
Proceedings of HOA '95. Second International Workshop on
Higher Order Algebra, Logic and Term Rewriting, Paderborn, Germany.
Selected Papers.
Volume 1074 of Lecture Notes in Computer Science, pages 17-36.
Springer-Verlag, 1996.
[Abstract in plain text and
paper in gzip-ed postscript format.]
- S. van Bakel, F. Barbanera, and M. Fernández.
Rewrite Systems with Abstraction and beta-rule: Types, Approximants and
Normalization.
In Hanne Riis Nielson, editor, Programming Languages and Systems - ESOP'96.
Proceedings of 6th European Symposium on Programming, Linkoping, Sweden.
Volume 1058 of Lecture Notes in Computer Science, pages 387-403.
Springer-Verlag, 1996.
[Abstract in plain text and
paper in gzip-ed postscript format.]
- S. van Bakel and M. Fernández.
Normalization Results for Typeable Rewrite Systems.
Information and Computation, 133(2):73-116, 1997.
[Abstract in plain text and
paper in gzip-ed postscript format.]
- S. van Bakel and M. Fernández.
Approximation and Normalization Results for Typeable Combinator Systems.
[Abstract in plain text and
paper in gzip-ed postscript format.]
- S. van Bakel, F. Barbanera, and M. Fernández.
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and beta-rule. (Extended Abstract). In Thierry Coquand, Peter Dybjer, Bengt Nordstrom, Jan Smith, editors, Types for Proofs and Programs. International Workshop, TYPES'99. Lokeberg, Sweden, Sected Papers. Volume 1956 of Lecture Notes in Computer Science, pages 41-60, Springer-Verlag, 2000.
[Abstract in plain text and
paper in gzip-ed postscript format.]
-
S. van Bakel and M. Fernández. Approximation and Filter Semantics for Combinator Systems (Extended Abstract).
[Abstract in plain text and
paper in gzip-ed postscript format.]
-
S. van Bakel and M. Fernández. Normalization, Approximation and Semantics for Typeable Combinator Systems. Technical Report 2000/10, Department of Computer Science, Imperial College. Submitted