Furthermore, if we conceive of Church's Thesis as asserting that a function is 'intuitively' computable if and only if it is a

partial recursive function (and this is surely a common conception of Church's Thesis), then the presupposition in Young [1977] amounts to no more than the application of the if direction of Church's Thesis to the resource bounded computations of complexity theory.

The practicality of the EP data model is comparable to the practicality of a programming language that theoretically expresses a class of partial recursive functions with the hypothesis of infinite time and space, but practically expresses a finite set of partial recursive functions.)

In sections 5.2.1 and 5.2.2, we intuitively discuss what typed programming languages are and what untyped programming languages are, and we further distinguish the differences between those untyped systems for partial recursive functions and the untyped Froglingo that has a type equivalent to a class of total recursive functions.

Lacking powerful built-in operators that are derivable from the properties of the class of partial recursive functions makes the sharing of some application-independent code difficult.

In this paper, we are interested in two kinds of untyped systems: the untyped systems which take a class of partial recursive functions as the semantics, and the untyped system, i.e., the EP data model (and therefore Froglingo), which takes a class of total recursive functions as its semantics.

The lambda calculus is a untyped system that take a class of partial recursive functions as semantics.

Due to the fact that the homomorphism from lambda expressions to partial recursive functions is not decidable, however, there is not an effective algorithm that arranges the lambda expressions in orders according to the properties of the class of partial recursive functions.