Article navigation

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.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$41.00
Rental

or Create an Account

Close Modal
Close Modal