Assumption Classes in Natural Deduction. - Daniel Leivant (Math. Log. Q., 1979)

Innocuous Substitutions. - Daniel Leivant (J. Symb. Log., 1980)

A Proof Theoretic Methodology for Propositional Dynamic Logic. - Daniel Leivant (ICFPC, 1981)

The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) - Daniel Leivant (STOC, 1981)

Implicational Complexity in Intuitionistic Arithmetic. - Daniel Leivant (J. Symb. Log., 1981)

On the Proof Theory of the Modal Logic for Arithmetic Provability. - Daniel Leivant (J. Symb. Log., 1981)

Unprovability of Theorems of Complexity Theory in Weak Number Theories. - Daniel Leivant (Theor. Comput. Sci., 1982)

Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines - Daniel Leivant (FOCS, 1983)

Polymorphic Type Inference. - Daniel Leivant (POPL, 1983)

Structural Semantics for Polymorphic Data Types. - Daniel Leivant (POPL, 1983)

The Optimality of Induction as an Axiomatization of Arithmetic. - Daniel Leivant (J. Symb. Log., 1983)

The Expressiveness of Simple and Second-Order Type Structures - Steven Fortune; Daniel Leivant; Michael J. O'Donnell (J. ACM, 1983)

Partial-Correctness Theories as First-Order Theories. - Daniel Leivant (Logic of Programs, 1985)

Logical and Mathematical Reasoning about Imperative Programs. - Daniel Leivant (POPL, 1985)

Syntactic Translations and Provably Recursive Functions. - Daniel Leivant (J. Symb. Log., 1985)

Typing and Computational Properties of Lambda Expressions. - Daniel Leivant (Theor. Comput. Sci., 1986)

Characterization of complexity classes in higher-order logic. - Daniel Leivant (SCT, 1987)

Skinny and Fleshy Failures of Relative Completeness. - Daniel Leivant; Tim Fernando (POPL, 1987)

Meager and replete failures of relative completeness. - Daniel Leivant; Tim Fernando (J. ACM, 1988)

Stratified Polymorphism (Extended Summary) - Daniel Leivant (LICS, 1989)

Descriptive Characterizations of Computational Complexity. - Daniel Leivant (J. Comput. Syst. Sci., 1989)

Discrete Polymorphism. - Daniel Leivant (LISP and Functional Programming, 1990)

Markov's Rule revisited. - Daniel Leivant (Arch. Math. Log., 1990)

Inductive Definitions Over Finite Structures - Daniel Leivant (Inf. Comput., 1990)

A Foundational Delineation of Computational Feasiblity - Daniel Leivant (LICS, 1991)

Finitely Stratified Polymorphism - Daniel Leivant (Inf. Comput., 1991)

Stratified Functional Programs and Computational Complexity. - Daniel Leivant (POPL, 1993)

Lambda Calculus Characterizations of Poly-Time. - Daniel Leivant; Jean-Yves Marion (Fundam. Informaticae, 1993)

Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. - Daniel Leivant (Theor. Comput. Sci., 1993)

Higher order logic. - Daniel Leivant (Handbook of Logic in Artificial Intelligence and Logic Programming (2), 1994)

Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. - Daniel Leivant; Jean-Yves Marion (CSL, 1994)

Intrinsic Theories and Computational Complexity. - Daniel Leivant (LCC, 1994)

Predicative Recurrence in Finite Types. - Daniel Leivant (LFCS, 1994)

A Foundational Delineation of Poly-time - Daniel Leivant (Inf. Comput., 1994)

Predicative Functional Recurrence and Poly-space. - Daniel Leivant; Jean-Yves Marion (TAPSOFT, 1997)

A Characterization of NC by Tree Recurrence. - Daniel Leivant (FOCS, 1998)

Panel: logic in the computer science curriculum. - Kim B. Bruce; Phokion G. Kolaitis; Daniel Leivant; Moshe Y. Vardi (SIGCSE, 1998)

Applicative Control and Computational Complexity. - Daniel Leivant (CSL, 1999)

Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. - Daniel Leivant (Ann. Pure Appl. Log., 1999)

Stratified polymorphism and primitive recursion. - Norman Danner; Daniel Leivant (Math. Struct. Comput. Sci., 1999)

A characterization of alternating log time by ramified recurrence. - Daniel Leivant; Jean-Yves Marion (Theor. Comput. Sci., 2000)

The Functions Provable by First Order Abstraction. - Daniel Leivant (LPAR, 2001)

Termination Proofs and Complexity Certification. - Daniel Leivant (TACS, 2001)

Implicit Computational Complexity for Higher Type Functionals. - Daniel Leivant (CSL, 2002)

Substructural Verification and Computational Feasibility. - Daniel Leivant (IFIP TCS, 2002)

Calibrating Computational Feasibility by Abstraction Rank. - Daniel Leivant (LICS, 2002)

Intrinsic reasoning about functional programs I: first order theories. - Daniel Leivant (Ann. Pure Appl. Log., 2002)

Feasible functionals and intersection of ramified types. - Daniel Leivant (ITRS, 2002)

Guest editorial. - Anuj Dawar; Daniel Leivant (Inf. Comput., 2003)

Partial Correctness Assertions Provable in Dynamic Logics. - Daniel Leivant (FoSSaCS, 2004)

Proving Termination Assertions in Dynamic Logics. - Daniel Leivant (LICS, 2004)

Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion. - Daniel Leivant (Theor. Comput. Sci., 2004)

Partial Correctness Assertions Provable in Dynamic Logic. - Daniel Leivant (We Will Show Them! (2), 2005)

Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. - Daniel Leivant (LICS, 2006)

Reasoning in Dynamic Logic about Program Termination. - Daniel Leivant (Pillars of Computer Science, 2008)

Propositional Dynamic Logic for Recursive Procedures. - Daniel Leivant (VSTTE, 2008)

Propositional Dynamic Logic with Program Quantifiers. - Daniel Leivant (MFPS, 2008)

Inductive Completeness of Logics of Programs. - Daniel Leivant (LFMTP@LICS, 2008)

Logical Undecidabilities Made Easy. - Daniel Leivant (Fundam. Informaticae, 2008)

On the Completeness of Dynamic Logic. - Daniel Leivant (FoSSaCS, 2009)

Feasible Functions over Co-inductive Data. - Ramyaa Ramyaa; Daniel Leivant (WoLLIC, 2010)

Logic, language, information and computation. - Daniel Leivant; Ruy J. G. B. de Queiroz (Inf. Comput., 2010)

Implicit complexity for coinductive data: a characterization of corecurrence - Daniel Leivant; Ramyaa Ramyaa (DICE, 2011)

Ramified Corecurrence and Logspace. - Ramyaa Ramyaa; Daniel Leivant (MFPS, 2011)

Alternating Turing machines and the analytical hierarchy. - Daniel Leivant (Turing-100, 2012)

Evolving Graph-Structures and Their Implicit Computational Complexity. - Daniel Leivant; Jean-Yves Marion (ICALP (2), 2013)

Alternating Turing machines for inductive languages. - Daniel Leivant (Log. Methods Comput. Sci., 2013)

Global semantic typing for inductive and coinductive computing. - Daniel Leivant (Log. Methods Comput. Sci., 2014)

The Computational Contents of Ramified Corecurrence. - Daniel Leivant; Ramyaa Ramyaa (FoSSaCS, 2015)

22nd Workshop on Logic, Language, Information and Computation (WoLLIC 2015). - Valeria de Paiva; Lawrence S. Moss; Daniel Leivant; Ruy J. G. B. de Queiroz (Log. J. IGPL, 2016)

The Ackermann Award 2017. - Anuj Dawar; Daniel Leivant (CSL, 2017)

Implicit complexity via structure transformation. - Daniel Leivant; Jean-Yves Marion (CoRR, 2018)

A theory of finite structures. - Daniel Leivant (CoRR, 2018)

A generic imperative language for polynomial time. - Daniel Leivant (CoRR, 2019)

Primitive recursion in the abstract. - Daniel Leivant; Jean-Yves Marion (Math. Struct. Comput. Sci., 2020)

Algorithmically Broad Languages for Polynomial Time and Space. - Daniel Leivant (WoLLIC, 2021)

Finitism, imperative programs and primitive recursion. - Daniel Leivant (J. Log. Comput., 2021)