LEARNING ENVIRONMENTS IN THE CONTEXT OF A MASTER DEGREE IN ANIMATION AND ILLUSTRATION

This paper aims to describe the processes of teaching illustration and animation, together, in the context of a masters degree program. In Portugal, until very recently, illustration and animation higher education courses, were very scarce and only provided by a few private universities, which offered separated programs - either illustration or animation. The MA in Illustration and Animation (MIA) based in the Instituto Politécnico do Cávado e Ave in Portugal, dared to join these two creative areas in a common learning model and is already starting it’s third edition with encouraging results and will be supported by the first international conference on illustration and animation (CONFIA). This masters program integrates several approaches and techniques (in illustration and animation) and integrates and encourages creative writing and critique writing. This paper describes the iterative process of construction, and implementation of the program as well as the results obtained on the initial years of existence in terms of pedagogic and learning conclusions. In summary, we aim to compare pedagogic models of animation or illustration teaching in higher education opposed to a more contemporary and multidisciplinary model approach that integrates the two - on an earlier stage - and allows them to be developed separately – on the second part of the program. This is based on the differences and specificities of animation (from classic techniques to 3D) and illustration (drawing the illustration) and the intersection area of these two subjects within the program structure focused on the students learning and competencies acquired to use in professional or authorial projects.

Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs

Higher-order lazy functional slicing

Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, and corresponding tools, target either the imperative or the object oriented paradigms, where program slices are computed with respect to a variable or a program statement. Taking a complementary point of view, this paper focuses on the slicing of higher-order functional programs under a lazy evaluation strategy. A prototype of a Haskell slicer, built as proof-of-concept for these ideas, is also introduced