Sciweavers

1791 search results - page 29 / 359
» Two Types of Multiple-Conclusion Systems
Sort
View
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
14 years 1 days ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
CONCUR
2010
Springer
13 years 8 months ago
A Linear Account of Session Types in the Pi Calculus
Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...
Marco Giunti, Vasco T. Vasconcelos
ENTCS
2006
100views more  ENTCS 2006»
13 years 7 months ago
Typed Mobile Ambients in Maude
Maude has revealed itself as a powerful tool for implementing different kinds of semantics so that quick prototypes are available for trying examples and proving properties. In th...
Fernando Rosa Velardo, Clara Segura, Alberto Verde...
JIRS
2010
120views more  JIRS 2010»
13 years 6 months ago
Simple and Robust Attainment of Transparency Based on Two-Channel Control Architectures Using Time-Delay Control
Abstract This paper investigates simple and robust transparency-attainable control architectures for bilateral teleoperation. The strength of two-channel control architectures and ...
Jonghyun Kim, Hyung-Soon Park, Pyung Hun Chang
CSFW
1997
IEEE
13 years 11 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith