Procedural Reflection in Programming Languages Volume I
Name
MIT-LCS-TR-272.pdf
Size
33.6 MB
Format
Adobe PDF
Checksum (MD5)
b3f7c5a59a12ea6de4db8ce0ee00cdb1
Author(s)
Smith, Brian Cantwell
Advisor(s)
Szolovits, Peter
Date Issued
January 1982
Series/Report no.
MIT-LCS-TR-272
Abstract
We show how a computational system can be constructed to "reason," effectively and consequentially, about its own inferential processes. The analysis proceeds in two parts. First, we consider the general question of computational semantics, rejecting traditional approaches, and arguing that the declarative and procedural aspects of computational symbols (what they stand for, and what behaviour they engender) should be analysed independently, in order that they may be coherently related.
Persistent DSpace Link
