First Sentence:
It is well known that formal proofs can be used for program synthesis and program verification, and this essentially depends on the availability of an information extraction mechanism allowing the capture in an uniform way of the implicit algorithmic content of a proof.
Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
contextual specialization, probabilistic abstract interpretation, opaque inputs, extended program clause, functor argument positions, initial call patterns, computational type theory, opaque output, analysis registry, logic program transformation, opaque parameters, failure continuation, coupling invariant, positive supercompilation, logical type theory, folding equivalent, narrowing trees, execution depth, narrowing derivation, clause generalization, module refinement, constraint replacement, import graph, closure under substitution, residual programs
Key Phrases - Capitalized Phrases (CAPs):
(learn more)
Computer Science, Technical Report, Kung-Kiu Lau, Lecture Notes, Springer-Verlag Berlin Heidelberg, Springer Verlag, Principles of Programming Languages, Cover Set Induction Rule, Monash University, New York, Prentice Hall, Sigplan Notices, End Fig, Computer Society Press, Intl Conf
New!
Books on Related Topics |
Concordance
|
Text Stats
Browse Sample Pages:
Front Cover |
Table of Contents |
First Pages |
Index |
Back Cover |
Surprise Me!