Word:

Computational Adequacy Theorem

Computational Adequacy Theorem - 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.
Browse
Compunction
Compunctionless
Compunctious
Compunctiously
Compunctive
Compurgation
Compurgator
Compurgatorial
CompuServe Corporation
CompuServe Information Service
Compusult Ltd.
computability theory
Computable
Computation
Computation counting
computational
-- Computational Adequacy Theorem --
computational complexity
computational geometry
computational learning
computational linguist
computational linguistics
computationally
Compute
COMpute ParallEL
compute server
computed axial tomography
computed tomography
Computed Tomography (CT) Scan
Computer
Computer + Science NETwork
computer accessory
computer address
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy