The best-known language of this type is LISP (List Processing), in which all computation is expressed as an application of a function to one or more "objects".
M N represents the application of a function M to actual parameter N. The pure lambda calculus does not include numbers, booleans, arithmetic operations, etc., but we will occasionally use them in examples.
For Frege predication is the application of a function to an object.
But there is a distinction in categorial grammar between two sorts of application of a function to its arguments.
This takes into account that, in an application of a function with type, say (tau _1 rightarrow tau,) to an expression with type (PRightarrow tau _1,) it is not always adequate to include in the constraint set of the result all constraints from (Q).
In the first specification, we analyze Strategy it=a, measuring the likelihood of using a coping strategy at the time of application as a function of total application duration (AW i ), controlling for individual characteristics.
Second, we analyze the outcome Strategyit for all months of application as a function of total application duration (AW i ).
A simple linear model of the performance of the application as a function of architectural parameters is derived by fitting the results of a bunch of simulations based on the trace.
There are two sorts of objects: objects of type II (functions, corresponding to classes) and objects of type I (arguments), linked by the application operation of a function to its arguments.
A performance model describing the execution time of the application as a function of its spatial resolution and the hardware performance is proposed.
Figure 2 shows user wall time of the web-based application as a function of the number of simultaneous users using the application in that very moment.
