Daniel Leivant

Publication Activity (10 Years)

Years Active: 1979-2021
Publications (10 Years): 10

Top Topics

Semantically Equivalent

Transitive Closure

Imperative Programs

Top Venues

Log. Methods Comput. Sci.

Publications

Daniel Leivant
Algorithmically Broad Languages for Polynomial Time and Space. WoLLIC (2021)
Daniel Leivant
Finitism, imperative programs and primitive recursion. J. Log. Comput. 31 (1) (2021)
Daniel Leivant, Jean-Yves Marion
Primitive recursion in the abstract. Math. Struct. Comput. Sci. 30 (1) (2020)
Daniel Leivant
Finitism, Imperative Programs and Primitive Recursion. LFCS (2020)
Daniel Leivant
A generic imperative language for polynomial time. CoRR (2019)
Daniel Leivant, Jean-Yves Marion
Implicit complexity via structure transformation. CoRR (2018)
Daniel Leivant
A theory of finite structures. CoRR (2018)
Anuj Dawar, Daniel Leivant
The Ackermann Award 2017. CSL (2017)
Valeria de Paiva, Lawrence S. Moss, Daniel Leivant, Ruy J. G. B. de Queiroz
22nd Workshop on Logic, Language, Information and Computation (WoLLIC 2015). Log. J. IGPL 24 (5) (2016)
Daniel Leivant, Ramyaa Ramyaa
The Computational Contents of Ramified Corecurrence. FoSSaCS (2015)
Daniel Leivant
Global semantic typing for inductive and coinductive computing. Log. Methods Comput. Sci. 10 (4) (2014)
Daniel Leivant
Global semantic typing for inductive and coinductive computing. CSL (2013)
Daniel Leivant
Alternating Turing machines for inductive languages. Log. Methods Comput. Sci. 9 (3) (2013)
Daniel Leivant, Jean-Yves Marion
Evolving Graph-Structures and Their Implicit Computational Complexity. ICALP (2) (2013)
Daniel Leivant
Alternating Turing machines and the analytical hierarchy. Turing-100 (2012)
Ramyaa Ramyaa, Daniel Leivant
Ramified Corecurrence and Logspace. MFPS (2011)
Daniel Leivant, Ramyaa Ramyaa
Implicit complexity for coinductive data: a characterization of corecurrence DICE (2011)
Ramyaa Ramyaa, Daniel Leivant
Feasible Functions over Co-inductive Data. WoLLIC (2010)
Daniel Leivant, Ruy J. G. B. de Queiroz
Logic, language, information and computation. Inf. Comput. 208 (5) (2010)
Daniel Leivant
On the Completeness of Dynamic Logic. FoSSaCS (2009)
Daniel Leivant
Inductive Completeness of Logics of Programs. Electron. Notes Theor. Comput. Sci. 228 (2009)
Daniel Leivant
Reasoning in Dynamic Logic about Program Termination. Pillars of Computer Science (2008)
Daniel Leivant
Logical Undecidabilities Made Easy. Fundam. Informaticae 89 (2-3) (2008)
Daniel Leivant
Propositional Dynamic Logic with Program Quantifiers. MFPS (2008)
Daniel Leivant
Propositional Dynamic Logic for Recursive Procedures. VSTTE (2008)
Daniel Leivant
Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. LICS (2006)
Daniel Leivant
Partial Correctness Assertions Provable in Dynamic Logic. We Will Show Them! (2) (2005)
Daniel Leivant
Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion. Theor. Comput. Sci. 318 (1-2) (2004)
Daniel Leivant
Proving Termination Assertions in Dynamic Logics. LICS (2004)
Daniel Leivant
Partial Correctness Assertions Provable in Dynamic Logics. FoSSaCS (2004)
Anuj Dawar, Daniel Leivant
Guest editorial. Inf. Comput. 183 (1) (2003)
Daniel Leivant
Substructural Verification and Computational Feasibility. IFIP TCS (2002)
Daniel Leivant
Intrinsic reasoning about functional programs I: first order theories. Ann. Pure Appl. Log. 114 (1-3) (2002)
Daniel Leivant
Implicit Computational Complexity for Higher Type Functionals. CSL (2002)
Daniel Leivant
Calibrating Computational Feasibility by Abstraction Rank. LICS (2002)
Daniel Leivant
Feasible functionals and intersection of ramified types. Electron. Notes Theor. Comput. Sci. 70 (1) (2002)
Daniel Leivant
Termination Proofs and Complexity Certification. TACS (2001)
Daniel Leivant
The Functions Provable by First Order Abstraction. LPAR (2001)
Daniel Leivant, Jean-Yves Marion
A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236 (1-2) (2000)
Norman Danner, Daniel Leivant
Stratified polymorphism and primitive recursion. Math. Struct. Comput. Sci. 9 (4) (1999)
Daniel Leivant
Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. Ann. Pure Appl. Log. 96 (1-3) (1999)
Daniel Leivant
Applicative Control and Computational Complexity. CSL (1999)
Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi
Panel: logic in the computer science curriculum. SIGCSE (1998)
Daniel Leivant
A Characterization of NC by Tree Recurrence. FOCS (1998)
Daniel Leivant, Jean-Yves Marion
Predicative Functional Recurrence and Poly-space. TAPSOFT (1997)
Daniel Leivant, Jean-Yves Marion
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. CSL (1994)
Daniel Leivant
Predicative Recurrence in Finite Types. LFCS (1994)
Daniel Leivant
A Foundational Delineation of Poly-time Inf. Comput. 110 (2) (1994)
Daniel Leivant
Intrinsic Theories and Computational Complexity. LCC (1994)
Daniel Leivant
Stratified Functional Programs and Computational Complexity. POPL (1993)
Daniel Leivant, Jean-Yves Marion
Lambda calculus characterizations of poly-time. TLCA (1993)
Daniel Leivant, Jean-Yves Marion
Lambda Calculus Characterizations of Poly-Time. Fundam. Informaticae 19 (1/2) (1993)
Daniel Leivant
Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. Theor. Comput. Sci. 121 (1&2) (1993)
Daniel Leivant
A Foundational Delineation of Computational Feasiblity LICS (1991)
Daniel Leivant
Finitely Stratified Polymorphism Inf. Comput. 93 (1) (1991)
Daniel Leivant
Discrete Polymorphism. LISP and Functional Programming (1990)
Daniel Leivant
Markov's Rule revisited. Arch. Math. Log. 30 (2) (1990)
Daniel Leivant
Inductive Definitions Over Finite Structures Inf. Comput. 89 (2) (1990)
Daniel Leivant
Descriptive Characterizations of Computational Complexity. J. Comput. Syst. Sci. 39 (1) (1989)
Daniel Leivant
Stratified Polymorphism (Extended Summary) LICS (1989)
Daniel Leivant, Tim Fernando
Meager and replete failures of relative completeness. J. ACM 35 (4) (1988)
Daniel Leivant, Tim Fernando
Skinny and Fleshy Failures of Relative Completeness. POPL (1987)
Daniel Leivant
Characterization of complexity classes in higher-order logic. Computational Complexity Conference (1987)
Daniel Leivant
Typing and Computational Properties of Lambda Expressions. Theor. Comput. Sci. 44 (1986)
Daniel Leivant
Syntactic Translations and Provably Recursive Functions. J. Symb. Log. 50 (3) (1985)
Daniel Leivant
Logical and Mathematical Reasoning about Imperative Programs. POPL (1985)
Daniel Leivant
Partial-Correctness Theories as First-Order Theories. Logic of Programs (1985)
Daniel Leivant
Structural Semantics for Polymorphic Data Types. POPL (1983)
Steven Fortune, Daniel Leivant, Michael J. O'Donnell
The Expressiveness of Simple and Second-Order Type Structures J. ACM 30 (1) (1983)
Daniel Leivant
The Optimality of Induction as an Axiomatization of Arithmetic. J. Symb. Log. 48 (1) (1983)
Daniel Leivant
Polymorphic Type Inference. POPL (1983)
Daniel Leivant
Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines FOCS (1983)
Daniel Leivant
Unprovability of Theorems of Complexity Theory in Weak Number Theories. Theor. Comput. Sci. 18 (1982)
Daniel Leivant
A Proof Theoretic Methodology for Propositional Dynamic Logic. ICFPC (1981)
Daniel Leivant
On the Proof Theory of the Modal Logic for Arithmetic Provability. J. Symb. Log. 46 (3) (1981)
Daniel Leivant
The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) STOC (1981)
Daniel Leivant
Implicational Complexity in Intuitionistic Arithmetic. J. Symb. Log. 46 (2) (1981)
Daniel Leivant
Innocuous Substitutions. J. Symb. Log. 45 (2) (1980)
Daniel Leivant
Assumption Classes in Natural Deduction. Math. Log. Q. 25 (1-2) (1979)