Formalizations Of Substitution Of Equals For Equals
| dc.contributor.author | Gries, David | en_US |
| dc.contributor.author | Schneider, Fred B. | en_US |
| dc.date.accessioned | 2007-04-23T18:13:17Z | |
| dc.date.available | 2007-04-23T18:13:17Z | |
| dc.date.issued | 1998-05 | en_US |
| dc.description.abstract | Inference rule "substitution of equals for equals" has been formalized in terms of simple substitution (which performs a replacement even though a free occurrence of a variable is captured), contextual substitution (which prevents such capture), and function application. We show that in connection with pure first-order predicate calculus, the function-application and no-capture versions of the inference rule are the same and are weaker than the capture version. We discuss the deductive apparatus needed for the no-capture version to be as powerful as the capture version. | en_US |
| dc.format.extent | 184499 bytes | |
| dc.format.extent | 334736 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1686 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7340 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Formalizations Of Substitution Of Equals For Equals | en_US |
| dc.type | technical report | en_US |