#### Filter Results:

- Full text PDF available (29)

#### Publication Year

1972

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
- Theor. Comput. Sci.
- 1997

- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
- Inf. Comput.
- 1995

We establish some fundamental facts for infinitary orthogonal term rewriting systems (OTRSs): for strongly convergent reductions we prove the Transfinite Parallel Moves Lemma and the Compressingâ€¦ (More)

- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
- ACM Trans. Program. Lang. Syst.
- 1994

Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise fromâ€¦ (More)

We present an axiomatic approach to the concept of meaninglessness in finite and transfinite term rewriting and lambda calculus. We justify our axioms in several ways. They can be intuitivelyâ€¦ (More)

Infinitely long rewrite sequences of possibly infinite terms are of interest for several reasons. Firstly, infinitary rewriting is a natural generalisation of finitary rewriting which extends it withâ€¦ (More)

- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
- J. Symb. Comput.
- 1996

Currying is a transformation of term rewrite systems which may contain symbols of arbitrary arity into systems which contain only nullary symbols, together with a single binary symbol calledâ€¦ (More)

- Jan van Eijck, Fer-Jan de Vries
- Journal of Logic, Language and Information
- 1992

In this paper we present a dynamic assignment language which extends the dynamic predicate logic of Groenendijk & Stokhof [1991: 39{100] with assignment and with generalized quanti ers. The use ofâ€¦ (More)

- Paula Severi, Fer-Jan de Vries
- ICFP
- 2012

In this paper, we use types for ensuring that programs involving streams are well-behaved. We extend pure type systems with a type constructor for <i>streams</i>, a modal operator <i>next</i> and aâ€¦ (More)

- Paula Severi, Fer-Jan de Vries
- RTA
- 2002

We show the existence of an infinitary confluent and normalising extension of the finite extensional lambda calculus with beta and eta. Besides infinite beta reductions also infinite eta reductionsâ€¦ (More)

- Paula Severi, Fer-Jan de Vries
- RTA
- 2011

In this paper we present a set of necessary and sufficient conditions on a set of lambda terms to serve as the set of meaningless terms in an infinitary bottom extension of lambda calculus. So farâ€¦ (More)