{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:28Z","timestamp":1725562588520},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221647"},{"type":"electronic","value":"9783540248491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24849-1_1","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T20:34:24Z","timestamp":1281299664000},"page":"1-16","source":"Crossref","is-referenced-by-count":9,"title":["A Modular Hierarchy of Logical Frameworks"],"prefix":"10.1007","author":[{"given":"Robin","family":"Adams","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Pientka, B., Pfenning, F.: Optimizing higher-order pattern unification (2003)","DOI":"10.1007\/978-3-540-45085-6_40"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-39185-1_10","volume-title":"Types for Proofs and Programs","author":"G.I. Jojgov","year":"2003","unstructured":"Jojgov, G.I.: Holes with binding power. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol.\u00a02646, pp. 162\u2013181. Springer, Heidelberg (2003)"},{"key":"1_CR3","first-page":"194","volume-title":"Proceedings 2nd Annual IEEE Symp. on Logic in Computer Science, LICS 1987","author":"R. Harper","year":"1987","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. In: Proceedings 2nd Annual IEEE Symp. on Logic in Computer Science, LICS 1987, Ithaca, NY, USA, June 22-25, pp. 194\u2013204. IEEE Computer Society Press, New York (1987)"},{"key":"1_CR4","volume-title":"Programming in Martin-L\u00f6f\u2019s Type Theory: an Introduction","author":"B. Nordstr\u00f6m","year":"1990","unstructured":"Nordstr\u00f6m, B., Petersson, K., Smith, J.: Programming in Martin-L\u00f6f\u2019s Type Theory: an Introduction. Oxford University Press, Oxford (1990)"},{"key":"1_CR5","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Selected Papers on AUTOMATH","year":"1994","unstructured":"Nederpelt, R.P., Geuvers, J.H., Vrijer, R.C.D. (eds.): Selected Papers on AUTOMATH. Studies in Logic and the Foundations of Mathematics, vol.\u00a0133. North-Holland, Amsterdam (1994)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.W. Klop","year":"1993","unstructured":"Klop, J.W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems:introduction and survey. Theoretical Computer Science\u00a0121, 279\u2013308 (1993)","journal-title":"Theoretical Computer Science"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-62688-3_35","volume-title":"Typed Lambda Calculi and Applications","author":"N. Ghani","year":"1997","unstructured":"Ghani, N.: Eta-expansions in dependent type theory \u2014 the calculus of constructions. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol.\u00a01210, pp. 164\u2013180. Springer, Heidelberg (1997)"},{"key":"1_CR8","series-title":"International Series of Monographs on Computer Science","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538356.001.0001","volume-title":"Computation and Reasoning: A Type Theory for Computer Science","author":"Z. Luo","year":"1994","unstructured":"Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. International Series of Monographs on Computer Science, vol.\u00a011. Oxford University Press, Oxford (1994)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1017\/S0956796802004525","volume":"13","author":"Z. Luo","year":"2003","unstructured":"Luo, Z.: PAL+: a lambda-free logical framework. Journal of Functional Programming\u00a013, 317\u2013338 (2003)","journal-title":"Journal of Functional Programming"},{"key":"1_CR10","unstructured":"Levin, M.Y., Pierce, B.C.: Tinkertype: A language for playing with formal systems. Technical report (2000)"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24849-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T05:58:20Z","timestamp":1711691900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24849-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221647","9783540248491"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24849-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}