{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T11:26:06Z","timestamp":1744111566354},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255932"},{"type":"electronic","value":"9783540320142"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11417170_4","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T19:29:35Z","timestamp":1292527775000},"page":"23-38","source":"Crossref","is-referenced-by-count":4,"title":["Untyped Algorithmic Equality for Martin-L\u00f6f\u2019s Logical Framework with Surjective Pairs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Abel","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Coquand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abel, A., Coquand, T.: Untyped algorithmic equality for Martin-L\u00f6f\u2019s logical framework with surjective pairs (extended version). Tech. rep., Department of Computer Science, Chalmers, G\u00f6teborg, Sweden (2005)","DOI":"10.1007\/11417170_4"},{"key":"4_CR2","unstructured":"Adams, R.: Decidable equality in a logical framework with sigma kinds, Unpublished note, see (2001), http:\/\/www.cs.man.ac.uk\/~radams\/"},{"key":"4_CR3","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam (1984)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/CBO9780511569807.011","volume-title":"Logical Frameworks","author":"T. Coquand","year":"1991","unstructured":"Coquand, T.: An algorithm for testing conversion in type theory. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 255\u2013279. Cambridge University Press, Cambridge (1991)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Coquand, T.: An algorithm for type-checking dependent types. In: M\u00f6ller, B. (ed.) MPC 1995. LNCS, vol.\u00a0947, pp. 167\u2013177. Springer, Heidelberg (1996)","DOI":"10.1016\/0167-6423(95)00021-6"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-44904-3_8","volume-title":"Typed Lambda Calculi and Applications","author":"T. Coquand","year":"2003","unstructured":"Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 105\u2013119. Springer, Heidelberg (2003)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-48959-2_14","volume-title":"Typed Lambda Calculi and Applications","author":"H. Goguen","year":"1999","unstructured":"Goguen, H.: Soundness of the logical framework for its typed operational semantics. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 177\u2013197. Springer, Heidelberg (1999)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Goguen, H.: Justifying algorithms for \u03b2\u03b7 conversion. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 410\u2013424. Springer, Heidelberg (2005) (To appear)","DOI":"10.1007\/978-3-540-31982-5_26"},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A Framework for Defining Logics. Journal of the Association of Computing Machinery\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the Association of Computing Machinery"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1042038.1042041","volume":"6","author":"R. Harper","year":"2005","unstructured":"Harper, R., Pfenning, F.: On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic\u00a06(1), 61\u2013101 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"4_CR11","unstructured":"Klop, J.W.: Combinatory reducion systems. Mathematical Center Tracts\u00a027 (1980)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Nordstr\u00f6m, B., Petersson, K., Smith, J.: Martin-l\u00f6f\u2019s type theory. In: Handbook of Logic in Computer Science, 5th edn. Oxford University Press, Oxford (2000)","DOI":"10.1093\/oso\/9780198537816.003.0004"},{"key":"4_CR13","unstructured":"Sarnat, J.: LF\u03a3: The metatheory of LF with \u03a3 types. Unpublished technical report, kindly provided by Carsten Sch\u00fcrmann (2004)"},{"key":"4_CR14","unstructured":"Vaux, L.: A type system with implicit types, English version of his m\u00e9moire de ma\u00eetrise (2004)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Vanderwaart, J.C., Crary, K.: A simplified account of the metatheory of Linear LF. Tech. rep., Dept. of Comp. Sci., Carnegie Mellon (2002)","DOI":"10.1016\/S1571-0661(04)80503-6"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-30124-0_32","volume-title":"Computer Science Logic","author":"J. Vouillon","year":"2004","unstructured":"Vouillon, J.: Subtyping union types. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 415\u2013429. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11417170_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T18:46:57Z","timestamp":1637002017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11417170_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255932","9783540320142"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11417170_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}