Abstract

The syntax of a formal language is effectively given. This is not immediately so for the semantics. This paper deals with the simple but sufficiently powerful applicative language ( λ -calculus) and studies effectiveness properties of its semantics. In particular it analyses the effectiveness of the interpretation of λ -terms as well as different notions of computability over models.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call