122 search results - page 7 / 25 » Light types for polynomial time computation in lambda-calcul... |
PODS
2004
ACM
14 years 7 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
TAPSOFT
1991
Springer
13 years 11 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
ECOOP
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...