Sciweavers

650 search results - page 17 / 130
» Logical Bisimulations and Functional Languages
Sort
View
CCS
2006
ACM
13 years 10 months ago
Secure information flow with random assignment and encryption
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...
Geoffrey Smith
NDJFL
1998
100views more  NDJFL 1998»
13 years 6 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
ESOP
2000
Springer
13 years 10 months ago
Sharing Continuations: Proofnets for Languages with Explicit Control
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
Julia L. Lawall, Harry G. Mairson
PPDP
2007
Springer
14 years 26 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
JANCL
2002
91views more  JANCL 2002»
13 years 6 months ago
A Modal Walk Through Space
We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-str...
Marco Aiello, Johan van Benthem