A type system for functional traversal-based aspects

Authors:
Bryan Chadwick;Karl Lieberherr
Affiliations:
Northeastern University, Boston, MA, USA;Northeastern University, Boston, MA, USA
Venue:
Proceedings of the 2009 workshop on Foundations of aspect-oriented languages
Year:
2009

Citing 8
Cited 3

Object-oriented type inference

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
A syntactic approach to type soundness

Information and Computation
Classes and mixins

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Featherweight Java: a minimal core calculus for Java and GJ

ACM Transactions on Programming Languages and Systems (TOPLAS)
Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns

Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns
The Definition of Standard ML

The Definition of Standard ML
A theory of aspects

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A semantics for advice and dynamic join points in aspect-oriented programming

ACM Transactions on Programming Languages and Systems (TOPLAS)

Controlled evolution of adaptive programs

Proceedings of the joint international and annual ERCIM workshops on Principles of software evolution (IWPSE) and software evolution (Evol) workshops
Weaving generic programming and traversal performance

Proceedings of the 9th International Conference on Aspect-Oriented Software Development
A functional approach to generic programming using adaptive traversals

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in sets of functions that implement a fold over a data structure with the help of a generic traversal. In this paper we define the syntax, semantics, and typing rules of a simple AP-F model, together with a proof of soundness that guarantees that traversal expressions result in a value of the expected type. Applying a function set to a different structure can then be statically checked to eliminate some runtime tests and sources of program errors.