A computer algebra user interface manifesto

Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result even by amateurs. This wizard integrates ideas including: * flexible subexpression selection; * complete control over the ordering of variables and commutative operands, with well-chosen defaults; * interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level; * quick applicability tests to reduce the listing of inapplicable transformations; * using an organizing principle to order the alternatives in a helpful manner; * labeling quickly-computed alternatives in dialog boxes with a preview of their results, * using ellipsis elisions if necessary or helpful; * allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives or to return quickly to branches already visited; * allowing the user to accumulate more than one of the alternative forms; * integrating direct manipulation into the wizard; and * supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.Comment: 38 pages, 12 figures, to be published in Communications in Computer Algebr

Web Services: A Process Algebra Approach

It is now well-admitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and verification of WSs using process algebras and their tools. We define a two-way mapping between abstract specifications written using these calculi and executable Web services written in BPEL4WS. Several choices are available: design and correct errors in BPEL4WS, using process algebra verification tools, or design and correct in process algebra and automatically obtaining the corresponding BPEL4WS code. The approaches can be combined. Process algebra are not useful only for temporal logic verification: we remark the use of simulation/bisimulation both for verification and for the hierarchical refinement design method. It is worth noting that our approach allows the use of any process algebra depending on the needs of the user at different levels (expressiveness, existence of reasoning tools, user expertise)

Procedural embodiment and magic in linear equations

How do students think about algebra? Here we consider a theoretical framework which builds from natural human functioning in terms of embodiment – perceiving the world, acting on it and reflecting on the effect of the actions – to shift to the use of symbolism to solve linear equations. In the main, the students involved in this study do not encapsulate algebraic expressions from process to object, they do not solve ‘evaluation equations’ such as by ‘undoing’ the operations on the left, they do not find such equations easier to solve than , and they do not use general principles of ‘do the same thing to both sides.’ Instead they build their own ways of working based on the embodied actions they perform on the symbols, mentally picking them up and moving them around, with the added ‘magic’ of rules such as ‘change sides, change signs.’ We consider the need for a theoretical framework that includes both embodiment and process-object encapsulation of symbolism and the need for communication of theoretical insights to address the practical problems of teachers and students