39 search results - page 6 / 8 » Using Modes to Ensure Subject Reduction for Typed Logic Prog... |
PLDI
2005
ACM
13 years 11 months ago
2005
ACM
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
CCS
2006
ACM
13 years 10 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
POPL
2012
ACM
12 years 1 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
PPDP
2004
Springer
13 years 11 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...