Sciweavers

584 search results - page 96 / 117
» Logic Programs as term Rewriting Systems
Sort
View
POPL
2012
ACM
12 years 2 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
POPL
2006
ACM
14 years 7 months ago
Specifying C++ concepts
C++ templates are key to the design of current successful mainstream libraries and systems. They are the basis of programming techniques in diverse areas ranging from conventional...
Gabriel Dos Reis, Bjarne Stroustrup
PLDI
2006
ACM
14 years 21 days ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
CCS
2004
ACM
14 years 5 days ago
Authenticity by tagging and typing
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
PEPM
2007
ACM
14 years 26 days ago
Partial evaluation of Maple
Having been convinced of the potential benefits of partial evaluation, we wanted to conduct some experiments in our favourite Computer Algebra System, Maple. Maple is a large lan...
Jacques Carette, Michael Kucera