BibTeX
@MISC{_generalterms,
author = {},
title = {General Terms Languages, theory},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT We consider the problem of adding aspects to a strongly typed language which supports type classes. We show that type classes as supported by the Glasgow Haskell Compiler can model an AOP style of programming via a simple syntax-directed transformation scheme where AOP programming idioms are mapped to type classes. The drawback of this approach is that we cannot easily advise functions in programs which carry type annotations. We sketch a more principled approach which is free of such problems by combining ideas from intentional type analysis with advanced overloading resolution strategies. Our results show that type-directed static weaving is closely related to type class resolution- the process of typing and translating type class programs. Categories and Subject Descriptors D.3.1 [Programming Languages]: Formal Definitions and Theory--Semantics; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages--Operational semantics
