680 search results - page 20 / 136 » Types for the Ambient Calculus |
RTA
2004
Springer
14 years 1 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
APAL
2008
13 years 7 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
TCS
2010
13 years 2 months ago
2010
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
ZUM
2000
Springer
13 years 11 months ago
2000
Springer
We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to dene in Z much of its own schema cal...
CSFW
2006
IEEE
13 years 11 months ago
2006
IEEE
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...