Daniel Leivant

J. Log. Comput., 2021

Algorithmically Broad Languages for Polynomial Time and Space.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2021

2020

Primitive recursion in the abstract.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

2019

A generic imperative language for polynomial time.

[BibT_eX]

[DOI]

CoRR, 2019

2018

A theory of finite structures.

[BibT_eX]

[DOI]

CoRR, 2018

Implicit complexity via structure transformation.

[BibT_eX]

[DOI]

CoRR, 2018

2017

The Ackermann Award 2017.

[BibT_eX]

[DOI]

Anuj Dawar

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

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

[BibT_eX]

[DOI]

Valeria de Paiva

Lawrence S. Moss

Ruy J. G. B. de Queiroz

Log. J. IGPL, 2016

2015

The Computational Contents of Ramified Corecurrence.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

Global semantic typing for inductive and coinductive computing.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

2013

Alternating Turing machines for inductive languages.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Evolving Graph-Structures and Their Implicit Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Alternating Turing machines and the analytical hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Turing-100, 2012

2011

Ramified Corecurrence and Logspace.

[BibT_eX]

[DOI]

Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Implicit complexity for coinductive data: a characterization of corecurrence

[BibT_eX]

[DOI]

Proceedings of the Proceedings Second Workshop on Developments in Implicit Computational Complexity, 2011

2010

Logic, language, information and computation.

[BibT_eX]

[DOI]

Ruy J. G. B. de Queiroz

Inf. Comput., 2010

Feasible Functions over Co-inductive Data.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2010

2009

On the Completeness of Dynamic Logic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008

Logical Undecidabilities Made Easy.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Inductive Completeness of Logics of Programs.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Logical Frameworks and Metalanguages: Theory and Practice, 2008

Propositional Dynamic Logic with Program Quantifiers.

[BibT_eX]

[DOI]

Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Propositional Dynamic Logic for Recursive Procedures.

[BibT_eX]

[DOI]

Proceedings of the Verified Software: Theories, 2008

Reasoning in Dynamic Logic about Program Termination.

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

2006

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

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

Partial Correctness Assertions Provable in Dynamic Logic.

[BibT_eX]

Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two, 2005

2004

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Proving Termination Assertions in Dynamic Logics.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Partial Correctness Assertions Provable in Dynamic Logics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

Guest editorial.

[BibT_eX]

[DOI]

Anuj Dawar

Inf. Comput., 2003

2002

Feasible functionals and intersection of ramified types.

[BibT_eX]

[DOI]

Proceedings of the Intersection Types and Related Systems, 2002

Intrinsic reasoning about functional programs I: first order theories.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2002

Calibrating Computational Feasibility by Abstraction Rank.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Substructural Verification and Computational Feasibility.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Implicit Computational Complexity for Higher Type Functionals.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Termination Proofs and Complexity Certification.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

The Functions Provable by First Order Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2001

2000

A characterization of alternating log time by ramified recurrence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

Stratified polymorphism and primitive recursion.

[BibT_eX]

[DOI]

Norman Danner

Math. Struct. Comput. Sci., 1999

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

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

Applicative Control and Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998

Panel: logic in the computer science curriculum.

[BibT_eX]

[DOI]

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

A Characterization of NC by Tree Recurrence.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Predicative Functional Recurrence and Poly-space.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1994

A Foundational Delineation of Poly-time

[BibT_eX]

[DOI]

Inf. Comput., May, 1994

Predicative Recurrence in Finite Types.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

Intrinsic Theories and Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

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

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 8th International Workshop, 1994

Higher order logic.

[BibT_eX]

Proceedings of the Handbook of Logic in Artificial Intelligence and Logic Programming, 1994

1993

Functions Over Free Algebras Definable in the Simply Typed lambda Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Lambda Calculus Characterizations of Poly-Time.

[BibT_eX]

Fundam. Informaticae, 1993

Stratified Functional Programs and Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1991

Finitely Stratified Polymorphism

[BibT_eX]

[DOI]

Inf. Comput., July, 1991

A Foundational Delineation of Computational Feasiblity

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990

Inductive Definitions Over Finite Structures

[BibT_eX]

[DOI]

Inf. Comput., December, 1990

Markov's Rule revisited.

[BibT_eX]

[DOI]

Arch. Math. Log., 1990

Discrete Polymorphism.

[BibT_eX]

[DOI]

Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

1989

Descriptive Characterizations of Computational Complexity.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1989

Stratified Polymorphism (Extended Summary)

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988

Meager and replete failures of relative completeness.

[BibT_eX]

[DOI]

Tim Fernando

J. ACM, 1988

1987

Skinny and Fleshy Failures of Relative Completeness.

[BibT_eX]

[DOI]

Tim Fernando

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Characterization of complexity classes in higher-order logic.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

Typing and Computational Properties of Lambda Expressions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1985

Syntactic Translations and Provably Recursive Functions.

[BibT_eX]

[DOI]

J. Symb. Log., 1985

Logical and Mathematical Reasoning about Imperative Programs.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

Partial-Correctness Theories as First-Order Theories.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1985

1983

The Expressiveness of Simple and Second-Order Type Structures

[BibT_eX]

[DOI]

Steven Fortune

Michael J. O'Donnell

J. ACM, January, 1983

The Optimality of Induction as an Axiomatization of Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 1983

Structural Semantics for Polymorphic Data Types.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

Polymorphic Type Inference.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Unprovability of Theorems of Complexity Theory in Weak Number Theories.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

1981

On the Proof Theory of the Modal Logic for Arithmetic Provability.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

Implicational Complexity in Intuitionistic Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories)

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

A Proof Theoretic Methodology for Propositional Dynamic Logic.

[BibT_eX]

[DOI]

Proceedings of the Formalization of Programming Concepts, 1981

1980

Innocuous Substitutions.

[BibT_eX]

[DOI]

J. Symb. Log., 1980

1979

Assumption Classes in Natural Deduction.

[BibT_eX]

[DOI]