Sciweavers

11862 search results - page 31 / 2373
» Relative information completeness
Sort
View
APAL
2007
79views more  APAL 2007»
13 years 7 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
IGPL
2011
13 years 2 months ago
Completion and amalgamation of bounded distributive quasi lattices
In this note we present a completion for the variety of bounded distributive quasi lattices, and, inspired by a well-known idea of L.L. Maksimova [14], we apply this result in prov...
Majid Alizadeh, Antonio Ledda, Hector Freytes
DEXA
2006
Springer
95views Database» more  DEXA 2006»
13 years 11 months ago
On the Completion of Workflows
Abstract. Workflow Management Systems (WFMS) coordinate execution of logically related multiple tasks in an organization. A workflow schema is defined using a set of tasks that are...
Tai Xin, Indrakshi Ray, Parvathi Chundi, Sopak Cha...
RTA
1997
Springer
13 years 11 months ago
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
Denis Béchet, Philippe de Groote, Christian...
CONCUR
1993
Springer
13 years 11 months ago
Modular Completeness for Communication Closed Layers
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
Maarten M. Fokkinga, Mannes Poel, Job Zwiers