Daniel Leivant

发表

Reasoning in Dynamic Logic about Program Termination

Daniel Leivant, D. Leivant, 2008, Pillars of Computer Science.

Feasible functionals and intersection of ramified types

Daniel Leivant, 2002, Electron. Notes Theor. Comput. Sci..

Partial-Correctness Theories as First-Order Theories

Daniel Leivant, D. Leivant, 1985, Logic of Programs.

Functions Over Free Algebras Definable in the Simply Typed lambda Calculus

Daniel Leivant, D. Leivant, 1993, Theor. Comput. Sci..

Finitism, Imperative Programs and Primitive Recursion

Daniel Leivant, D. Leivant, 2019, LFCS.

14th Workshop on Logic, Language, Information and Computation (WoLLIC 2007)

Daniel Leivant, Ruy J. G. B. de Queroz, 2008 .

Logical Undecidabilities Made Easy

Daniel Leivant, 2008, Fundam. Informaticae.

Markov's Rule revisited

Daniel Leivant, 1990, Arch. Math. Log..

Polymorphic type inference

Daniel Leivant, D. Leivant, 1983, POPL '83.

Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, Indiana, USA, 13-16 October 1994

Daniel Leivant, D. Leivant, 1995, LCC.

Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space

Daniel Leivant, Jean-Yves Marion, 1994, CSL.

22nd Workshop on Logic, Language, Information and Computation (WoLLIC 2015)

Daniel Leivant, Valeria de Paiva, Lawrence S. Moss, 2016, Log. J. IGPL.

Inductive Definitions Over Finite Structures

Daniel Leivant, D. Leivant, 1990, Inf. Comput..

Assumption Classes in Natural Deduction

Daniel Leivant, 1979, Math. Log. Q..

A generic imperative language for polynomial time pdf

Daniel Leivant, 2019, ArXiv.

Implicit Computational Complexity for Higher Type Functionals

Daniel Leivant, D. Leivant, 2002, CSL.

Global semantic typing for inductive and coinductive computing

Daniel Leivant, D. Leivant, 2013, CSL.

Stratified functional programs and computational complexity

Daniel Leivant, D. Leivant, 1993, POPL '93.

Intrinsic Theories and Computational Complexity

Daniel Leivant, D. Leivant, 1994, LCC.

Implicit complexity via structure transformation pdf

Daniel Leivant, Jean-Yves Marion, 2018, ArXiv.

Meager and replete failures of relative completeness

Daniel Leivant, Tim Fernando, D. Leivant, 1988, JACM.

Discrete polymorphism

Daniel Leivant, 1990, LISP and Functional Programming.

Typing and Computational Properties of Lambda Expressions

Daniel Leivant, D. Leivant, 1986, Theor. Comput. Sci..

On the proof theory of the modal logic for arithmetic provability

Daniel Leivant, D. Leivant, 1981, Journal of Symbolic Logic.

Unprovability of Theorems of Complexity Theory in Weak Number Theories

Daniel Leivant, D. Leivant, 1982, Theor. Comput. Sci..

On Easily Infinite Sets and On a Statement of R. Lipton

Daniel Leivant, 1979 .

A Foundational Delineation of Poly-time

Daniel Leivant, D. Leivant, 1994, Inf. Comput..

Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity

Daniel Leivant, D. Leivant, 1999, Ann. Pure Appl. Log..

Higher order logic

Daniel Leivant, D. Leivant, 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

A theory of finite structures pdf

Daniel Leivant, 2018, ArXiv.

Feasible Functions over Co-inductive Data

Daniel Leivant, Ramyaa, 2010, WoLLIC.

Descriptive Characterizations of Computational Complexity

Daniel Leivant, D. Leivant, 1989, J. Comput. Syst. Sci..

Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion

Daniel Leivant, D. Leivant, 2004, Theor. Comput. Sci..

On the Completeness of Dynamic Logic

Daniel Leivant, D. Leivant, 2009, FoSSaCS.

The Ackermann Award 2017

Daniel Leivant, Anuj Dawar, 2017, CSL.

Logic, language, information and computation : 14th International Workshop, WoLLIC 2007 Rio de Janeiro, Brazil, July 2-5, 2007 : proceedings

Daniel Leivant, Ruy J. G. B. de Queiroz, 2007 .

Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic

Daniel Leivant, D. Leivant, 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

Termination Proofs and Complexity Certification

Daniel Leivant, 2001, TACS.

Contracting proofs to programs

Daniel Leivant, D. Leivant, 1989 .

The Computational Contents of Ramified Corecurrence

Daniel Leivant, Ramyaa, D. Leivant, 2015, FoSSaCS.

WITHDRAWN: Termination proofs and complexity certification (extended abstract)

Daniel Leivant, 2003 .

Logical and mathematical reasoning about imperative programs: preliminary report

Daniel Leivant, 1985, POPL '85.

Typing and convergence in the lambda calculus

Daniel Leivant, D. Leivant, 1984 .

The Expressiveness of Simple and Second-Order Type Structures

Daniel Leivant, Steven Fortune, Michael O'Donnell, 1983, JACM.

Finitely Stratified Polymorphism

Daniel Leivant, D. Leivant, 1991, Inf. Comput..

Partial Correctness Assertions Provable in Dynamic Logic

Daniel Leivant, 2005, We Will Show Them!.

Applicative Control and Computational Complexity

Daniel Leivant, 1999, CSL.

Implicational Complexity in Intuitionistic Arithmetic

Daniel Leivant, 1981, J. Symb. Log..

Lecture Notes in Computer Science 960. Logic and Computational Complexity. International Workshop Held in Indianapolis, Indiana on October 1994. Selected Papers,

Gerhard Goos, Daniel Leivant, J. Hermanis, 1994 .

Stratified Polymorphism (Extended Summary)

Daniel Leivant, 1989, LICS 1989.

Alternating Turing machines for inductive languages

Daniel Leivant, D. Leivant, 2013, Log. Methods Comput. Sci..

Partial Correctness Assertions Provable in Dynamic Logics

Daniel Leivant, D. Leivant, 2004, FoSSaCS.

Implicit complexity for coinductive data: a characterization of corecurrence

Daniel Leivant, Ramyaa, 2011, DICE.

Inductive Completeness of Logics of Programs

Daniel Leivant, D. Leivant, 2008, LFMTP@LICS.

Intrinsic reasoning about functional programs I: first order theories

Daniel Leivant, D. Leivant, 2002, Ann. Pure Appl. Log..

Alternating Turing machines and the analytical hierarchy

Daniel Leivant, D. Leivant, 2012, Turing-100.

Substructural Verification and Computational Feasibility

Daniel Leivant, D. Leivant, 2002, IFIP TCS.

Predicative Functional Recurrence and Poly-space

Daniel Leivant, Jean-Yves Marion, 1997, TAPSOFT.

Stratified polymorphism

Daniel Leivant, D. Leivant, 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

Panel: logic in the computer science curriculum

Daniel Leivant, Phokion G. Kolaitis, Kim B. Bruce, 1998, SIGCSE '98.

On the Proof Theory of the Modal Logic G

Daniel Leivant, D. Leivant, 1979 .

The complexity of parameter passing in polymorphic procedures

Daniel Leivant, D. Leivant, 1981, STOC '81.

Logical and Mathematical Reasoning about Imperative Programs.

Daniel Leivant, D. Leivant, 1985 .

Skinny and fleshy failures of relative completeness

Daniel Leivant, Tim Fernando, 1987, POPL '87.

The optimality of induction as an axiomatization of arithmetic

Daniel Leivant, D. Leivant, 1983, Journal of Symbolic Logic (JSL).

Characterization of complexity classes in higher-order logic

Daniel Leivant, 1987, Computational Complexity Conference.

Evolving Graph-Structures and Their Implicit Computational Complexity

Daniel Leivant, Jean-Yves Marion, 2013, ICALP.

A foundational delineation of computational feasibility

Daniel Leivant, D. Leivant, 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

Predicative Recurrence in Finite Types

Daniel Leivant, 1994, LFCS.

A Proof Theoretic Methodology for Propositional Dynamic Logic

Daniel Leivant, D. Leivant, 1981, ICFPC.

Ramified Corecurrence and Logspace

Daniel Leivant, Ramyaa, D. Leivant, 2011, MFPS.

Selected Papers from the International Workshop on Logical and Computational Complexity

Daniel Leivant, 1994 .

A characterization of NC by tree recurrence

Daniel Leivant, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Propositional Dynamic Logic for Recursive Procedures

Daniel Leivant, D. Leivant, 2008, VSTTE.

Syntactic translations and provably recursive functions

Daniel Leivant, D. Leivant, 1985, Journal of Symbolic Logic.

Calibrating computational feasibility by abstraction rank

Daniel Leivant, D. Leivant, 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

Guest editorial

Daniel Leivant, Anuj Dawar, 2003, Inf. Comput..

Monotonic use of space and computational complexity over abstract structures

Daniel Leivant, 1989 .

Primitive recursion in the abstract

Daniel Leivant, Jean-Yves Marion, D. Leivant, 2020, Mathematical Structures in Computer Science.

Global semantic typing for inductive and coinductive computing

Daniel Leivant, 2013, CSL.

Innocuous Substitutions

Daniel Leivant, 1980, J. Symb. Log..

Logic and Computational Complexity

Daniel Leivant, D. Leivant, 1995, Lecture Notes in Computer Science.

Reasoning about functional programs and complexity classes associated with type disciplines

Daniel Leivant, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

A characterization of alternating log time by ramified recurrence

Daniel Leivant, Jean-Yves Marion, 2000, Theor. Comput. Sci..

Logic, language, information and computation

Daniel Leivant, Ruy J. G. B. de Queiroz, 2010, Inf. Comput..

Propositional Dynamic Logic with Program Quantifiers

Daniel Leivant, D. Leivant, 2008, MFPS.

Stratified polymorphism and primitive recursion

Daniel Leivant, Norman Danner, 1999, Math. Struct. Comput. Sci..

On Linear Natural Deduction

Daniel Leivant, 1979 .

Proving termination assertions in dynamic logics

Daniel Leivant, D. Leivant, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

The Functions Provable by First Order Abstraction

Daniel Leivant, D. Leivant, 2001, LPAR.

Lambda Calculus Characterizations of Poly-Time

Daniel Leivant, Jean-Yves Marion, D. Leivant, 1993, Fundam. Informaticae.

Structural semantics for polymorphic data types (preliminary report)

Daniel Leivant, D. Leivant, 1983, POPL '83.

Finitism, imperative programs and primitive recursion

Daniel Leivant, 2021, J. Log. Comput..

Algorithmically Broad Languages for Polynomial Time and Space

Daniel Leivant, 2021, WoLLIC.

Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space

Daniel Leivant, Jean-Yves Marion, 2000 .

and complexity classes associated with type d~cipllnes

Daniel Leivant, 1983 .

Peano’s Lambda Calculus: The Functional Abstraction Implicit in Arithmetic

Daniel Leivant, D. Leivant, 2001 .

Strong normalization for arithmetic

Daniel Leivant, D. Leivant, 1975 .

Intuitionistic formal systems

Daniel Leivant, D. Leivant, 1985 .

Subrecursion and lambda representation over free algebras

Daniel Leivant, D. Leivant, 1990 .

Semantic Characterizations of Number Theories

Daniel Leivant, D. Leivant, 1992 .

Structural Semantics for Polymorphic Data Types.

Daniel Leivant, 1983 .