Procedural Reflection in Programming Languages Volume I
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 t...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149550 |
| _version_ | 1826215283145048064 |
|---|---|
| author | Smith, Brian Cantwell |
| author2 | Szolovits, Peter |
| author_facet | Szolovits, Peter Smith, Brian Cantwell |
| author_sort | Smith, Brian Cantwell |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T16:21:46Z |
| id | mit-1721.1/149550 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T16:21:46Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1495502023-03-30T03:05:50Z Procedural Reflection in Programming Languages Volume I Smith, Brian Cantwell Szolovits, Peter 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. 2023-03-29T15:06:05Z 2023-03-29T15:06:05Z 1982-01 https://hdl.handle.net/1721.1/149550 8700576 MIT-LCS-TR-272 application/pdf |
| spellingShingle | Smith, Brian Cantwell Procedural Reflection in Programming Languages Volume I |
| title | Procedural Reflection in Programming Languages Volume I |
| title_full | Procedural Reflection in Programming Languages Volume I |
| title_fullStr | Procedural Reflection in Programming Languages Volume I |
| title_full_unstemmed | Procedural Reflection in Programming Languages Volume I |
| title_short | Procedural Reflection in Programming Languages Volume I |
| title_sort | procedural reflection in programming languages volume i |
| url | https://hdl.handle.net/1721.1/149550 |
| work_keys_str_mv | AT smithbriancantwell proceduralreflectioninprogramminglanguagesvolumei |