{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:50:41Z","timestamp":1754488241862,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544334"},{"type":"electronic","value":"9783662544341"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54434-1_20","type":"book-chapter","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:20:06Z","timestamp":1489810806000},"page":"530-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["LINCX: A Linear Logical Framework with First-Class Contexts"],"prefix":"10.1007","author":[{"given":"Aina Linn","family":"Georges","sequence":"first","affiliation":[]},{"given":"Agata","family":"Murawska","sequence":"additional","affiliation":[]},{"given":"Shawn","family":"Otis","sequence":"additional","affiliation":[]},{"given":"Brigitte","family":"Pientka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-03545-1_16","volume-title":"Certified Programs and Proofs","author":"O Savary-Belanger","year":"2013","unstructured":"Savary-Belanger, O., Monnier, S., Pientka, B.: Programming type-safe transformations using higher-order abstract syntax. In: Gonthier, G., Norrish, M. (eds.) CPP 2013. LNCS, vol. 8307, pp. 243\u2013258. Springer, Cham (2013). doi:10.1007\/978-3-319-03545-1_16"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-32347-8_21","volume-title":"Interactive Theorem Proving","author":"J Bengtson","year":"2012","unstructured":"Bengtson, J., Jensen, J.B., Birkedal, L.: Charge! - A framework for higher-order separation logic in Coq. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 315\u2013331. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32347-8_21"},{"issue":"2\u20133","key":"20_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1020891112409","volume":"15","author":"J Berdine","year":"2002","unstructured":"Berdine, J., O\u2019Hearn, P.W., Reddy, U.S., Thielecke, H.: Linear continuation-passing. High.-Order Symbolic Comput. 15(2\u20133), 181\u2013208 (2002)","journal-title":"High.-Order Symbolic Comput."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-662-48899-7_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"PB Bock","year":"2015","unstructured":"Bock, P.B., Sch\u00fcrmann, C.: A contextual logical framework. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 402\u2013417. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48899-7_28"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-15375-4_16","volume-title":"CONCUR 2010 - Concurrency Theory","author":"L Caires","year":"2010","unstructured":"Caires, L., Pfenning, F.: Session types as intuitionistic linear propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222\u2013236. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15375-4_16"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Cave, A., Pientka, B.: Programming with binders and indexed data-types. In: 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012), pp. 413\u2013424. ACM (2012)","DOI":"10.1145\/2103621.2103705"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Cave, A., Pientka, B.: First-class substitutions in contextual type theory. In: 8th ACM SIGPLAN International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2013), pp. 15\u201324. ACM (2013)","DOI":"10.1145\/2503887.2503889"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Cave, A., Pientka, B.: A case study on logical relations using contextual types. In: Cervesato, I., Chaudhuri, K. (eds.) 10th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2015), pp. 18\u201333. Electronic Proceedings in Theoretical Computer Science (EPTCS) (2015)","DOI":"10.4204\/EPTCS.185.3"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/LICS.1996.561339","volume-title":"11th Annual Symposium on Logic in Computer Science","author":"I Cervesato","year":"1996","unstructured":"Cervesato, I., Pfenning, F.: A linear logical framework. In: Clarke, E. (ed.) 11th Annual Symposium on Logic in Computer Science, pp. 264\u2013275. IEEE Press, New Brunswick (1996)"},{"issue":"5","key":"20_CR10","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1093\/logcom\/13.5.639","volume":"13","author":"I Cervesato","year":"2003","unstructured":"Cervesato, I., Pfenning, F.: A linear spine calculus. J. Logic Comput. 13(5), 639\u2013688 (2003)","journal-title":"J. Logic Comput."},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing control: a study of the CPS transformation. Math. Struct. Comput. Sci. 2(4), 361\u2013391 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/11693024_2","volume-title":"Programming Languages and Systems","author":"M Fluet","year":"2006","unstructured":"Fluet, M., Morrisett, G., Ahmed, A.: Linear regions are all you need. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 7\u201321. Springer, Heidelberg (2006). doi:10.1007\/11693024_2"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10817-011-9218-1","volume":"49","author":"A Gacek","year":"2012","unstructured":"Gacek, A., Miller, D., Nadathur, G.: A two-level logic approach to reasoning about computations. J. Autom. Reason. 49(2), 241\u2013273 (2012)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","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. J. ACM 40(1), 143\u2013184 (1993)","journal-title":"J. ACM"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Martens, C., Crary, K.: LF in LF: mechanizing the metatheories of LF in Twelf. In: 7th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2012), pp. 23\u201332. ACM (2012)","DOI":"10.1145\/2364406.2364410"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-03359-9_24","volume-title":"Theorem Proving in Higher Order Logics","author":"A McCreight","year":"2009","unstructured":"McCreight, A.: Practical tactics for separation logic. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 343\u2013358. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03359-9_24"},{"key":"20_CR17","unstructured":"McCreight, A., Sch\u00fcrmann, C.: A meta-linear logical framework. In: 4th International Workshop on Logical Frameworks and Meta-Languages (LFM 2004) (2004)"},{"key":"20_CR18","unstructured":"McDowell, R.: Reasoning in a logic with definitions and induction. Ph.D. thesis, University of Pennsylvania (1997)"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/504077.504080","volume":"3","author":"RC McDowell","year":"2002","unstructured":"McDowell, R.C., Miller, D.A.: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Logic 3(1), 80\u2013136 (2002)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"3","key":"20_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1352582.1352591","volume":"9","author":"A Nanevski","year":"2008","unstructured":"Nanevski, A., Pfenning, F., Pientka, B.: Contextual modal type theory. ACM Trans. Comput. Logic 9(3), 1\u201349 (2008)","journal-title":"ACM Trans. Comput. Logic"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Pientka, B.: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In: 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2008), pp. 371\u2013382. ACM (2008)","DOI":"10.1145\/1328897.1328483"},{"key":"20_CR22","unstructured":"Pientka, B., Abel, A.: Structural recursion over contextual objects. In: Altenkirch, T. (ed.) 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015), pp. 273\u2013287. Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl (2015)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-21401-6_18","volume-title":"Automated Deduction \u2013 CADE-25","author":"B Pientka","year":"2015","unstructured":"Pientka, B., Cave, A.: Inductive beluga: programming proofs (system description). In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 272\u2013281. Springer, Cham (2015). doi:10.1007\/978-3-319-21401-6_18"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-14203-1_2","volume-title":"Automated Reasoning","author":"B Pientka","year":"2010","unstructured":"Pientka, B., Dunfield, J.: Beluga: a framework for programming and reasoning with deductive systems (system description). In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS (LNAI), vol. 6173, pp. 15\u201321. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14203-1_2"},{"key":"20_CR25","unstructured":"Reed, J.: A hybrid logical framework. Ph.D. thesis, Carnegie Mellon (2009)"},{"key":"20_CR26","unstructured":"Schack-Nielsen, A.: Implementing substructural logical frameworks. Ph.D. thesis, IT University of Copenhagen (2011)"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Schack-Nielsen, A., Sch\u00fcrmann, C.: Pattern unification for the lambda calculus with linear and affine types. In: Crary, K., Miculan, M. (eds.) International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2010). Electronic Proceedings in Theoretical Computer Science (EPTCS), vol. 34, pp. 101\u2013116, July 2010","DOI":"10.4204\/EPTCS.34.9"},{"key":"20_CR28","unstructured":"Sch\u00fcrmann, C.: Automating the meta theory of deductive systems. Ph.D. thesis, Department of Computer Science, Carnegie Mellon University, CMU-CS-00-146 (2000)"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Thibodeau, D., Cave, A., Pientka, B.: Indexed codata. In: Garrigue, J., Keller, G., Sumii, E. (eds.) 21st ACM SIGPLAN International Conference on Functional Programming (ICFP 2016), pp. 351\u2013363. ACM (2016)","DOI":"10.1145\/2951913.2951929"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Walker, D., Watkins, K.: On regions and linear types. In: Pierce, B.C. (ed.) 6th ACM SIGPLAN International Conference on Functional Programming (ICFP 2001), pp. 181\u2013192. ACM (2001)","DOI":"10.1145\/507669.507658"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework I: judgments and properties. Technical report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University (2002)","DOI":"10.21236\/ADA418517"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54434-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T18:06:20Z","timestamp":1692727580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54434-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544334","9783662544341"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54434-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2017a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}