Hostname: page-component-68c7f8b79f-lqrcg Total loading time: 0 Render date: 2025-12-24T19:01:46.006Z Has data issue: false hasContentIssue false
  • English
  • Français

POLYMORPHISM AND MINIMAL TYPES WITHOUT DEPENDENT PRODUCTS

Part of: General logic Proof theory and constructive mathematics Ordered structures

Published online by Cambridge University Press:  19 March 2025

MATTHIAS WEBER Open the ORCID record for MATTHIAS WEBER [Opens in a new window]
MATTHIAS WEBER*
Affiliation:
DEPARTMENT OF COMPUTER SCIENCE TECHNICAL UNIVERSITY OF BERLIN BERLIN GERMANY
*
E-mail: mattnweber@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

The distinction of the semantic spaces of elements and types is common practice in practically all type systems. A few type systems, including some early ones, have been proposed whose semantic space has functions only, i.e., depending on the context functions may play element roles as well as type roles. All of these systems are either lacking expressive power, in particular, polymorphism, or they violate uniqueness of types. This work presents for the first time a function-based type system in which typing is a relation between functions and which is using an ordering of functions to introduce bounded polymorphism. The ordering is based on an infinite set of top objects, itself strictly linearly ordered, each of which characterizes a certain function space. These top objects are predicative in the sense that a function using some top object cannot be smaller than this object. The interpretation of proposition as types and elements as proofs remains valid and is extended by viewing the ordering between types as logical implication. The proposed system can be shown to satisfy confluence and subject reduction. Furthermore one can show that the ordering is a partial order, every set of expressions has a maximal element, and there is a (unique) minimal, logically strongest, type among all types of an element. The latter result implies an alternative notion of uniqueness of types. Strong normalisation is the deepest property and its proof is based on a well-founded relation defined over a subsystem of expressions without eliminators. Semantic abstraction of the objects involved in typing, i.e., to use functions in element as well as type roles in a relational setting, is the major contribution of function-based type systems. This work shows that dependent products are not necessary for defining type systems with bounded polymorphism, rather it presents a consistent system with bounded polymorphism and minimal types where typing is a relation between partially ordered functions.

MSC classification

Primary: 03F05: Cut-elimination and normal-form theorems
Secondary: 03B40: Combinatory logic and lambda-calculus 06F99: None of the above, but in this section

Information

Type
Article
Information
The Journal of Symbolic Logic , First View , pp. 1 - 33
Check for updates
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

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.)

Article purchase

Temporarily unavailable

References

REFERENCES

Barendregt, H. P., Lambda Calculi with Types, Handbook of Logic in Computer Science, 2, Oxford University Press, Oxford, 1991.Google Scholar
van Benthem Jutting, L. S., The language theory of lambda infinity, a typed lambda-calculus where terms are types . Studies in Logic and the Foundations of Mathematics, vol. 133 (1994), pp. 655–683.CrossRefGoogle Scholar
de Bruijn, N. G., Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church–Rosser theorem. Indagationes Mathematicae, vol. 34 (1972), pp. 381–392.CrossRefGoogle Scholar
de Bruijn, N. G., A survey of the project automath , To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (Seldin, J. P. and Hindley, J. R., editors), Academic Press, New York, 1980, pp. 579–606.Google Scholar
de Bruijn, N. G., Generalizing automath by means of a lambda-typed lambda calculus , Selected Papers on Automath (Geuvers, J. H., Nederpelt, R. P., and de Vrijer, R. C., editors), Studies in Logic and the Foundations of Mathematics, 133, Elsevier, Amsterdam, 1994, pp. 313–337.CrossRefGoogle Scholar
Coquand, T., An analysis of Girard’s paradox , LICS, IEEE Computer Society, Cambridge, 1986, pp. 227–236.Google Scholar
Coquand, T. and Huet, G., The calculus of constructions . Information and Computation, vol. 76 (1988), no. 2, pp. 95–120.CrossRefGoogle Scholar
van Daalen, D. T., The language theory of automath , Technische Hogeschool Eindhoven, 1977.Google Scholar
Girard, J.-I., Interprétation fonctionnelle et élimination des coupures dans làrithmetique dòrdre supérieur, Ph.D. thesis, Université Paris VII, 1972.Google Scholar
de Groote, P., Defining lambda-typed lambda-calculi by axiomatizing the typing relation , Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS ’93, Springer-Verlag, London, 1993, pp. 712–723.Google Scholar
Guidi, F., The formal system lambda-delta . ACM Transactions on Computational Logic (TOCL), vol. 11 (2009), no. 1, pp. 5:1–5:37.CrossRefGoogle Scholar
Guidi, F., A formal system for the universal quantification of schematic variables , ACM Transactions on Computational Logic (TOCL), vol. 23 (2021), no. 1, pp. 1–37.CrossRefGoogle Scholar
Howard, W. A., The formulae-as-types notion of construction , To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (Seldin, J. P. and Hindley, J. R., editors), Academic Press, New York, 1980, Original paper manuscript from 1969, pp. 479–490.Google Scholar
Hurkens, A. J. C., A simplification of Girard’s paradox, In: Typed lambda calculi and applications, Springer-Verlag Berlin, 1995, pp. 266–278.Google Scholar
Kamareddine, F., Typed λ-calculi with one binder . Journal of Functional Programming, vol. 15 (2005), pp. 771–796.CrossRefGoogle Scholar
Lungu, G. E. and Luo, Z., On subtyping in type theories with canonical objects , 22nd International Conference on Types for Proofs and Programs (TYPES 2016), Dagstuhl, Germany, (Ghilezan, S., Geuvers, H., and Ivetić, J., editors), Leibniz International Proceedings in Informatics (LIPIcs), 97, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl, 2018, pp. 13:1–13:31.Google Scholar
Luo, Z., Ecc, an extended calculus of constructions , [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, Asilomar, California, 1989, pp. 386–395.CrossRefGoogle Scholar
Nederpelt, R. P., Strong normalisation in a typed lambda calculus with lambda structured types, Ph.D. thesis, Eindhoven University of Technology, 1973.Google Scholar
Tait, W. W., Intensional interpretations of functionals of finite type i . The Journal of Symbolic Logic, vol. 32 (1967), no. 2, pp. 198–212.CrossRefGoogle Scholar
Weber, M., An extended type system with lambda-typed lambda-expressions . Logical Methods in Computer Science, vol. 16 (2020), no. 4, pp. 12:2–12:50.Google Scholar
Weber, M., An extended type system with lambda-typed lambda-expressions (extended version), Technical Report, TU Berlin, Berlin, preprint, arXiv:1803.06488v5, 2024, pp. 1–246.Google Scholar