This states that for any program (a non-function typed term in the typed lambda-calculus with constants) normal order reduction (outermost first) fails to terminate if and only if the standard semantics of the term is bottom. Moreover, if the reduction of program e1 terminates with some head normal form e2 then the standard semantics of e1 and e2 will be equal. This theorem is significant because it relates the operational notion of a reduction sequence and the denotational semantics of the input and output of a reduction sequence.
- Computational fluid dynamics
noun 1. (functioning as sing) the prediction of the behaviour of fluids and of the effects of fluid motion past objects by numerical methods rather than model experiments language (CFD) A Fortran-based parallel language for the Illiac IV. (1994-11-29)
- Computational geometry
mathematics The study of algorithms for combinatorial, topological, and metric problems concerning sets of points, typically in Euclidean space. Representative areas of research include geometric search, convexity, proximity, intersection, and linear programming. (1997-08-03)
- Computational grid
noun a large number of networked computers whose processing power used to solve difficult and time-consuming problems Word Origin from its similarity to an electrical power grid Usage Note computing
- Computational learning