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