We provide a framework for registering automatic methods to derive class instances of datatypes, as it is possible using Haskell’s “deriving Ord, Show, . . . ” feature. We further implemented such automatic methods to derive (linear) orders or hash-functions which are required in the Isabelle Collection Framework [1] and the Container Framework [2]. Moreover, for the tactic of Huffman and Kraus...

We present a proof rule and an effective tactic for proving properties about HASKELL type classes by proving them for the available instance definitions. This is not straightforward, because instance definitions may depend on each other. The proof assistant ISABELLE handles this problem for single parameter type classes by structural induction on types. However, this does not suffice for an eff...

This paper presents an expert system for Paddy production management. This expert system gives advice to Paddy growers in Egypt to improve Paddy productivity. The system contains two main parts namely: strategic part and tactic part. The strategic part gives a strategic advice (i.e. list of agricultural operations) before cultivating Paddy crop. The strategic part contains four sub-systems name...

Finding reemployment after job loss is a complex and difficult task that requires extensive motivation and self-regulation. This study aimed to examine whether improving unemployed job seekers’ cognitive selfregulation can increase reemployment probabilities. Based on the goal orientation literature, we developed a learning-goal orientation (LGO) training, which focused on goal setting aimed at...

We present a proof rule and an effective tactic for proving properties about HASKELL type classes by proving them for the available instance definitions. This is not straightforward, because instance definitions may depend on each other. The proof assistant ISABELLE handles this problem for single parameter type classes by structural induction on types. However, this does not suffice for an eff...

This paper describes a type constructor for nonstandard extensions of arbitrary types, generalizing the previous formalization of nonstandard analysis in Isabelle by Fleuriot and Paulson [1]. In addition to numeric types, nonstandard extensions of function spaces and set types also prove useful—they provide an elegant way to define internal functions and internal sets. The paper also describes ...

Mechanical proof assistants have always had support for inductive proofs. Sometimes an alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation. However, SMT solvers do not natively support induction, so inductive proofs require some encoding into the SMT solver’s input. This paper shows a surprisingly simple tactic—a rewritin...