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 条
  • [21] AN ALGEBRAIC SEMANTICS OF HIGHER-ORDER TYPES WITH SUBTYPES
    QIAN, ZY
    [J]. ACTA INFORMATICA, 1993, 30 (06) : 569 - 607
  • [22] Towards a Higher-Order Mathematical Operational Semantics
    Goncharov, Sergey
    Milius, Stefan
    Schroeder, Lutz
    Tsampas, Stelios
    Urbat, Henning
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL): : 632 - 658
  • [23] A typed semantics of higher-order store and subtyping
    Schwinghammer, J
    [J]. THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3701 : 390 - 405
  • [24] Semantics of Higher-Order Probabilistic Programs with Conditioning
    Dahlqvist, Fredrik
    Kozen, Dexter
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
  • [25] Typed operational semantics for higher-order subtyping
    Compagnoni, A
    Goguen, H
    [J]. INFORMATION AND COMPUTATION, 2003, 184 (02) : 242 - 297
  • [26] Game semantics approach to higher-order complexity
    Feree, Hugo
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 87 : 1 - 15
  • [27] Environmental Bisimulations for Probabilistic Higher-order Languages
    Sangiorgi, Davide
    Vignudelli, Valeria
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2019, 41 (04):
  • [28] QPCF: Higher-Order Languages and Quantum Circuits
    Paolini, Luca
    Piccolo, Mauro
    Zorzi, Margherita
    [J]. JOURNAL OF AUTOMATED REASONING, 2019, 63 (04) : 941 - 966
  • [29] QPCF: Higher-Order Languages and Quantum Circuits
    Luca Paolini
    Mauro Piccolo
    Margherita Zorzi
    [J]. Journal of Automated Reasoning, 2019, 63 : 941 - 966
  • [30] The semantic view of theories and higher-order languages
    Hudetz, Laurenz
    [J]. SYNTHESE, 2019, 196 (03) : 1131 - 1149