Corrigendum to ''On functions preserving levels of approximation: a refined model construction for various lambda calculi'' [Theoret. Comput. Sci. 212 (1999) 261-303]

By Spreen D.  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 997-998

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

A model for problem representation at various generic levels to assist inventive design

By Dubois Sebastien   Lutz Philippe   Rousselot Francois   Vieux Gerard  

International Journal of Computer Applications in Technology, Vol. 30, Iss. 1-2, 2007-11 ,pp. : 105-112

Inderscience Publishers

Access to resources Recommend Favorite

Refined optimality conditions for differences of convex functions

By Valkonen Tuomo  

Journal of Global Optimization, Vol. 48, Iss. 2, 2010-10 ,pp. : 311-321

Springer Publishing Company

Access to resources Recommend Favorite

Approximation of boolean functions by combinatorial rectangles

By Sauerhoff M.  

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 45-78

Elsevier

Access to resources Recommend Favorite