{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T17:27:41Z","timestamp":1760549261691,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642313646"},{"type":"electronic","value":"9783642313653"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31365-3_43","type":"book-chapter","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T20:35:34Z","timestamp":1340310934000},"page":"544-558","source":"Crossref","is-referenced-by-count":3,"title":["Stratification in Logics of Definitions"],"prefix":"10.1007","author":[{"given":"Alwen","family":"Tiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2071368.2071370","volume":"13","author":"D. Baelde","year":"2012","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Log.\u00a013(1), 2 (2012)","journal-title":"ACM Trans. Comput. Log."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Baelde, D., Nadathur, G.: Combining deduction modulo and logics of fixed point definitions. Accepted to LICS 2012 (2012)","DOI":"10.1109\/LICS.2012.22"},{"issue":"4","key":"43_CR3","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.2178\/jsl\/1067620188","volume":"68","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Werner, B.: Proof normalization modulo. Journal of Symbolic Logic\u00a068(4), 1289\u20131316 (2003)","journal-title":"Journal of Symbolic Logic"},{"key":"43_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0013605","volume-title":"Extensions of Logic Programming","author":"L.-H. Eriksson","year":"1992","unstructured":"Eriksson, L.-H.: A Finitary Version of the Calculus of Partial Inductive Definitions. In: Eriksson, L.-H., Halln\u00e4s, L., Schroeder-Heister, P. (eds.) ELP 1991. LNCS (LNAI), vol.\u00a0596, pp. 89\u2013134. Springer, Heidelberg (1992)"},{"key":"43_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-71070-7_13","volume-title":"Automated Reasoning","author":"A. Gacek","year":"2008","unstructured":"Gacek, A.: The Abella Interactive Theorem Prover (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 154\u2013161. Springer, Heidelberg (2008)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Gacek, A., Miller, D., Nadathur, G.: Combining generic judgments with recursive definitions. In: LICS, pp. 33\u201344. IEEE Computer Society (2008)","DOI":"10.1109\/LICS.2008.33"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.entcs.2008.12.118","volume":"228","author":"A. Gacek","year":"2009","unstructured":"Gacek, A., Miller, D., Nadathur, G.: Reasoning in Abella about structural operational semantics specifications. Electr. Notes Theor. Comput. Sci.\u00a0228, 85\u2013100 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"43_CR8","unstructured":"Girard, J.-Y., Taylor, P., Lafont, Y.: Proofs and Types. Cambridge University Press (1989)"},{"issue":"1","key":"43_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0304-3975(06)80007-1","volume":"87","author":"L. Halln\u00e4s","year":"1991","unstructured":"Halln\u00e4s, L.: Partial inductive definitions. Theor. Comput. Sci.\u00a087(1), 115\u2013142 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"Huet, G.: A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science\u00a01, 27\u201357 (1975)","journal-title":"Theoretical Computer Science"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Proc. of the Second Scandinavian Logic Symposium. Studies in Logic and the Foundations of Mathematics, vol.\u00a063, pp. 179\u2013216. North-Holland (1971)","DOI":"10.1016\/S0049-237X(08)70847-4"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(99)00171-1","volume":"232","author":"R. McDowell","year":"2000","unstructured":"McDowell, R., Miller, D.: Cut-elimination for a logic with definitions and induction. Theoretical Computer Science\u00a0232, 91\u2013119 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/504077.504080","volume":"3","author":"R. McDowell","year":"2002","unstructured":"McDowell, R., Miller, D.: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Log.\u00a03(1), 80\u2013136 (2002)","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"43_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation\u00a01(4), 497\u2013536 (1991)","journal-title":"J. Logic and Computation"},{"issue":"1","key":"43_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S1571-0661(04)00279-8","volume":"58","author":"D. Miller","year":"2001","unstructured":"Miller, D.: Encoding generic judgments: Preliminary results. Electr. Notes Theor. Comput. Sci.\u00a058(1), 59\u201378 (2001)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"4","key":"43_CR16","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1094622.1094628","volume":"6","author":"D. Miller","year":"2005","unstructured":"Miller, D., Tiu, A.: A proof theory for generic judgments. ACM Trans. Comput. Logic\u00a06(4), 749\u2013783 (2005)","journal-title":"ACM Trans. Comput. Logic"},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-24849-1_19","volume-title":"Types for Proofs and Programs","author":"A. Momigliano","year":"2004","unstructured":"Momigliano, A., Tiu, A.: Induction and Co-induction in Sequent Calculus. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 293\u2013308. Springer, Heidelberg (2004)"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Nipkow, T.: Functional unification of higher-order patterns. In: Vardi, M. (ed.) LICS 1993, pp. 64\u201374. IEEE (June 1993)","DOI":"10.1109\/LICS.1993.287599"},{"key":"43_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11591191_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"E. Pimentel","year":"2005","unstructured":"Pimentel, E., Miller, D.: On the Specification of Sequent Systems. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 352\u2013366. Springer, Heidelberg (2005)"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Schroeder-Heister, P.: Rules of definitional reflection. In: Vardi, M. (ed.) LICS, pp. 222\u2013232. IEEE Computer Society Press, IEEE (June 1993)","DOI":"10.1109\/LICS.1993.287585"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Sch\u00fctte, K.: Proof theory. In: Grundlehren der mathematischen Wissenschaften, Springer (1977)","DOI":"10.1007\/978-3-642-66473-1"},{"issue":"2","key":"43_CR22","doi-asserted-by":"publisher","first-page":"198","DOI":"10.2307\/2271658","volume":"32","author":"W.W. Tait","year":"1967","unstructured":"Tait, W.W.: Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic\u00a032(2), 198\u2013212 (1967)","journal-title":"Journal of Symbolic Logic"},{"key":"43_CR23","unstructured":"Tiu, A.: A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University (May 2004)"},{"key":"43_CR24","unstructured":"Tiu, A., Momigliano, A.: Cut elimination for a logic with induction and co-induction. CoRR, abs\/1009.6171 (2010)"},{"key":"43_CR25","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press (1996)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31365-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T10:16:23Z","timestamp":1743588983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31365-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642313646","9783642313653"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31365-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}