Daniel Leivant

83 papers A* 13A 1B 11C 4Misc 2Journal 33Unranked 17

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