{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:40:35Z","timestamp":1775774435751,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319108810","type":"print"},{"value":"9783319108827","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_26","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"442-459","source":"Crossref","is-referenced-by-count":5,"title":["Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Valiron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Zdancewic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. and Comp.\u00a0163, 409\u2013470 (2000)","journal-title":"Inf. and Comp."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Arrighi, P., D\u00edaz-Caro, A., Valiron, B.: A type system for the vectorial aspects of the linear-algebraic lambda-calculus. In: Proc. of DCM (2011)","DOI":"10.4204\/EPTCS.88.1"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-70590-1_2","volume-title":"Rewriting Techniques and Applications","author":"P. Arrighi","year":"2008","unstructured":"Arrighi, P., Dowek, G.: Linear-algebraic \u03bb-calculus: higher-order, encodings, and confluence. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 17\u201331. Springer, Heidelberg (2008)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Benton, N.: A mixed linear and non-linear logic: Proofs, terms and models. Technical report, Cambridge U (1994)","DOI":"10.1007\/BFb0022251"},{"key":"26_CR5","unstructured":"Bierman, G.: On Intuitionistic Linear Logic. PhD thesis, Cambridge U (1993)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.apal.2011.09.008","volume":"163","author":"A. Bucciarelli","year":"2012","unstructured":"Bucciarelli, A., Ehrhard, T., Manzonetto, G.: A relational semantics for parallelism and non-determinism in a functional setting. A. of Pure and App. Logic\u00a0163, 918\u2013934 (2012)","journal-title":"A. of Pure and App. Logic"},{"key":"26_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-58140-5_15","volume-title":"Logical Foundations of Computer Science","author":"P. Groote de","year":"1994","unstructured":"de Groote, P.: Strong normalization in a non-deterministic typed lambda-calculus. In: Nerode, A., Matiyasevich, Y.V. (eds.) Logical Foundations of Computer Science. LNCS, vol.\u00a0813, pp. 142\u2013152. Springer, Heidelberg (1994)"},{"key":"26_CR8","unstructured":"D\u00edaz-Caro, A.: Du Typage Vectoriel. PhD thesis, U. de Grenoble (2011)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1017\/S0960129504004645","volume":"15","author":"T. Ehrhard","year":"2005","unstructured":"Ehrhard, T.: Finiteness spaces. Math. Str. Comp. Sc.\u00a015, 615\u2013646 (2005)","journal-title":"Math. Str. Comp. Sc."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Pagani, M., Tasson, C.: The computational meaning of probabilistic coherence spaces. In: Proc. of LICS (2011)","DOI":"10.1109\/LICS.2011.29"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00392-X","volume":"309","author":"T. Ehrhard","year":"2003","unstructured":"Ehrhard, T., Regnier, L.: The differential lambda-calculus. Th. Comp. Sc.\u00a0309, 1\u201341 (2003)","journal-title":"Th. Comp. Sc."},{"key":"26_CR12","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. Th. Comp. Sc.\u00a050, 1\u2013101 (1987)","journal-title":"Th. Comp. Sc."},{"key":"26_CR13","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proof and Types. CUP (1990)"},{"key":"26_CR14","unstructured":"Hillebrand, G.G.: Finite Model Theory in the Simply Typed Lambda Calculus. PhD thesis, Brown University (1991)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(01)00241-9","volume":"294","author":"M. Hyland","year":"2003","unstructured":"Hyland, M., Schalk, A.: Glueing and orthogonality for models of linear logic. Th. Comp. Sc.\u00a0294, 183\u2013231 (2003)","journal-title":"Th. Comp. Sc."},{"key":"26_CR16","unstructured":"James, R.P., Ortiz, G., Sabry, A.: Quantum computing over finite fields. Draft (2011)"},{"key":"26_CR17","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher-Order Categorical Logic. CUP (1994)"},{"key":"26_CR18","unstructured":"Lang, S.: Algebra. Springer (2005)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Lidl, R.: Finite fields, vol.\u00a020. CUP (1997)","DOI":"10.1017\/CBO9780511525926"},{"key":"26_CR20","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer (1998)"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R.: Fully abstract models of typed lambda-calculi. Th. Comp. Sc.\u00a04, 1\u201322 (1977)","journal-title":"Th. Comp. Sc."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"Plotkin, G.: LCF considered as a programming language. Th. Comp. Sc.\u00a05, 223\u2013255 (1977)","journal-title":"Th. Comp. Sc."},{"key":"26_CR23","unstructured":"Pratt, V.R.: Re: Linear logic semantics (barwise). On the TYPES list (February 1992), http:\/\/www.seas.upenn.edu\/~sweirich\/types\/archive\/1992\/msg00047.html"},{"key":"26_CR24","unstructured":"Pratt, V.R.: Chu spaces: Complementarity and uncertainty in rational mechanics. Technical report, Stanford U (1994)"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-02261-6_5","volume-title":"Logic, Language, Information and Computation","author":"S. Salvati","year":"2009","unstructured":"Salvati, S.: Recognizability in the simply typed lambda-calculus. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol.\u00a05514, pp. 48\u201360. Springer, Heidelberg (2009)"},{"key":"26_CR26","unstructured":"Schumacher, B., Westmoreland, M.D.: Modal quantum theory. In: Proc. of QPL (2010)"},{"key":"26_CR27","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0304-3975(93)90095-B","volume":"121","author":"D.S. Scott","year":"1993","unstructured":"Scott, D.S.: A type-theoretic alternative to CUCH, ISWIM, OWHY. Th. Comp. Sc.\u00a0121, 411\u2013440 (1993)","journal-title":"Th. Comp. Sc."},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(02)00038-5","volume":"309","author":"P. Selinger","year":"2003","unstructured":"Selinger, P.: Order-incompleteness and finite lambda reduction models. Th. Comp. Sc.\u00a0309, 43\u201363 (2003)","journal-title":"Th. Comp. Sc."},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Soloviev, S.: Category of finite sets and cartesian closed categories. J. of Soviet Math.\u00a022(3) (1983)","DOI":"10.1007\/BF01084396"},{"key":"26_CR30","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1017\/S0960129512000205","volume":"23","author":"B. Valiron","year":"2013","unstructured":"Valiron, B.: A typed, algebraic, computational lambda-calculus. Math. Str. Comp. Sc.\u00a023, 504\u2013554 (2013)","journal-title":"Math. Str. Comp. Sc."},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1017\/S0960129509990089","volume":"19","author":"L. Vaux","year":"2009","unstructured":"Vaux, L.: The algebraic lambda-calculus. Math. Str. Comp. Sc.\u00a019, 1029\u20131059 (2009)","journal-title":"Math. Str. Comp. Sc."},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages. MIT Press (1993)","DOI":"10.7551\/mitpress\/3054.001.0001"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T08:26:11Z","timestamp":1598257571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}