Specifying Imp(G) Using ASF+SDF: A Case Study
S. Vigna (University of Milan)
(Available as P9504-6.ps.gz)
Abstract
Imp(G) is a language based on distributive categories which allows to
define uniformly classes of computable function arising from a basic
set. The syntax of Imp(G) has been defined mathematically in terms of
abstract syntax, so that any implementation has to face with a number
of choices, ambiguities and polymorphisms of the categorical
notation. In this paper we summarize the goals attained using ASF+SDF
without resorting to hybrid functions. In particular, we describe how
type checking was implemented equationally using the backtracking
mechanism of list unification in order to obtain indifference to the
associativity isomorphisms.