CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...