{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:57:32Z","timestamp":1754488652530},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389450"},{"type":"electronic","value":"9783642389467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38946-7_12","type":"book-chapter","created":{"date-parts":[[2013,5,27]],"date-time":"2013-05-27T01:30:38Z","timestamp":1369618238000},"page":"140-155","source":"Crossref","is-referenced-by-count":3,"title":["A Type-Checking Algorithm for Martin-L\u00f6f Type Theory with Subtyping Based on Normalisation by Evaluation"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Fridlender","sequence":"first","affiliation":[]},{"given":"Miguel","family":"Pagano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-70594-9_4","volume-title":"Mathematics of Program Construction","author":"A. Abel","year":"2008","unstructured":"Abel, A., Coquand, T., Dybjer, P.: Verifying a semantic \u03b2\u03b7-conversion test for Martin-L\u00f6f type theory. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 29\u201356. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"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\u00a07(2) (2011)","key":"12_CR2","DOI":"10.2168\/LMCS-7(2:4)2011"},{"doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science, pp. 1\u2013168. Oxford University Press (1994)","key":"12_CR3","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S0956796805005770","volume":"16","author":"R. Adams","year":"2006","unstructured":"Adams, R.: Pure type systems with judgemental equality. Journal of Functional Programming\u00a016(2), 219\u2013246 (2006)","journal-title":"Journal of Functional Programming"},{"issue":"1-2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(00)00175-4","volume":"266","author":"D. Aspinall","year":"2001","unstructured":"Aspinall, D., Compagnoni, A.B.: Subtyping dependent types. Theor. Comput. Sci.\u00a0266(1-2), 273\u2013309 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR6","series-title":"Oxford Logic Guides","first-page":"20","volume-title":"Extension of Martin-L\u00f6f type theory with record types and subtyping","author":"G. Betarte","year":"1998","unstructured":"Betarte, G., Tasistro, A.: Extension of Martin-L\u00f6f type theory with record types and subtyping. Oxford Logic Guides, pp. 20\u201342. Oxford University Press, USA (1998)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0167-6423(95)00021-6","volume":"26","author":"T. Coquand","year":"1996","unstructured":"Coquand, T.: An algorithm for type-checking dependent types. Science of Computer Programming\u00a026, 167\u2013177 (1996)","journal-title":"Science of Computer Programming"},{"issue":"1-2","key":"12_CR8","first-page":"113","volume":"65","author":"T. Coquand","year":"2005","unstructured":"Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. Fundamenta Informatic\u00e6\u00a065(1-2), 113\u2013134 (2005)","journal-title":"Fundamenta Informatic\u00e6"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.2307\/2586554","volume":"65","author":"P. Dybjer","year":"2000","unstructured":"Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic\u00a065 (2000)","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/571157.571161","volume-title":"Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2002","author":"M. Fiore","year":"2002","unstructured":"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\u201337. ACM, New York (2002)"},{"doi-asserted-by":"crossref","unstructured":"Luo, Z.: Computation and reasoning: a type theory for computer science. International series of monographs on computer science. Clarendon Press (1994)","key":"12_CR11","DOI":"10.1093\/oso\/9780198538356.001.0001"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ic.2012.10.020","volume":"223","author":"Z. Luo","year":"2013","unstructured":"Luo, Z., Soloviev, S., Xue, T.: Coercive subtyping: Theory and implementation. Inf. Comput.\u00a0223, 18\u201342 (2013)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: An Intuitonistic Theory of Types: Predicative Part. In: Logic colloquium 1973: Proceedings of the Logic Colloquium, Bristol, pp. 73\u2013118 (1975)","key":"12_CR13","DOI":"10.1016\/S0049-237X(08)71945-1"},{"unstructured":"Scherer, G.: Universe subtyping in Martin-L\u00f6f type theory. Technical report, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen (2011)","key":"12_CR14"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1017\/S0956796812000044","volume":"22","author":"V. Siles","year":"2012","unstructured":"Siles, V., Herbelin, H.: Pure type system conversion is always typable. J. Funct. Program.\u00a022(2), 153\u2013180 (2012)","journal-title":"J. Funct. Program."},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1145\/1183278.1183281","volume":"7","author":"C.A. Stone","year":"2006","unstructured":"Stone, C.A., Harper, R.: Extensional equivalence and singleton types. ACM Trans. Comput. Logic\u00a07(4), 676\u2013722 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-48959-2_27","volume-title":"Typed Lambda Calculi and Applications","author":"J. Zwanenburg","year":"1999","unstructured":"Zwanenburg, J.: Pure type systems with subtyping. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 381\u2013396. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38946-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T05:50:21Z","timestamp":1715406621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38946-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389450","9783642389467"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38946-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}