Hostname: page-component-745bb68f8f-grxwn Total loading time: 0 Render date: 2025-01-23T05:21:52.074Z Has data issue: false hasContentIssue false
  • English
  • Français

ETA-RULES IN MARTIN-LÖF TYPE THEORY

Published online by Cambridge University Press:  22 July 2019

ANSTEN KLEV
ANSTEN KLEV*
Affiliation:
INSTITUTE OF PHILOSOPHY CZECH ACADEMY OF SCIENCES JILSKÁ 1, PRAGUE 1, 110 00, CZECH REPUBLIC E-mail:klev@flu.cas.cz
Get access Rights & Permissions [Opens in a new window]

Abstract

The eta rule for a set A says that an arbitrary element of A is judgementally identical to an element of constructor form. Eta rules are not part of what may be called canonical Martin-Löf type theory. They are, however, justified by the meaning explanations, and a higher order eta rule is part of that type theory. The main aim of this article is to clarify this somewhat puzzling situation. It will be argued that lower order eta rules do not, whereas the higher order eta rule does, accord with the understanding of judgemental identity as definitional identity. A subsidiary aim is to clarify precisely what an eta rule is. This will involve showing how such rules relate to various other notions of type theory, proof theory, and category theory.

Keywords

03B1503A05type theorydefinitional identityjustification of logical laws
Type
Articles
Information
Bulletin of Symbolic Logic , Volume 25 , Issue 3 , September 2019 , pp. 333 - 359
Copyright
Copyright © The Association for Symbolic Logic 2019 

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

References

REFERENCES

Backhouse, R., Chisholm, P., Malcolm, G., and Saaman, E., Do-it-yourself type theory. Formal Aspects of Computing, vol. 1 (1989), pp. 19–84.CrossRefGoogle Scholar
Baranov, S. and Soloviev, S., Conditionally reversible computations and weak univerality in category theory. Journal of Mathematical Sciences, vol. 200 (2014), pp. 654–661.CrossRefGoogle Scholar
Curry, H. and Feys, R., Combinatory Logic, North-Holland, Amsterdam, 1958.Google Scholar
Došen, K., Identity of proofs based on normalization and generality, this Bulletin, vol. 9 (2003), pp. 477–503.Google Scholar
Došen, K. and Petrić, Z., The maximality of the typed lambda calculus and of cartesian closed categories. Publications de l’Institut Mathématique, vol. 68 (2000), pp. 1–19.Google Scholar
Dybjer, P., Inductive families. Formal Aspects of Computing, vol. 6 (1994), pp. 440–465.CrossRefGoogle Scholar
Dybjer, P., A general formulation of simultaneous inductive-recursive definitions in type theory. The Journal of Symbolic Logic, vol. 65 (2000), pp. 525–549.CrossRefGoogle Scholar
Frege, G., Grundgesetze der Arithmetik, Hermann Pohle, Jena, 1893.Google Scholar
Garner, R., On the strength of dependent products in the type theory of Martin-Löf. Annals of Pure and Applied Logic, vol. 160 (2009), pp. 1–12.CrossRefGoogle Scholar
Goguen, H., A typed operational semantics for type theory, Ph.D. thesis, University of Edinburgh, 1994.Google Scholar
Goodstein, R. L., Recursive Number Theory, North-Holland, Amsterdam, 1957.Google Scholar
Harper, R., Honsell, F., and Plotkin, G., A framework for defining logics. Journal of the ACM, vol. 40 (1993), pp. 143–184.CrossRefGoogle Scholar
Hedberg, M., A coherence theorem for Martin-Löf’s type theory. Journal of Functional Programming, vol. 8 (1998), pp. 413–436.CrossRefGoogle Scholar
Hofmann, M., Extensional Constructs in Intensional Type Theory, Springer, London, 1997, Reprinted of Ph.D. thesis, University of Edinburgh, 1995.CrossRefGoogle Scholar
Hofmann, M. and Streicher, T., The groupoid interpretation of type theory, Twenty-Five Years of Constructive Type Theory (Sambin, G. and Smith, J., editors), Oxford University Press, Oxford, 1998, pp. 83–111.Google Scholar
Lambek, J. and Scott, P. J., Introduction to Higher Order Categorical Logic, Cambridge University Press, Cambridge, 1986.Google Scholar
Landin, P., The mechanical evaluation of expressions. The Computer Journal, vol. 6 (1964), pp. 308–320.CrossRefGoogle Scholar
Luo, Z., Computation and Reasoning, Clarendon Press, Oxford, 1994.Google Scholar
Martin-Löf, P., About models for intuitionistic type theories and the notion of definitional equality, Proceedings of the Third Scandinavian Logic Symposium (Kanger, S., editor), North-Holland, Amsterdam, 1975, pp. 81–109.CrossRefGoogle Scholar
Martin-Löf, P., An intuitionistic theory of types: Predicative part, Logic Colloquium ’73 (Rose, H. E. and Shepherdson, J., editors), North-Holland, Amsterdam, 1975, pp. 73–118.Google Scholar
Martin-Löf, P., Constructive mathematics and computer programming, Logic, Methodology and Philosophy of Science, 1979 (Cohen, J. L., Łoś, J., Pfeiffer, H., and Podewski, K. P., editors), North-Holland, Amsterdam, 1982, pp. 153–175.Google Scholar
Martin-Löf, P., Intuitionistic Type Theory, Bibliopolis, Naples, 1984.Google Scholar
Nordström, B., Petersson, K., and Smith, J., Programming in Martin-Löf’s Type Theory, Oxford University Press, Oxford, 1990.Google Scholar
Martin-Löf, P., Martin-Löf’s type theory, Handbook of Logic in Computer Science. Volume 5: Logic and Algebraic Methods (Abramsky, S., Gabbay, D., and Maibaum, T., editors), Oxford University Press, Oxford, 2000, pp. 1–37.Google Scholar
Okada, M. and Scott, P. J., A note on rewriting theory for uniqueness of iteration. Theory and Applications of Categories, vol. 6 (1999), pp. 47–64.Google Scholar
Pfenning, F. and Davies, R., A judgemental reconstruction of modal logic. Mathematical Structures in Computer Science, vol. 11 (2001), pp. 511–540.CrossRefGoogle Scholar
Prawitz, D., Ideas and results in proof theory, Proceedings of the Second Scandinavian Logic Symposium (Fenstad, J. E., editor), North-Holland, Amsterdam, 1971, pp. 235–307.CrossRefGoogle Scholar
Schroeder-Heister, P., A natural extension of natural deduction. The Journal of Symbolic Logic, vol. 49 (1984), pp. 1284–1300.CrossRefGoogle Scholar
Simpson, A., Categorical completeness results for the simply-typed lambda-calculus, Typed Lambda Calculi and Applications (Dezani-Ciancaglini, M., editor), Springer, Berlin, 1995, pp. 414–427.CrossRefGoogle Scholar
Statman, R., λ-definable functionals and βη conversion. Archiv für mathematische Logik, vol. 23 (1983), pp. 21–26.CrossRefGoogle Scholar
Streicher, T., Investigations into intensional type theory, Habilitation thesis, Ludwig-Maximilian-University Munich, 1993.Google Scholar
Tait, W. W., Intensional interpretations of functionals of finite type I. The Journal of Symbolic Logic, vol. 32 (1967), pp. 198–212.CrossRefGoogle Scholar
Martin-Löf, P., Primitive recursive arithmetic and its role in the foundations of arithmetic: Historical and philosophical reflections, Epistemology versus Ontology. Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf (Dybjer, P., Lindström, S., Palmgren, E., and Sundholm, G., editors), Springer, Dordrecht, 2012, pp. 161–180.Google Scholar
The Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics, Institute for Advanced Study, Princeton, 2013. Available at http://homotopytypetheory.org/book.Google Scholar
Tranchini, L., Proof-theoretic harmony: Towards an intensional account. Synthese (2016), DOI: 10.1007/s11229-016-1200-3.CrossRefGoogle Scholar
Widebäck, F., Identity of Proofs, Almqvist & Wiksell, Stockholm, 2001.Google Scholar