Safe Recursion on Notation into a Light Logic by Levels
暂无分享,去创建一个
[1] Stephen A. Cook,et al. A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.
[2] Kazushige Terui. Proof nets and Boolean circuits , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[3] Luca Roversi,et al. Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets , 2008, TYPES.
[4] Luca Roversi. A P-Time Completeness Proof for Light Logics , 1999, CSL.
[5] Andrea Asperti,et al. Intuitionistic Light Affine Logic , 2002, TOCL.
[6] Jean-Yves Girard,et al. Light Linear Logic , 1998, Inf. Comput..
[7] Damiano Mazza,et al. Linear logic by levels and bounded time complexity , 2008, Theor. Comput. Sci..
[8] Martín Abadi,et al. Types for the Scott Numerals , 1993 .
[9] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..
[10] Luca Vercelli,et al. On the complexity of stratified logics , 2010, ArXiv.
[11] Daniel Leivant,et al. A Foundational Delineation of Poly-time , 1994, Inf. Comput..
[12] Daniel Leivant,et al. Stratified functional programs and computational complexity , 1993, POPL '93.
[13] Andrzej S. Murawski,et al. On an interpretation of safe recursion in light affine logic , 2004, Theor. Comput. Sci..