dc.contributor.author Griffin, Timothy G. en_US dc.date.accessioned 2007-04-23T17:24:34Z dc.date.available 2007-04-23T17:24:34Z dc.date.issued 1988-03 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-901 en_US dc.identifier.uri https://hdl.handle.net/1813/6741 dc.description.abstract In the course of developing a mathematical theory or proof it is a common practice to introduce new notation to represent notation that is previously understood. This paper presents a formal account that is intended to model the practice of introducing and using notational (abbreviative) definitions. The aim of this work is a pragmatic one: to provide a framework useful in the design and implementation of secure proof system interfaces which accommodate, as much as possible, conventional mathematical practice. A typed $\lambda$-calculus is used to represent expressions of a given object language. A new type of equation, called a $\Delta$-equation, is introduced to model conventional definitional equations. en_US dc.format.extent 2676253 bytes dc.format.extent 599020 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript 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 A Formal Account of Notational Definition en_US dc.type technical report en_US
﻿