The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Daniel Leivant: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Leivant, Jean-Yves Marion
    Lambda Calculus Characterizations of Poly-Time. [Citation Graph (2, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:1/2, pp:167-184 [Journal]
  2. Daniel Leivant
    Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines [Citation Graph (1, 0)][DBLP]
    FOCS, 1983, pp:460-469 [Conf]
  3. Daniel Leivant
    Inductive Definitions Over Finite Structures [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1990, v:89, n:2, pp:95-108 [Journal]
  4. Steven Fortune, Daniel Leivant, Michael O'Donnell
    The Expressiveness of Simple and Second-Order Type Structures [Citation Graph (1, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:151-185 [Journal]
  5. Daniel Leivant
    Partial Correctness Assertions Provable in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (2), 2005, pp:209-224 [Conf]
  6. Daniel Leivant
    Implicit Computational Complexity for Higher Type Functionals. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:367-381 [Conf]
  7. Daniel Leivant
    Applicative Control and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:82-95 [Conf]
  8. Daniel Leivant, Jean-Yves Marion
    Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:486-500 [Conf]
  9. Daniel Leivant
    A Characterization of NC by Tree Recurrence. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:716-724 [Conf]
  10. Daniel Leivant
    Partial Correctness Assertions Provable in Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:304-317 [Conf]
  11. Daniel Leivant
    A Proof Theoretic Methodology for Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    ICFPC, 1981, pp:356-373 [Conf]
  12. Daniel Leivant
    Substructural Verification and Computational Feasibility. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:498-510 [Conf]
  13. Daniel Leivant
    Intrinsic Theories and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:177-194 [Conf]
  14. Daniel Leivant
    Predicative Recurrence in Finite Types. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:227-239 [Conf]
  15. Daniel Leivant
    Discrete Polymorphism. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1990, pp:288-297 [Conf]
  16. Daniel Leivant
    Calibrating Computational Feasibility by Abstraction Rank. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:345-0 [Conf]
  17. Daniel Leivant
    Proving Termination Assertions in Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:89-98 [Conf]
  18. Daniel Leivant
    Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:157-168 [Conf]
  19. Daniel Leivant
    Stratified Polymorphism (Extended Summary) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:39-47 [Conf]
  20. Daniel Leivant
    A Foundational Delineation of Computational Feasiblity [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:2-11 [Conf]
  21. Daniel Leivant
    Partial-Correctness Theories as First-Order Theories. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:190-195 [Conf]
  22. Daniel Leivant
    The Functions Provable by First Order Abstraction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:330-346 [Conf]
  23. Daniel Leivant
    Polymorphic Type Inference. [Citation Graph (0, 0)][DBLP]
    POPL, 1983, pp:88-98 [Conf]
  24. Daniel Leivant
    Structural Semantics for Polymorphic Data Types. [Citation Graph (0, 0)][DBLP]
    POPL, 1983, pp:155-166 [Conf]
  25. Daniel Leivant
    Logical and Mathematical Reasoning about Imperative Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1985, pp:132-140 [Conf]
  26. Daniel Leivant
    Stratified Functional Programs and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:325-333 [Conf]
  27. Daniel Leivant, Tim Fernando
    Skinny and Fleshy Failures of Relative Completeness. [Citation Graph (0, 0)][DBLP]
    POPL, 1987, pp:246-252 [Conf]
  28. Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi
    Panel: logic in the computer science curriculum. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:376-377 [Conf]
  29. Daniel Leivant
    The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:38-45 [Conf]
  30. Daniel Leivant
    Termination Proofs and Complexity Certification. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:183-200 [Conf]
  31. Daniel Leivant, Jean-Yves Marion
    Predicative Functional Recurrence and Poly-space. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:369-380 [Conf]
  32. Daniel Leivant, Jean-Yves Marion
    Lambda calculus characterizations of poly-time. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:274-288 [Conf]
  33. Daniel Leivant
    Intrinsic reasoning about functional programs I: first order theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:114, n:1-3, pp:117-153 [Journal]
  34. Daniel Leivant
    Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:209-229 [Journal]
  35. Daniel Leivant
    Feasible functionals and intersection of ramified types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:1, pp:- [Journal]
  36. Anuj Dawar, Daniel Leivant
    Guest editorial. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:1- [Journal]
  37. Daniel Leivant
    Finitely Stratified Polymorphism [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:1, pp:93-113 [Journal]
  38. Daniel Leivant
    A Foundational Delineation of Poly-time [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:2, pp:391-420 [Journal]
  39. Daniel Leivant, Tim Fernando
    Meager and replete failures of relative completeness. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:953-964 [Journal]
  40. Daniel Leivant
    Descriptive Characterizations of Computational Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:51-83 [Journal]
  41. Daniel Leivant
    Innocuous Substitutions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:2, pp:363-368 [Journal]
  42. Daniel Leivant
    Implicational Complexity in Intuitionistic Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:2, pp:240-248 [Journal]
  43. Daniel Leivant
    On the Proof Theory of the Modal Logic for Arithmetic Provability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:3, pp:531-538 [Journal]
  44. Daniel Leivant
    The Optimality of Induction as an Axiomatization of Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:1, pp:182-184 [Journal]
  45. Daniel Leivant
    Syntactic Translations and Provably Recursive Functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:3, pp:682-688 [Journal]
  46. Norman Danner, Daniel Leivant
    Stratified polymorphism and primitive recursion. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1999, v:9, n:4, pp:507-522 [Journal]
  47. Daniel Leivant
    Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:181-196 [Journal]
  48. Daniel Leivant
    Unprovability of Theorems of Complexity Theory in Weak Number Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:259-268 [Journal]
  49. Daniel Leivant
    Typing and Computational Properties of Lambda Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:51-68 [Journal]
  50. Daniel Leivant
    Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:309-322 [Journal]
  51. Daniel Leivant, Jean-Yves Marion
    A characterization of alternating log time by ramified recurrence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:236, n:1-2, pp:193-208 [Journal]

  52. Reasoning in Dynamic Logic about Program Termination. [Citation Graph (, )][DBLP]


  53. On the Completeness of Dynamic Logic. [Citation Graph (, )][DBLP]


  54. Feasible Functions over Co-inductive Data. [Citation Graph (, )][DBLP]


  55. Propositional Dynamic Logic for Recursive Procedures. [Citation Graph (, )][DBLP]


  56. Propositional Dynamic Logic with Program Quantifiers. [Citation Graph (, )][DBLP]


  57. Inductive Completeness of Logics of Programs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.458secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002