Sciweavers

1278 search results - page 212 / 256
» On the Semantics of Logic Program Composition
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
POPL
2010
ACM
16 years 3 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
FOAL
2007
ACM
15 years 10 months ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
ICFP
2005
ACM
16 years 6 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
HLPPP
1991
15 years 9 months ago
Reasoning About Synchronic Groups
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
Gruia-Catalin Roman, H. Conrad Cunningham