Abstract
We present a core Martin-Löf type theory with subtyping; it has a cumulative hierarchy of universes and the contravariant rule for subtyping between dependent product types. We extend to this calculus the normalisation by evaluation technique defined for a variant of MLTT without subtyping. This normalisation function makes the subtyping relation and type-checking decidable. To our knowledge, this is the first time that the normalisation by evaluation technique has been considered in the context of subtypes, which introduce some subtleties in the proof of correctness of NbE; an important result to prove correctness and completeness of type-checking.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abel, A., Coquand, T., Dybjer, P.: Verifying a semantic βη-conversion test for Martin-Löf type theory. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 29–56. Springer, Heidelberg (2008)
Abel, A., Coquand, T., Pagano, M.: A modular type-checking algorithm for type theory with singleton types and proof irrelevance. Logical Methods in Computer Science 7(2) (2011)
Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science, pp. 1–168. Oxford University Press (1994)
Adams, R.: Pure type systems with judgemental equality. Journal of Functional Programming 16(2), 219–246 (2006)
Aspinall, D., Compagnoni, A.B.: Subtyping dependent types. Theor. Comput. Sci. 266(1-2), 273–309 (2001)
Betarte, G., Tasistro, A.: Extension of Martin-Löf type theory with record types and subtyping. Oxford Logic Guides, pp. 20–42. Oxford University Press, USA (1998)
Coquand, T.: An algorithm for type-checking dependent types. Science of Computer Programming 26, 167–177 (1996)
Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. Fundamenta Informaticæ 65(1-2), 113–134 (2005)
Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic 65 (2000)
Fiore, M.: Semantic analysis of normalisation by evaluation for typed lambda calculus. In: Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2002, pp. 26–37. ACM, New York (2002)
Luo, Z.: Computation and reasoning: a type theory for computer science. International series of monographs on computer science. Clarendon Press (1994)
Luo, Z., Soloviev, S., Xue, T.: Coercive subtyping: Theory and implementation. Inf. Comput. 223, 18–42 (2013)
Martin-Löf, P.: An Intuitonistic Theory of Types: Predicative Part. In: Logic colloquium 1973: Proceedings of the Logic Colloquium, Bristol, pp. 73–118 (1975)
Scherer, G.: Universe subtyping in Martin-Löf type theory. Technical report, Ludwig-Maximilians-Universität München (2011)
Siles, V., Herbelin, H.: Pure type system conversion is always typable. J. Funct. Program. 22(2), 153–180 (2012)
Stone, C.A., Harper, R.: Extensional equivalence and singleton types. ACM Trans. Comput. Logic 7(4), 676–722 (2006)
Zwanenburg, J.: Pure type systems with subtyping. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 381–396. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fridlender, D., Pagano, M. (2013). A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation. In: Hasegawa, M. (eds) Typed Lambda Calculi and Applications. TLCA 2013. Lecture Notes in Computer Science, vol 7941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38946-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-38946-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38945-0
Online ISBN: 978-3-642-38946-7
eBook Packages: Computer ScienceComputer Science (R0)