A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n))
暂无分享,去创建一个
[1] Sven Skyum,et al. The Complexity of Computing the k-ary Composition of a Binary Associative Operator , 1996 .
[2] Jaikumar Radhakrishnan,et al. The Randomized Complexity of Maintaining the Minimum , 1996, Nord. J. Comput..
[3] Stefan Dziembowski,et al. The Fixpoint Bounded-Variable Queries are PSPACE-Complete , 1996 .
[4] Anna Ingólfsdóttir. Weak Semantics Based on Lighted Button Pressing Experiments. An Alternative Characterization of the Readiness Semantics , 1996 .
[5] S. Solov′ev. The category of finite sets and Cartesian closed categories , 1983 .
[6] Ivan Damgård,et al. Statistical Secrecy and Multi-Bit Commitments , 1996 .
[7] Nick Benton,et al. A Term Calculus for Intuitionistic Linear Logic , 1993, TLCA.
[8] Jean-Yves Girard,et al. Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.
[9] Mikael Rittri. Retrieving Library Functions by Unifying Types Modulo Linear Isomorphism , 1993, RAIRO Theor. Informatics Appl..
[10] Sergei Soloviev. A Complete Axiom System for Isomorphism of Types in Closed Categories , 1993, LPAR.
[11] Glynn Winskel,et al. A Presheaf Semantics of Value-Passing Processes , 1996, CONCUR.