The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul J. Voda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ján Komara, Paul J. Voda
    Theorems af Péter and Parsons in Computer Programming. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:204-223 [Conf]
  2. Lars Kristiansen, Paul J. Voda
    The Surprising Power of Restricted Programs and Gödel's Functionals. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:345-358 [Conf]
  3. Paul J. Voda
    Subrecursion as a Basis for a Feasible Programming Language. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:324-338 [Conf]
  4. Paul J. Voda
    A Simple Ordinal Recursive Normalization of Gödel's T. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:491-509 [Conf]
  5. Paul J. Voda, Benjamin Yu
    RF-Maple: A Logic Programming Language with Functions, Types, and Concurrency. [Citation Graph (0, 0)][DBLP]
    FGCS, 1984, pp:341-347 [Conf]
  6. Paul J. Voda
    Choices in, and Limitations of, Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1986, pp:615-623 [Conf]
  7. Paul J. Voda
    Types of Trilogy. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:580-589 [Conf]
  8. Paul J. Voda
    The Logical Reconstruction of Cuts as One Solution Operators. [Citation Graph (0, 0)][DBLP]
    META, 1988, pp:523-530 [Conf]
  9. Paul J. Voda
    Maple: a Programming Language, Operating System. [Citation Graph (0, 0)][DBLP]
    POPL, 1982, pp:157-168 [Conf]
  10. Ján Komara, Paul J. Voda
    Syntactic Reduction of Predicate Tableaux to Propositional Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1995, pp:231-246 [Conf]
  11. Ján Komara, Paul J. Voda
    On Quasitautologies. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:231-245 [Conf]
  12. Ján Komara, Paul J. Voda
    Computer Programming as Mathematics in a Programming Language and Proof System CL. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1998, pp:42-43 [Conf]
  13. Lars Kristiansen, Paul J. Voda
    The Trade-Off Theorem and Fragments of Gödel's T. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:654-674 [Conf]
  14. Lars Kristiansen, Paul J. Voda
    Complexity classes and fragments of C. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:5, pp:213-218 [Journal]
  15. Paul J. Voda
    A View of Programming Languages as Symbiosis of Meaning and Computations. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1985, v:3, n:1, pp:71-100 [Journal]
  16. Paul J. Voda
    Computation of Full Logic Programs Using One-Variable Environments. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1986, v:4, n:2, pp:153-187 [Journal]
  17. Lars Kristiansen, Paul J. Voda
    Programming Languages Capturing Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2005, v:12, n:2, pp:89-115 [Journal]

  18. The Structure of Detour Degrees. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002