Sciweavers

365 search results - page 31 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
ICFP
2006
ACM
14 years 7 months ago
Recursive modules for programming
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
Keiko Nakata, Jacques Garrigue
ECOOP
2007
Springer
14 years 1 months ago
Morphing: Safely Shaping a Class in the Image of Others
We present MJ: a language for specifying general classes whose members are produced by iterating over members of other classes. We call this technique “class morphing” or just ...
Shan Shan Huang, David Zook, Yannis Smaragdakis
POPL
1990
ACM
13 years 11 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
CL
1999
Springer
13 years 7 months ago
Optimizing floating point operations in Scheme
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
W. F. Wong
POPL
1999
ACM
13 years 12 months ago
JFlow: Practical Mostly-Static Information Flow Control
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work...
Andrew C. Myers