Modelling Conditional Rewriting Logic in Structured Categories

By Miyoshi H.  

Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. : 1-15

Elsevier

Access to resources Recommend Favorite

Combining algebraic rewriting, extensional lambda calculi, and fixpoints

By Di Cosmo R.   Kesner D.  

Theoretical Computer Science, Vol. 169, Iss. 2, 1996-12 ,pp. : 201-220

Elsevier

Access to resources Recommend Favorite

Using Rewriting Systems to Compute Left Kan Extensions and Induced Actions of Categories

By Brown R.   Heyworth A.  

Journal of Symbolic Computation, Vol. 29, Iss. 1, 2000-01 ,pp. : 5-31

Academic Press

Access to resources Recommend Favorite

Reductions and functors from problems to word problems

By Birget J.-C.  

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 81-104

Elsevier

Access to resources Recommend Favorite

An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems

By Kubica Bartłomiej   Malinowski Krzysztof  

Reliable Computing, Vol. 11, Iss. 5, 2005-10 ,pp. : 393-411

Springer Publishing Company

Access to resources Recommend Favorite