暂无分享,去创建一个
[1] Amr Sabry,et al. Quantum Computing over Finite Fields , 2011, 1101.3764.
[2] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..
[3] Nick Benton,et al. A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract) , 1994, CSL.
[4] Harald Niederreiter,et al. Finite fields: Author Index , 1996 .
[5] Thomas Ehrhard,et al. The Computational Meaning of Probabilistic Coherence Spaces , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[6] Philippe de Groote,et al. Strong Normalization in a Non-Deterministic Typed Lambda-Calculus , 1994, LFCS.
[7] Alejandro Diaz Caro,et al. Du typage vectoriel , 2011 .
[8] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .
[9] Sylvain Salvati. Recognizability in the Simply Typed Lambda-Calculus , 2009, WoLLIC.
[10] Gerd G. Hillebrand. Finite model theory in the simply typed lambda calculus , 1994 .
[11] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[12] Benoît Valiron,et al. A typed, algebraic, computational lambda-calculus† , 2013, Mathematical Structures in Computer Science.
[13] Benjamin Schumacher,et al. Modal Quantum Theory , 2010, 1204.0701.
[14] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..
[15] R. Tennant. Algebra , 1941, Nature.
[16] Vaughan R. Pratt,et al. Chu spaces: Complementarity and Uncertainty in Rational Mechanics , 2004 .
[17] Radha Jagadeesan,et al. Full Abstraction for PCF , 2000, Inf. Comput..
[18] S. Solov′ev. The category of finite sets and Cartesian closed categories , 1983 .
[19] G. Winskel. The formal semantics of programming languages , 1993 .
[20] Peter Selinger. Order-incompleteness and finite lambda reduction models , 2003, Theor. Comput. Sci..
[21] Gilles Dowek,et al. Linear-algebraic lambda-calculus: higher-order, encodings, and confluence , 2008, RTA.
[22] Antonio Bucciarelli,et al. A relational semantics for parallelism and non-determinism in a functional setting , 2012, Ann. Pure Appl. Log..
[23] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[24] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[25] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..
[26] Alejandro D'iaz-Caro,et al. A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus , 2010 .
[27] Martin Hyland,et al. Glueing and orthogonality for models of linear logic , 2003, Theor. Comput. Sci..
[28] Laurent Regnier,et al. The differential lambda-calculus , 2003, Theor. Comput. Sci..
[29] Lionel Vaux. The algebraic lambda calculus , 2009, Math. Struct. Comput. Sci..
[30] Thomas Ehrhard,et al. Finiteness spaces , 2005, Mathematical Structures in Computer Science.
[31] S. Lane. Categories for the Working Mathematician , 1971 .
[32] Paul Curzon,et al. On Intuitionistic Linear Logic , 2005 .