277 search results - page 53 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
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...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
FBIT
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...