Semantics and scoping of aspects in higher-order languages

被引:23
|
作者
Dutchyn, Christopher
Tucker, David B.
Krishnamurthi, Shriram
机构
[1] Univ Saskatchewan, Dept Comp Sci, Saskatoon, SK S7N 1X9, Canada
[2] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
基金
美国国家科学基金会;
关键词
scheme; aspect; join point; pointcut; advice; higher-order; CEKS; abstract machine;
D O I
10.1016/j.scico.2006.01.003
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Aspect-oriented software design will need to support languages with first-class and higher-order procedures, such as Ruby, Perl, ML and Scheme. These language features present both challenges and benefits for aspects. On the one hand, they force the designer to carefully address issues of scope that do not arise in first-order languages. On the other hand, these distinctions of scope make it possible to define a much richer variety of policies than first-order aspect languages permit. In this paper, we describe the subtleties of pointcuts and advice for higher-order languages, particularly Scheme. We then resolve these subtleties by alluding to traditional notions of scope. In particular, programmers can now define both dynamic aspects traditional to AOP and static aspects that can capture common security-control paradigms. We provide an operational semantics, based on an extended CEKS machine, that gives a formal account of dynamic and static aspects. We implement the language as an extension to Scheme. By exploiting two novel features of our Scheme system-continuation marks and language-defining macros-the implementation is lightweight and integrates well into the programmer's toolkit. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:207 / 239
页数:33
相关论文
共 50 条
  • [1] A REDUCTION SEMANTICS FOR IMPERATIVE HIGHER-ORDER LANGUAGES
    FELLEISEN, M
    FRIEDMAN, DP
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 259 : 206 - 223
  • [2] 1ST-ORDER SEMANTICS FOR HIGHER-ORDER LANGUAGES
    KASBAUER, M
    [J]. CRITICA-REVISTA HISPANOAMERICANA DE FILOSOFIA, 1977, 9 (25): : 59 - 71
  • [3] HIGHER-ORDER ATTRIBUTE SEMANTICS OF FLAT DECLARATIVE LANGUAGES
    Grigorenko, Pavel
    Tyugu, Enn
    [J]. COMPUTING AND INFORMATICS, 2010, 29 (02) : 251 - 280
  • [4] Higher-order logic programming languages with constraints: A semantics
    Lipton, James
    Nieva, Susana
    [J]. TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS, 2007, 4583 : 272 - +
  • [5] A congruence theorem for structured operational semantics of higher-order languages
    Bernstein, KL
    [J]. THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 153 - 164
  • [6] Higher-order semantics and extensionality
    Benzmüller, C
    Brown, CE
    Kohlhase, M
    [J]. JOURNAL OF SYMBOLIC LOGIC, 2004, 69 (04) : 1027 - 1088
  • [7] SEMANTICS OF HIGHER-ORDER RECURSION SCHEMES
    Adamek, Jiri
    Milius, Stefan
    Velebil, Jiri
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (01)
  • [8] Relational semantics for higher-order programs
    Aboul-Hosn, Kamal
    Kozen, Dexter
    [J]. MATHEMATICS OF PROGRAM CONSTRUCTION, 2006, 4014 : 29 - 48
  • [9] Semantic values in higher-order semantics
    Stephan Krämer
    [J]. Philosophical Studies, 2014, 168 : 709 - 724
  • [10] Semantics of Higher-Order Recursion Schemes
    Adamek, Jiri
    Milius, Stefan
    Velebil, Jiri
    [J]. ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2009, 5728 : 49 - +