ThesaHelp: references mo
Topic: topdown vs. bottomup design
Topic: programming language design
Group: debugging
Group: program proving
Topic: semantics by an abstract machine
Topic: logic
Topic: thought is computational
 
Reference
McCarthy, J.,
"Towards a mathematical science of computation", in Popplewell, C.M. (ed.),
Information Processing 1962 Proceedings of IFIP Congress 62, Munich Germany, August/September 1962, NorthHolland Publishing, pp. 2128.
Google
Quotations
22 ;;Quote: design a programming language by understanding the structure of computation and data spaces; instead of evaluating features against their costs
 22 ;;Quote: debugging is testing programs on cases one hopes are typical, until it seems to work
 22+;;Quote: need a mathematical science of computation to prove that programs meet their specifications; check the proofs by computer
 27 ;;Quote: use analytic syntactic functions and state vectors to define the semantics of a programming language; e.g., val(t) and mkconst(val(t))
 27 ;;Quote: there is no inherent limitation to the intelligence of a computer program; e.g., Post's automatic improvement process for deciding if a sentence is a theorem

Related Topics
ThesaHelp: references mo (268 items)
Topic: topdown vs. bottomup design (30 items)
Topic: programming language design (53 items)
Group: debugging (10 topics, 325 quotes)
Group: program proving (10 topics, 310 quotes)
Topic: semantics by an abstract machine (38 items)
Topic: logic (84 items)
Topic: thought is computational (55 items)
