PolyAML: a polymorphic aspect-oriented functional programming language

ABSTRACT

This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of Poly<SMALL>AML</SMALL> is the seamless integration of polymorphism, run-time type analysis and aspect-oriented programming language features. In particular, Poly<SMALL>AML</SMALL> allows programmers to define type-safe polymorphic advice using pointcuts constructed from a collection of polymorphic join points. Poly<SMALL>AML</SMALL> also comes equipped with a type inference algorithm that conservatively extends Hindley-Milner type inference. To support first-class polymorphic point-cut designators, a crucial feature for developing aspect-oriented profiling or logging libraries, the algorithm blends the conventional Hindley-Milner type inference algorithm with a simple form of local type inference.We give our language operational meaning via a type-directed translation into an expressive type-safe intermediate language. Many complexities of the source language are eliminated in this translation, leading to a modular specification of its semantics. One of the novelties of the intermediate language is the definition of polymorphic labels for marking control-flow points. These labels are organized in a tree structure such that a parent in the tree serves as a representative for all of its children. Type safety requires that the type of each child is less polymorphic than its parent type. Similarly, when a set of labels is assembled as a pointcut, the type of each label is an instance of the type of the pointcut.

REFERENCES

• 1: J. Aldrich. Open modules: A proposal for modular reasoning in aspect-oriented programming. In Workshop on Foundations of Aspect-Oriented Languages, Mar. 2004.
• 2: J. Aldrich. Open modules: Reconciling extensibility and information hiding. In Proceedings of the Software Engineering Properties of Languages for Aspect Technologies, Mar. 2004.
• 3: Lujo Bauer , Jay Ligatti , David Walker, Composing security policies with polymer, Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, June 12-15, 2005, Chicago, IL, USA
• 4: G. Bruns, R. Jagadeesan, A. S. A. Jeffrey, and J. Riely. muABC: A minimal aspect calculus. In Concur, pages 209--224, Apr. 2004.
• 5: C. Clifton and G. T. Leavens. Assistants and observers: A proposal for modular aspect-oriented reasoning. In Foundations of Aspect Languages, Apr. 2002.
• 6: Thomas Colcombet , Pascal Fradet, Enforcing trace properties by program transformation, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.54-66, January 19-21, 2000, Boston, MA, USA [doi>10.1145/325694.325703]
• 7: Adrian Colyer , Andrew Clement, Large-scale AOSD for middleware, Proceedings of the 3rd international conference on Aspect-oriented software development, p.56-65, March 22-24, 2004, Lancaster, UK [doi>10.1145/976270.976279]
• 8: Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
• 9: D. S. Dantas and D. Walker. Aspects, information hiding and modularity. Technical Report TR-696-04, Princeton University, Nov. 2003.
• 10: D. S. Dantas and D. Walker. Harmless advice. In Workshop on Foundations of Object-Oriented Languages, Jan. 2005.
• 11: D. S. Dantas, D. Walker, G. Washburn, and S. Weirich. Poly<SMALL>AML</SMALL>: A polymorphic aspect-oriented functional programmming language (extended version). Technical Report MS-CIS-05-07, University of Pennsylvania, May 2005.
• 12: Rémi Douence , Olivier Motelet , Mario Südholt, A Formal Definition of Crosscuts, Proceedings of the Third International Conference on Metalevel Architectures and Separation of Crosscutting Concerns, p.170-186, September 25-28, 2001
• 13: Rémi Douence , Pascal Fradet , Mario Südholt, Composition, reuse and interaction analysis of stateful aspects, Proceedings of the 3rd international conference on Aspect-oriented software development, p.141-150, March 22-24, 2004, Lancaster, UK [doi>10.1145/976270.976288]
• 14: Úlfar Erlingsson , Fred B. Schneider, SASI enforcement of security policies: a retrospective, Proceedings of the 1999 workshop on New security paradigms, p.87-95, September 22-24, 1999, Caledon Hills, Ontario, Canada [doi>10.1145/335169.335201]
• 15: Ulfar Erlingsson , Fred B. Schneider, IRM Enforcement of Java Stack Inspection, Proceedings of the 2000 IEEE Symposium on Security and Privacy, p.246, May 14-17, 2000
• 16: D. Evans and A. Twyman. Flexible policy-directed code safety. In IEEE Security and Privacy, Oakland, CA, May 1999.
• 17: R. E. Filman and D. P. Friedman. Aspect-Oriented Software Development, chapter Aspect-Oriented Programming is Quantification and Obliviousness. Addison-Wesley, 2005.
• 18: M. Fiuczynski, Y. Cody, R. Grimm, and D.Walker. Patch(1) considered harmful. In HotOS, July 2005. To appear.
• 19: R. Jagadeesan, A. Jeffrey, and J. Riely. A calculus of typed aspectoriented programs. Unpublished manuscript., 2003.
• 20: R. Jagadeesan, A. Jeffrey, and J. Riely. A calculus of untyped aspectoriented programs. In European Conference on Object-Oriented Programming, Darmstadt, Germany, July 2003.
• 21: Gregor Kiczales , Erik Hilsdale , Jim Hugunin , Mik Kersten , Jeffrey Palm , William G. Griswold, An Overview of AspectJ, Proceedings of the 15th European Conference on Object-Oriented Programming, p.327-353, June 18-22, 2001
• 22: M. Kim, M. Viswanathan, H. Ben-Abdallah, S. Kannan, I. Lee, and O. Sokolsky. Formally specified monitoring of temporal properties. In European Conference on Real-time Systems, York, UK, June 1999.
• 23: I. Lee, S. Kannan, M. Kim, O. Sokolsky, and M. Viswanathan. Runtime assurance based on formal specifications. In International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, June 1999.
• 24: X. Leroy. The Objective Caml system: Documentation and user's manual, 2000. With Damien Doligez, Jacques Garrigue, Didier Rémy, and Jérôome Vouillon. Available from http://caml.inria.fr.
• 25: K. J. Lieberherr, D. Lorenz, and J. Ovlinger. Aspectual collaborations – combining modules and aspects. The Computer Journal, 46(5):542--565, September 2003.
• 26: H. Masuhara, G. Kiczales, and C. Dutchyn. Compilation semantics of aspect-oriented programs. In G. T. Leavens and R. Cytron, editors, Foundations of Aspect-Oriented Languages Workshop, pages 17--25, Apr. 2002.
• 27: Dale Miller, Unification under a mixed prefix, Journal of Symbolic Computation, v.14 n.4, p.321-358, Oct. 1992 [doi>10.1016/0747-7171(92)90011-R]
• 28: R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3), 1978.
• 29: Robin Milner , Mads Tofte , David Macqueen, The Definition of Standard ML, MIT Press, Cambridge, MA, 1997
• 30: S. Peyton Jones, D. Vytiniotis, S. Weirich, and M. Shields. Practical type inference for arbitrary-rank types. Submitted to the Journal of Functional Programming, 2005.
• 31: S. Peyton Jones, G.Washburn, and S.Weirich. Wobbly types: Practical type inference for generalised algebraic dataypes. Available at http://www.cis.upenn.edu/_geoffw/research/, July 2004.
• 32: Benjamin C. Pierce , David N. Turner, Local type inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.252-265, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268967]
• 33: M. Shields and S. Peyton Jones. Lexically scoped type variables. Microsoft Research. Available at http://research.microsoft.com/Users/simonpj/papers/scoped-tyvars, 2002.
• 34: V. Simonet and F. Pottier. Constraint-based type inference for guarded algebraic data types. Technical Report Research Report 5462, INRIA, Jan. 2005.
• 35: P. J. Stuckey and M. Sulzmann. Type inference for guarded recursive data types. Submitted for publication, Feb. 2005.
• 36: Hidehiko Masuhara , Hideaki Tatsuzawa , Akinori Yonezawa, Aspectual Caml: an aspect-oriented functional language, Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, September 26-28, 2005, Tallinn, Estonia
• 37: David B. Tucker , Shriram Krishnamurthi, Pointcuts and advice in higher-order languages, Proceedings of the 2nd international conference on Aspect-oriented software development, p.158-167, March 17-21, 2003, Boston, Massachusetts [doi>10.1145/643603.643620]
• 38: D. Vytiniotis, S. Weirich, and S. Peyton Jones. Boxy type inference for higher-rank types and impredicativity. Available at http://www.cis.upenn.edu_dimitriv/boxy/, April 2005.
• 39: David Walker , Steve Zdancewic , Jay Ligatti, A theory of aspects, Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, p.127-139, August 25-29, 2003, Uppsala, Sweden
• 40: Mitchell Wand , Gregor Kiczales , Christopher Dutchyn, A semantics for advice and dynamic join points in aspect-oriented programming, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.5, p.890-910, September 2004 [doi>10.1145/1018203.1018208]
• 41: Geoffrey Washburn, Generalizing Parametricity Using Information-flow, Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), p.62-71, June 26-29, 2005 [doi>10.1109/LICS.2005.20]

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Abstract data types

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Control structures; Polymorphism

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.3 Studies of Program Constructs
          Subjects: Type structure; Functional constructs; Program and recursion schemes
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Lambda calculus and related systems

General Terms:
Design, Languages, Theory

Keywords:
ad-hoc polymorphism, aspects-oriented programming, functional programming, type inference, type systems