557 search results - page 50 / 112 » Calculi for Service-Oriented Computing |
GI
2009
Springer
14 years 1 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
FOSSACS
2005
Springer
14 years 2 months ago
2005
Springer
Language-based and process calculi-based information security are well developed fields of computer security. Although these fields have much in common, it is somewhat surprising...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distrib...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...