Sciweavers

128 search results - page 2 / 26
» Ensuring Termination by Typability
Sort
View
IPL
2007
78views more  IPL 2007»
13 years 7 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
WWW
2005
ACM
14 years 8 months ago
Ensuring required failure atomicity of composite Web services
The recent evolution of Internet, driven by the Web services technology, is extending the role of the Web from a support of information interaction to a middleware for B2B interac...
Sami Bhiri, Olivier Perrin, Claude Godart
ESOP
2009
Springer
14 years 2 months ago
Global Principal Typing in Partially Commutative Asynchronous Sessions
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
Dimitris Mostrous, Nobuko Yoshida, Kohei Honda
ESOP
1994
Springer
13 years 11 months ago
Dimension Types
Scientists and engineers must ensure that physical equations are dimensionally consistent, but existing programming languages treat all numeric values as dimensionless. This paper ...
Andrew Kennedy
BIRTHDAY
2009
Springer
14 years 2 months ago
Mobile Processes and Termination
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...