论文信息 - Effectively Given Domains and Lambda-Calculus Models

Effectively Given Domains and Lambda-Calculus Models

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.

Paola Giannini | Giuseppe Longo | G. Longo | P. Giannini

[1] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .

[2] Michael B. Smyth,et al. Effectively given Domains , 1977, Theor. Comput. Sci..

[3] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[4] J. Roger Hindley,et al. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[5] H. Barendregt. The type free lambda calculus , 1977 .

[6] Sören Stenlund. Computable Functionals of Finite Type , 1972 .

[7] Yu. L. Ershov. Computable functionals of finite types , 1972 .

[8] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[9] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[10] A. Kanda. Data Types as Effective Objects , 1977 .

[11] G. Longo,et al. Equality of lambda terms in the model T omega , 1980 .

[12] G. Plotkin. Tω as a Universal Domain , 1978 .

[13] Edward Sciore,et al. Computability theory in admissible domains , 1978, STOC.

[14] Dana S. Scott,et al. Lectures on a Mathematical Theory of Computation , 1982 .

[15] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[16] Yu. L. Ershov,et al. The theory of A-spaces , 1973 .

[17] Giuseppe Longo,et al. Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..