Sciweavers

458 search results - page 37 / 92
» Imperative Programming with Dependent Types
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 8 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
PLDI
2010
ACM
14 years 1 months ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...
GG
2008
Springer
13 years 9 months ago
High-Level Programs and Program Conditions
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...
Karl Azab, Annegret Habel
SAC
2009
ACM
14 years 3 months ago
Dynamic planning and weaving of dependability concerns for self-adaptive ubiquitous services
Ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding...
Romain Rouvoy, Frank Eliassen, Mikaël Beauvoi...
LISP
2002
81views more  LISP 2002»
13 years 8 months ago
Secure Information Flow via Linear Continuations
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
Steve Zdancewic, Andrew C. Myers