Results

**1 - 6**of**6**### MSc in Logic

, 2011

"... Completing partial algebra models of term rewriting systems ..."

(Show Context)
by I Bethke, J W Klop, R

Venue: | in: Logic in Computer Science, IEEE Computer |

Sorted by:

Results **1 -
6** of
**6**

by
J. R. B. Cockett, Pieter J. W. Hofstra

"... ..."

(Show Context)
Citation Context

...xample of a PCA is Kleene’s model K1; its underlying set is N, and application is Kleene-application as defined in the previous section. Combinators k and s are found using the Parameter Theorem (see =-=[5]-=-) for a precise account). Of course, Comp(K1) is the classical recursion category (first example in the previous section). Oracles. One may generalize this example by considering computability relativ...

by
J. R. B. Cockett
, 2014

"... ..."

(Show Context)
Citation Context

...xample of a PCA is Kleene’s model K1; its underlying set is N, and application is Kleene-application as defined in the previous section. Combinators k and s are found using the Parameter Theorem (see =-=[5]-=-) for a precise account). Of course, comp(K1) is the classical recursion category (first example in the previous section). Oracles. One may generalize this example by considering computability relativ...

by
Gabriela Aslı, Rino Nesin
, 2011

"... Completing partial algebra models of term rewriting systems ..."

(Show Context)
Citation Context

... rewriting system and which satisfy a certain condition on head-normal forms can be completed. Our result generalizes a previous result by Inge Bethke, Jan Willem Klop and Roel de Vrijer presented in =-=[BKdV96]-=-. In the process, we will prove an abstract confluence theorem which is independent from our particular choice of term rewriting system and therefore can be taken separately. Our proof is preceded by ...

by
J. R. B. Cockett A, P. J. W. Hofstra B

"... ..."

(Show Context)
Citation Context

...xample of a PCA is Kleene’s model K1; its underlying set is N, and application is Kleene-application as defined in the previous section. Combinators k and s are found using the Parameter Theorem (see =-=[6]-=-) for a precise account). Of course, Comp(K1) is the classical recursion category (first example in the previous section). Oracles. One may generalize this example by considering computability relativ...

by
J. R. B. Cockett
, 2014

"... ..."

(Show Context)
Citation Context

...xample of a PCA is Kleene’s model K1; its underlying set is N, and application is Kleene-application as defined in the previous section. Combinators k and s are found using the Parameter Theorem (see =-=[5]-=-) for a precise account). Of course, comp(K1) is the classical recursion category (first example in the previous section). Oracles. One may generalize this example by considering computability relativ...

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University