Alexei Kopylov's Publications

 

• at Moscow State University
  • A. P. Kopylov. On NP-completeness in Linear Logic. Annals of Pure and Applied Logic 75 (1995) 179-213.
    • Abstract
    • Full paper (.ps file) / 17 pages 
      
  • A. P. Kopylov. Decidability of Linear Affine Logic.  Information and Computation, Vol. 164, No. 1, Jan 2001, pp. 173-198
  • Abstract
  • Short version of this paper is in Proc. of  Tenth Annual IEEE Symposium on Logic in Computer Science (LICS), San Diego, USA, June, 1995 (.ps file) /10 pages
  • Full paper (.pdf file) / 16 pages
    
  • A. P. Kopylov. The undecidability of second order linear affine logic. Technical report Mathematical Logic and Foundations Series, ML-1995-10, Institute for Logic, Language and Computation, Amsterdam, November 1995
    • Abstract
    • Full paper (.ps file) / 10 pages

     

• at Cornell University
  • Alexei Kopylov. Dependent Intersection: A New Way of Defining Records in Type Theory. Proc. of Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS), Ottawa, Canada, June 2003
    • Abstract
    • Full paper (.ps file)  (.pdf file) / 15 pages
      
  • Alexei Kopylov, Aleksey Nogin. Markov's Principle for Propositional Type Theory. In L. Fribourg, editor Computer Science Logic, Proceedings of the 10th Annual Conference of the EACSL, volume 2142 of Lecture Notes in Computer Science, pages 570-584. Springer-Verlag, 2001.   
    • Abstract
    • Full paper (.ps file) (.pdf file) / 15 pages
      
  • Alexei Pavlovich Kopylov. Type Theoretical Foundations for Data Structures, Classes, and Objects. PhD Thesis, Cornell University, 2004. 
    • Abstract
    • Acknowledgements
    • Full text (.ps file) (.pdf file) (original format) / 107 pages
    • Single space format (.ps file) (.pdf file) / 63 pages

Return to Alexei's Home Page