The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than ordinary -calculus. We explore the basic theory of -calculus, establishing results such as con uence. In doing so, we nd some requirements for patterns that guarantee con uence. Our work can be seen as giving some fou...

 Recently, Khodabakhshi and Aryavash have introduced a ranking method [Applied Mathematics Letters, 25 (2012) 2066-2070.], which is based on an optimistic-pessimistic approach of data envelopment analysis (DEA). This method ranks all decision making units according to a combination of their minimum and maximum possible efficiency scores which are determined by solving two linear programming mo...

The models described in this paper for treating congestion in DEA are extended by according them chance constrained programming formulations. The usual route used in chance constrained programming is followed here by replacing these stochastic models with their ‘‘deterministic equivalents.’’ This leads to a class of non-linear problems. However, it is shown to be possible to avoid some of the n...

Connguration Programming, based on Architecture Description Languages, and Meta-Level Programming are considered promising approaches in the software engineering eld. This paper shows that there is an immediate correspondence between some key concepts of Conngura-tion and Meta-Level Programming approaches and that some of the main issues to be solved for their deployment in real systems are qui...