Vladimir Komendantsky's papers
(non-exhaustive list)

• (with Yves Bertot)
  Fixed point semantics and partial recursion in Coq. In: Proc. 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'08), Valencia, Spain, 15-17 July, 2008, pages 89-96.
  Code supplements:
  1. The flat complete preorders + MiniML Coq development.
  2. The OCaml source package for the Coq command Fcpo Function (alpha version 2008-05-02).
• Denotational semantics of call-by-name normalization in lambda-mu calculus. To appear in Electronic Notes in Theoretical Computer Science (post-proceedings of MFSCIT'06).
• (with Ekaterina Komendantskaya)
  On uniform proof-theoretic operational semantics for logic programming. In: Perspectives on Universal Logic. Eds. J.-Y. Béziau and A. Costa-Leite. Polimetrica Publisher, Italy, 2007, pages 379-394.
• (with Anthony Seda)
  Computation of normal logic programs by fibring neural networks. In: Proc. 7th International Workshop on First-Order Theorem Proving (FTP'05), Koblenz, Germany, September 15-17, 2005, pages 97-111. Extended version is available as BCRI pre-print #56.
• (with Ekaterina Komendantskaya and Anthony Seda)
  On approximation of the semantic operators determined by bilattice-based logic programs. In: Proc. 7th International Workshop on First-Order Theorem Proving (FTP'05), Koblenz, Germany, September 15-17, 2005, pages 112-130.
• Resolution for mixed Post logic. In: Proc. 4th ESSLLI Student Session, August, 2002, Trento, Italy, University of Trento.

Some abstracts, slides, etc.

• Fixed-point partial recursion in Coq. Slides from the presentation I made during TYPES'08, Torino, March 26-29, 2008.
• Denotational semantics, normalisation, and the simply-typed lambda-mu calculus. Slides for an informal meeting of the Everest/Marelle seminar, INRIA Sophia Antipolis, 22 June, 2007.
• Categorical semantics of normalization in lambda-C calculus, In Proc. 4th Intl. Conf. Information and 4th Irish Conf. Mathematical Foundations of Computer Science and Information Technology (MFCSIT'06), 1-5 August, 2006, UCC, Cork, Ireland, pages 233-236.
• On game semantics for intuitionistic linear logic, March, 2006. Appeared in the short contribution proceedings of the 8th International Workshop on Coalgebraic Methods in Computer Science (technical report of the University of Nottingham).
• On automated theorem proving by means of representation theory in Lukasiewicz logics, Slides for the presentation I gave during the 4th Intl. Conf. Smirnov Readings, 28-30 May, 2003, Institute of Philosophy, Russian Academy of Sciences, Moscow.

PhD thesis

Theory of inference in many-valued logics. Defended in the Institute of Philosophy, Russian Academy of Sciences, 23 October, 2003, in Russian. There is an English abstract.

Other non-research related

• My DjVu linux HOWTO. This is a document explaining basic methods of DjVu authoring in linux. For enthusiasts of printed document digitizing :-)