Adam Cataldo and Elaine Cheong and Thomas Huining Feng and Edward A. Lee and Andrew Christopher Mihal

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2006-48

May 9, 2006

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-48.pdf

In actor-oriented design, programmers make hierarchical compositions of concurrent components. As embedded systems become increasingly complex, these compositions become correspondingly complex in the number of actors, the depth of hierarchies, and the connections between ports. We propose <i>higher-order composition languages</i> as a way to specify these actor-oriented models. The key to these languages is the ability to succinctly specify configurations with <i>higher-order parameters</i>---parameters that themselves might be configurations. We present a formalism which allows us to describe arbitrarily complex configurations of components with higher-order parameters. This formalism is an extension of the standard lambda calculus.


BibTeX citation:

@techreport{Cataldo:EECS-2006-48,
    Author= {Cataldo, Adam and Cheong, Elaine and Feng, Thomas Huining and Lee, Edward A. and Mihal, Andrew Christopher},
    Title= {A Formalism for Higher-Order Composition Languages that Satisfies the Church-Rosser Property},
    Year= {2006},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-48.html},
    Number= {UCB/EECS-2006-48},
    Abstract= {In actor-oriented design, programmers make hierarchical compositions of concurrent components. As embedded systems become increasingly complex, these compositions become correspondingly complex in the number of actors, the depth of hierarchies, and the connections between ports.  We propose <i>higher-order composition languages</i> as a way to specify these actor-oriented models.  The key to these languages is the ability to succinctly specify configurations with <i>higher-order parameters</i>---parameters that themselves might be configurations.  We present a formalism which allows us to describe arbitrarily complex configurations of components with higher-order parameters.  This formalism is an extension of the standard lambda calculus.},
}

EndNote citation:

%0 Report
%A Cataldo, Adam 
%A Cheong, Elaine 
%A Feng, Thomas Huining 
%A Lee, Edward A. 
%A Mihal, Andrew Christopher 
%T A Formalism for Higher-Order Composition Languages that Satisfies the Church-Rosser Property
%I EECS Department, University of California, Berkeley
%D 2006
%8 May 9
%@ UCB/EECS-2006-48
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-48.html
%F Cataldo:EECS-2006-48