Skip to main content
Abstract. STG (Shared Term Graph) is a very simple higher order non-strict pure functional language, primarily designed to be the “abstract machine code” of STG-machine (Spineless Tagless G-Machine), an abstract machine designed to... more
Abstract. STG (Shared Term Graph) is a very simple higher order non-strict pure functional language, primarily designed to be the “abstract machine code” of STG-machine (Spineless Tagless G-Machine), an abstract machine designed to support implementation of lazy functional languages, like Haskell, on stock hardware [13]. GHC [14] and Haskell/µΓCMC [11] are compilers for Haskell that use STG as intermediate code. This paper gives an action semantics for STG, trying to capture its essential characteristics, like lazy evaluation, ...
Research Interests:
Agent-oriented programming is a programming model proposed to design complex programs. To simplify the implementation of agent systems, several new agent-oriented programming languages (AOPL) have been proposed. Usually, these languages... more
Agent-oriented programming is a programming model proposed to design complex programs. To simplify the implementation of agent systems, several new agent-oriented programming languages (AOPL) have been proposed. Usually, these languages are developed using informal techniques and implemented in an "ad hoc" manner. The lack of formal methods and adequate analysis tools makes the design of these languages a hard and
We show the main features of the Abaco system, a semantic directed compiler generator, that produces object-oriented compilers from action semantics descriptions of programming languages.
Given the action-semantic description of a source language, Actress generates a compiler. The generated compiler translates its source program first to an action, and then to object code. Transformations of the intermediate action greatly... more
Given the action-semantic description of a source language, Actress generates a compiler. The generated compiler translates its source program first to an action, and then to object code. Transformations of the intermediate action greatly improve the efficiency of the object code. This paper studies these transformations.
We report progress on the development of Actress, a compiler generator based on action semantics. It consists of a number of modules, written in SML, that can be composed to construct either an action notation compiler or a simple... more
We report progress on the development of Actress, a compiler generator based on action semantics. It consists of a number of modules, written in SML, that can be composed to construct either an action notation compiler or a simple compiler generator. We also outline current and future developments that will improve the quality of the generated compilers.