5090 search results - page 406 / 1018 » Constructing Strategies for Programming |
200
click to vote
CSFW
1997
IEEE
15 years 11 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
205
click to vote
HASKELL
2007
ACM
15 years 10 months ago
2007
ACM
This paper describes the design and construction of a Haskell source-level debugger built into the GHCi interactive environment. We have taken a pragmatic approach: the debugger i...
177
click to vote
APLAS
2001
ACM
15 years 10 months ago
2001
ACM
Exception analyses so far cannot provide information on the propagation of thrown exceptions, which is necessary to construct interprocedural control flow graph, visualize exceptio...
194
click to vote
CASES
2001
ACM
15 years 10 months ago
2001
ACM
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
169
click to vote
EUSFLAT
2001
15 years 8 months ago
2001
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...