Papers

Latest papers concerning the theory of the new CL:

• P.J. Voda: Predicative Justification and Development of a Second Order Theory of Finite Sets, January 2003 (ps)
• P.J. Voda: What Can we Gain by Integrating a Language Processor with a Theorem Prover?, February 2003 (ps)
• P.J. Voda: Grundlagenstreit in the Theory of Programming, February 2003 (ps)
• J. Kluka, P.J. Voda: From Declarative to Imperative Proof-Carrying Programs, July 2003 (ps)

Older papers:

• P.J. Voda: Subrecursion as Basis for a Feasible Programming language, Conf. Logic in Comp. Science September 94, Lecture Notes in Computer Science 933, Springer Verlag 1995, (.ps.gz: 75K)
• J. Komara, P.J. Voda: Programming by Logic and Logic by Programming, invited talk at SOFSEM '94, Czech Republic 1994, (.ps.gz: 142K)
• J. Komara, P.J. Voda: Syntactic Reduction of Predicate Tableaux to Propositional Tableaux, Workshop on Theorem Proving and Analytic Tableaux, May 1995, Lecture Notes in Artificial Intelligence vol. 918, Springer Verlag 1995, (.ps.gz: 70K)
• J. Komara, P.J. Voda: On Herbrand Skeletons, TR102 Institute of Informatics, July 1995, (.ps.gz: 77K)
• J. Komara, P.J. Voda: On Quasitautologies, Intern. Conference Tableaux'97 Pont a Mousson, May 1997, Lecture Notes in Artificial Intelligence vol. 1227, Springer Verlag 1997, (.ps.gz: 54K)
• P.J. Voda: A Simple Ordinal Recursive Normalization of Goedel's T, Conf. Logic in Comp. Science, Aarhus, August 1997, Lecture Notes in Computer Science vol. 1414, Springer Verlag 1998 (.ps.gz: 61K)
• J. Komara, P.J. Voda: Computer Programming as Mathematics , tutorial in Intern. Conference Tableaux '98, May 1998, Lecture Notes in Artificial Intelligence vol. 1397, Springer Verlag 1998 (.ps.gz: 31K)
• J. Komara, P.J. Voda: Theorems of Peter and Parsons in Computer Programming, Conf. Logic in Comp. Science, Brno, August 1998, Lecture Notes in Computer Science vol. 1584, Springer Verlag 1999 (ps)
• P.J. Voda: A Note on the Exponential Relation in Peano Arithmetic, December 1998, see a simplified version below (ps)
• J. Komara, P.J. Voda: Extraction of Efficient Programs in Sigma1 Arithmetic, January 2000 (ps)
• P.J. Voda: A Note on the Exponential Relation in Peano Arithmetic II, November 2001 (ps)
• P.J. Voda: Recursion and Coding in PA by Techniques of Computer Programming, December 2001 (ps)
• P.J. Voda: An Exercise in Programming in PA: Fast Growing Hierarchy Functions, February 2002 (ps)