Learn More
Constructive logic can be used to consider program speciications as logical formulas. The advantage of this approach is to generate programs which are certiied with respect to some given speciications. The programs created in such a w ay are not ecient because they may c o n tain large parts with no computational meaning. The elimination of these parts is(More)
In this paper we extend, by allowing rank 2 intersection types, the type assignment system for the detection and elimination of dead code in typed functional programs presented by Coppo et al Giannini and the rst author in the Static Analysis Symposium '96. The main application of this method is the optimization of programs extracted from proofs in logical(More)
OBJECTIVE Although risk assessment for suicide has been extensively studied, it is still an inexact process. The current study determined how busy emergency clinicians actually assessed and documented suicide risk, while also examining the differences between psychiatric and emergency medicine opinions on the importance of various suicide predictors. (More)
We propose to adapt ML type inference algorithm to nd and erase dead-code in simply typed-terms. We prove the correctness of our optimization: the optimized program is observationally equivalent to the original one. This paper also sheds new lights on links between typing and static analyses, in the particular case of dead code analysis. Indeed, the same(More)
OBJECTIVE While psychoeducation has been shown to positively affect outcomes in psychiatric disorders, its utility has been little studied in developing countries. The current study sought to examine the role of psychoeducation at a general psychiatric outpatient clinic in Kampala, Uganda in improving clinic attendance, treatment adherence, and clinical(More)
  • 1