{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:02Z","timestamp":1725536822288},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_40","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"464-476","source":"Crossref","is-referenced-by-count":9,"title":["The Prismoid of Resources"],"prefix":"10.1007","author":[{"given":"Delia","family":"Kesner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Renaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"4","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Curien, P.L., L\u00e9vy, J.-J.: Explicit substitutions. Journal of Functional Programming\u00a04(1), 375\u2013416 (1991)","journal-title":"Journal of Functional Programming"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Accattoli, B., Guerrini, S.: Jumping Boxes. Representing lambda-calculus boxes by jumps. To appear in Proceedings of CSL (2009)","DOI":"10.1007\/978-3-642-04027-6_7"},{"key":"40_CR3","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. North-Holland, Amsterdam (1984)"},{"key":"40_CR4","unstructured":"Bloo, R.: Preservation of Termination for Explicit Substitution. PhD thesis, Eindhoven University of Technology (1997)"},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050(1), 1\u2013101 (1987)","journal-title":"Theoretical Computer Science"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"F. Kamareddine","year":"1995","unstructured":"Kamareddine, F., R\u00edos, A.: A \u03bb-calculus \u00e0 la de Bruijn with explicit substitutions. In: Swierstra, S.D. (ed.) PLILP 1995. LNCS, vol.\u00a0982. Springer, Heidelberg (1995)"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-74915-8_20","volume-title":"Computer Science Logic","author":"D. Kesner","year":"2007","unstructured":"Kesner, D.: The theory of calculi with explicit substitutions revisited. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 238\u2013252. Springer, Heidelberg (2007)"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-70583-3_26","volume-title":"Automata, Languages and Programming","author":"D. Kesner","year":"2008","unstructured":"Kesner, D.: Perpetuality for full and safe composition (in a constructive setting). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 311\u2013322. Springer, Heidelberg (2008)"},{"issue":"4","key":"40_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ic.2006.08.008","volume":"205","author":"D. Kesner","year":"2007","unstructured":"Kesner, D., Lengrand, S.: Resource operators for lambda-calculus. Information and Computation\u00a0205(4), 419\u2013473 (2007)","journal-title":"Information and Computation"},{"key":"40_CR10","unstructured":"Khasidashvili, Z.: Expression reduction systems. In: Proceedings of IN Vekua Institute of Applied Mathematics, vol.\u00a036, Tbilisi (1990)"},{"key":"40_CR11","unstructured":"Klop, J.-W.: Combinatory Reduction Systems. Mathematical Centre Tracts, vol.\u00a0127. PhD Thesis. Mathematisch Centrum, Amsterdam (1980)"},{"key":"40_CR12","unstructured":"Lengrand, S.: Normalisation and Equivalence in Proof Theory and Type Theory. PhD thesis, University Paris 7 and University of St Andrews (November 2006)"},{"key":"40_CR13","unstructured":"Lescanne, P., Rouyer-Degli, J.: The calculus of explicit substitutions \u03bb\u03bd. Technical report, INRIA, Lorraine (1994)"},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014062","volume-title":"Typed Lambda Calculi and Applications","author":"P.-A. Melli\u00e8s","year":"1995","unstructured":"Melli\u00e8s, P.-A.: Typed \u0142-calculi with explicit substitutions may not terminate. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902. Springer, Heidelberg (1995)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Nipkow, T.: Higher-order critical pairs. In: 6th Annual IEEE Symposium on Logic in Computer Science (LICS) (1991)","DOI":"10.1109\/LICS.1991.151658"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Milner, R.: Local bigraphs and confluence: two conjectures. In: EXPRESS. ENTCS, vol.\u00a0175 (2006)","DOI":"10.1016\/j.entcs.2006.07.035"},{"key":"40_CR17","unstructured":"Renaud, F.: Preservation of strong normalisation for lambda-s (2008), http:\/\/www.pps.jussieu.fr\/~renaud"},{"key":"40_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Science Logic","author":"F.-R. Sinot","year":"2003","unstructured":"Sinot, F.-R., Fern\u00e1ndez, M., Mackie, I.: Efficient reductions with director strings. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803. Springer, Heidelberg (2003)"},{"key":"40_CR19","unstructured":"van Oostrom, V.: Net-calculus. Course Notes (2001), http:\/\/www.phil.uu.nl\/~oostrom\/cmitt\/00-01\/net.ps"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:34:05Z","timestamp":1558478045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}