Abstract
We have to say a word or two about functions because, depending on the ways permitted for their definition, it may be questionable whether they are well-defined at all. Fortunately, our functions will be simple: they will be total functions with values and arguments of well-defined types.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Dijkstra, E.W., Schotten, C.S. (1990). On functions and equality. In: Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3228-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3228-5_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7924-2
Online ISBN: 978-1-4612-3228-5
eBook Packages: Springer Book Archive