Sciweavers

397 search results - page 28 / 80
» The Kell Calculus: Operational Semantics and Type System
Sort
View
CSL
2007
Springer
14 years 1 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
ICFP
2004
ACM
14 years 7 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
IWFM
2003
123views Formal Methods» more  IWFM 2003»
13 years 9 months ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power
LICS
2000
IEEE
13 years 12 months ago
Models for Name-Passing Processes: Interleaving and Causal
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
Gian Luca Cattani, Peter Sewell
CSFW
1997
IEEE
13 years 11 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith