87 search results - page 14 / 18 » Generic record combinators with static type checking |
AFP
2008
Springer
14 years 1 months ago
2008
Springer
Workflow systems are automated systems in which tasks are coordinated by assigning them to either humans or computers. Contemporary workflow systems are static and not very flex...
EUROSYS
2007
ACM
14 years 4 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
SAS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
OOPSLA
2005
Springer
14 years 29 days ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
FSEN
2007
Springer
14 years 1 months ago
2007
Springer
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...