2236 search results - page 313 / 448 » Language Independence and Language Tolerance in Logic Progra... |
117
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
131
click to vote
ML
2006
ACM
15 years 4 months ago
2006
ACM
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
156
click to vote
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
159
click to vote
JACM
2010
15 years 2 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
135
click to vote
FPCA
1989
15 years 8 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...