2604 search results - page 220 / 521 » General constant expressions for system programming language... |
AOSD
2007
ACM
14 years 1 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
CCS
2011
ACM
12 years 9 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
ICFP
2007
ACM
14 years 9 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
Application security is typically coded in the application. In kernelSec, we are investigating mechanisms to implement application security in an operating system kernel. The mech...
CTCS
1997
Springer
14 years 1 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...