The formalization of recursive definition of functions in the programming language LISP is studied with respect to its ontological assumptions. It is shown that whereas the theory of recursive function is based on the ontology of actual infinity, the semantics of variables and functions in a programming language can be adequately explained with the concept only of potential infinity.
CitationDownload as .RIS
MCB UP Ltd
Copyright © 1976, MCB UP Limited