891 search results - page 122 / 179 » Full Abstraction for PCF |
KES
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Conventional tabletop systems have focused on communication with virtual data, using phicons or physical objects as handles. This approach is versatile, given the full us...
JOLLI
2006
13 years 7 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
ENTCS
2007
13 years 7 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
LISP
2006
13 years 7 months ago
2006
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
FUIN
2007
13 years 7 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...