computational adequacy theorem
Transcription
-
- US Pronunciation
- US IPA
-
-
- US Pronunciation
- US IPA
-
Definition of computational adequacy theorem words
- noun Technical meaning of 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. 1
Information block about the term
Parts of speech for Computational adequacy theorem
noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation
See also
Matching words
- Words starting with c
- Words starting with co
- Words starting with com
- Words starting with comp
- Words starting with compu
- Words starting with comput
- Words starting with computa
- Words starting with computat
- Words starting with computati
- Words starting with computatio
- Words starting with computation
- Words starting with computationa
- Words starting with computational
- Words starting with computationala
Was this page helpful?
Thank you for your feedback! Tell your friends about this page
Tell us why?