4835 search results - page 149 / 967 » Refactoring Functional Programs |
KR
2010
Springer
15 years 2 months ago
2010
Springer
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
TOOLS
1997
IEEE
15 years 2 months ago
1997
IEEE
Function Point Analysis measures user requested functionality independent of the technology used for implementation. Software applications are represented stract model that contai...
SAC
1996
ACM
15 years 2 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Students are often asked to submit electronic copies of their program code as part of assessment in computer science courses. To counter code plagiarism, educational institutions ...
SFP
2001
14 years 11 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...