Confluency and strong normalizability of call-by-value -calculus

By Nakazawa K.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 429-463

Elsevier

Access to resources Recommend Favorite

An optimal data structure to handle dynamic environments in non-deterministic computations

By Pontelli E.   Ranjan D.   Dal Palu A.  

Computer Languages, Vol. 28, Iss. 2, 2002-12 ,pp. : 181-201

Elsevier

Access to resources Recommend Favorite

Two Rough Set-based Software Tools for Analyzing Non-Deterministic Data

By  

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 1, Iss. 1, 2014-01 ,pp. : 32-47

IGI Global_journal

Access to resources Recommend Favorite

Optimistic semaphores with non‐deterministic choice operation for heterogeneous manycore systems

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 14, 2015-09 ,pp. : 3676-3701

John Wiley & Sons Inc

Access to resources Recommend Favorite

Intuitionistic and classical natural deduction systems with the catch and the throw rules

By Sato M.  

Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. : 75-92

Elsevier

Access to resources Recommend Favorite