122 search results - page 2 / 25 » Light types for polynomial time computation in lambda-calcul... |
ACL
2003
13 years 6 months ago
2003
In this paper, we elucidate how Korean temporal markers, OE and DONGAN contribute to specifying the event time and formalize it in terms of typed lambda calculus. We also present ...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
TCS
2008
13 years 5 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
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 ...