Hostname: page-component-8678677fb7-6w47d Total loading time: 0 Render date: 2026-10-06T13:10:54.717Z Has data issue: false hasContentIssue false
  • English
  • Français

A filter lambda model and the completeness of type assignment1

Published online by Cambridge University Press:  12 March 2014

Henk Barendregt ,
Mario Coppo  and
Mariangiola Dezani-Ciancaglini
Henk Barendregt
Affiliation:
Mathematisch Instituut, Utrecht, The Netherlands
Mario Coppo
Affiliation:
Istituto di Scienze dell'Informazione, Torino, Italy
Get access Rights & Permissions [Opens in a new window]

Extract

In [6, p. 317] Curry described a formal system assigning types to terms of the type-free λ-calculus. In [11] Scott gave a natural semantics for this type assignment and asked whether a completeness result holds.

Inspired by [4] and [5] we extend the syntax and semantics of the Curry types in such a way that filters in the resulting type structure form a domain in the sense of Scott [12]. We will show that it is possible to turn the domain of types into a λ-model, among other reasons because all λ-terms possess a type. This model gives the completeness result for the extended system. By a conservativity result the completeness for Curry's system follows.

Independently Hindley [8], [9] has proved both completeness results using term models. His method of proof is in some sense dual to ours.

For λ-calculus notation see [1].

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 48 , Issue 4 , December 1983 , pp. 931 - 940
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

Research partially supported by the Italian C.N.R. Grant 80.01917.97.

References

REFERENCES

[1]Barendregt, H., The lambda calculus, its syntax and semantics, North-Holland, Amsterdam, 1981.Google Scholar
[2]BEN-Yelles, C. B., Type-assignment in the lambda-calculus; Syntax and semantics, Doctoral Thesis, University College of Swansea, 1979.Google Scholar
[3]Coppo, M., Dezani-Ciancaglini, M. and Sallé, P., Functional characterization of some semantic equalities inside λ-calculus, Automata, languages and programming (Maurer, E., Editor), Lecture Notes in Computer Science, vol. 71, Springer-Verlag, Berlin and New York, 1979, pp. 133–146.Google Scholar
[4]Coppo, M., Dezani-Ciancaglini, M. and Venneri, B., Principal type schemes and λ-calculus semantics, To H.B. Curry, Essays in combinatory logic, lambda-calculus and formalism (Hindley, R. and Seldin, J.P., Editors), Academic Press, New York, 1980, pp. 535–560.Google Scholar
[5]Coppo, M., Functional characters of solvable terms, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 27 (1981), pp. 45–58.CrossRefGoogle Scholar
[6]Curry, H. B. and Feys, R., Combinatory logic. I, North-Holland, Amsterdam, 1958.Google Scholar
[7]Hindley, R. and Longo, G., Lambda calculus models and extensionality, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 26 (1980), pp. 289–310.CrossRefGoogle Scholar
[8]Hindley, R., The completeness theorem for typing λ-terms, Theoretical Computer Science (to appear).Google Scholar
[9]Hindley, R., A semantics for Coppo-Dezani type assignment, International symposium on programming (Dezani, M. and Montanari, H., Editors), Lecture Notes in Computer Science, vol. 137, Springer-Verlag, Berlin and New York, 1982, pp. 212–226.CrossRefGoogle Scholar
[10]Prawitz, D., Natural deduction, a proof-theoretical study, Almquist & Wiksell, Stockholm, 1965.Google Scholar
[11]Scott, D., Open problem n˚ II 4, λ-calculus and computer science theory, (Böhm, C., Editor), Lectures Notes in Computer Science, vol. 37, Springer-Verlag, Berlin and New York, 1975, p. 369.Google Scholar
[12]Scott, D., Lectures on a mathematical theory of computation, University of Oxford, 1980.Google Scholar