default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Leivant
Person information
- affiliation: Indiana University, Bloomington, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j30]Daniel Leivant:
Finitism, imperative programs and primitive recursion. J. Log. Comput. 31(1): 179-192 (2021)- 2020
- [j29]Daniel Leivant, Jean-Yves Marion:
Primitive recursion in the abstract. Math. Struct. Comput. Sci. 30(1): 33-43 (2020) - 2016
- [j28]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): 859 (2016) - 2014
- [j27]Daniel Leivant:
Global semantic typing for inductive and coinductive computing. Log. Methods Comput. Sci. 10(4) (2014) - 2013
- [j26]Daniel Leivant:
Alternating Turing machines for inductive languages. Log. Methods Comput. Sci. 9(3) (2013) - 2010
- [j25]Daniel Leivant, Ruy J. G. B. de Queiroz:
Logic, language, information and computation. Inf. Comput. 208(5): 395-396 (2010) - 2008
- [j24]Daniel Leivant:
Logical Undecidabilities Made Easy. Fundam. Informaticae 89(2-3): 307-312 (2008) - 2004
- [j23]Daniel Leivant:
Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion. Theor. Comput. Sci. 318(1-2): 181-196 (2004) - 2003
- [j22]Anuj Dawar, Daniel Leivant:
Guest editorial. Inf. Comput. 183(1): 1 (2003) - 2002
- [j21]Daniel Leivant:
Intrinsic reasoning about functional programs I: first order theories. Ann. Pure Appl. Log. 114(1-3): 117-153 (2002) - 2000
- [j20]Daniel Leivant, Jean-Yves Marion:
A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236(1-2): 193-208 (2000) - 1999
- [j19]Daniel Leivant:
Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. Ann. Pure Appl. Log. 96(1-3): 209-229 (1999) - [j18]Norman Danner, Daniel Leivant:
Stratified polymorphism and primitive recursion. Math. Struct. Comput. Sci. 9(4): 507-522 (1999) - 1994
- [j17]Daniel Leivant:
A Foundational Delineation of Poly-time. Inf. Comput. 110(2): 391-420 (1994) - 1993
- [j16]Daniel Leivant, Jean-Yves Marion:
Lambda Calculus Characterizations of Poly-Time. Fundam. Informaticae 19(1/2): 167-184 (1993) - [j15]Daniel Leivant:
Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. Theor. Comput. Sci. 121(1&2): 309-322 (1993) - 1991
- [j14]Daniel Leivant:
Finitely Stratified Polymorphism. Inf. Comput. 93(1): 93-113 (1991) - 1990
- [j13]Daniel Leivant:
Markov's Rule revisited. Arch. Math. Log. 30(2): 125-127 (1990) - [j12]Daniel Leivant:
Inductive Definitions Over Finite Structures. Inf. Comput. 89(2): 95-108 (1990) - 1989
- [j11]Daniel Leivant:
Descriptive Characterizations of Computational Complexity. J. Comput. Syst. Sci. 39(1): 51-83 (1989) - 1988
- [j10]Daniel Leivant, Tim Fernando:
Meager and replete failures of relative completeness. J. ACM 35(4): 953-964 (1988) - 1986
- [j9]Daniel Leivant:
Typing and Computational Properties of Lambda Expressions. Theor. Comput. Sci. 44: 51-68 (1986) - 1985
- [j8]Daniel Leivant:
Syntactic Translations and Provably Recursive Functions. J. Symb. Log. 50(3): 682-688 (1985) - 1983
- [j7]Steven Fortune, Daniel Leivant, Michael J. O'Donnell:
The Expressiveness of Simple and Second-Order Type Structures. J. ACM 30(1): 151-185 (1983) - [j6]Daniel Leivant:
The Optimality of Induction as an Axiomatization of Arithmetic. J. Symb. Log. 48(1): 182-184 (1983) - 1982
- [j5]Daniel Leivant:
Unprovability of Theorems of Complexity Theory in Weak Number Theories. Theor. Comput. Sci. 18: 259-268 (1982) - 1981
- [j4]Daniel Leivant:
Implicational Complexity in Intuitionistic Arithmetic. J. Symb. Log. 46(2): 240-248 (1981) - [j3]Daniel Leivant:
On the Proof Theory of the Modal Logic for Arithmetic Provability. J. Symb. Log. 46(3): 531-538 (1981) - 1980
- [j2]Daniel Leivant:
Innocuous Substitutions. J. Symb. Log. 45(2): 363-368 (1980) - 1979
- [j1]Daniel Leivant:
Assumption Classes in Natural Deduction. Math. Log. Q. 25(1-2): 1-4 (1979)
Conference and Workshop Papers
- 2021
- [c46]Daniel Leivant:
Algorithmically Broad Languages for Polynomial Time and Space. WoLLIC 2021: 372-387 - 2020
- [c45]Daniel Leivant:
Finitism, Imperative Programs and Primitive Recursion. LFCS 2020: 98-110 - 2017
- [c44]Anuj Dawar, Daniel Leivant:
The Ackermann Award 2017. CSL 2017: 1:1-1:4 - 2015
- [c43]Daniel Leivant, Ramyaa Ramyaa:
The Computational Contents of Ramified Corecurrence. FoSSaCS 2015: 422-435 - 2013
- [c42]Daniel Leivant:
Global semantic typing for inductive and coinductive computing. CSL 2013: 469-483 - [c41]Daniel Leivant, Jean-Yves Marion:
Evolving Graph-Structures and Their Implicit Computational Complexity. ICALP (2) 2013: 349-360 - 2012
- [c40]Daniel Leivant:
Alternating Turing machines and the analytical hierarchy. Turing-100 2012: 204-213 - 2011
- [c39]Daniel Leivant, Ramyaa Ramyaa:
Implicit complexity for coinductive data: a characterization of corecurrence. DICE 2011: 1-14 - [c38]Ramyaa Ramyaa, Daniel Leivant:
Ramified Corecurrence and Logspace. MFPS 2011: 247-261 - 2010
- [c37]Ramyaa Ramyaa, Daniel Leivant:
Feasible Functions over Co-inductive Data. WoLLIC 2010: 191-203 - 2009
- [c36]Daniel Leivant:
On the Completeness of Dynamic Logic. FoSSaCS 2009: 78-91 - 2008
- [c35]Daniel Leivant:
Reasoning in Dynamic Logic about Program Termination. Pillars of Computer Science 2008: 441-456 - [c34]Daniel Leivant:
Propositional Dynamic Logic for Recursive Procedures. VSTTE 2008: 6-14 - [c33]Daniel Leivant:
Inductive Completeness of Logics of Programs. LFMTP@LICS 2008: 101-112 - [c32]Daniel Leivant:
Propositional Dynamic Logic with Program Quantifiers. MFPS 2008: 231-240 - 2006
- [c31]Daniel Leivant:
Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. LICS 2006: 157-168 - 2005
- [c30]Daniel Leivant:
Partial Correctness Assertions Provable in Dynamic Logic. We Will Show Them! (2) 2005: 209-224 - 2004
- [c29]Daniel Leivant:
Partial Correctness Assertions Provable in Dynamic Logics. FoSSaCS 2004: 304-317 - [c28]Daniel Leivant:
Proving Termination Assertions in Dynamic Logics. LICS 2004: 89-98 - 2002
- [c27]Daniel Leivant:
Implicit Computational Complexity for Higher Type Functionals. CSL 2002: 367-381 - [c26]Daniel Leivant:
Substructural Verification and Computational Feasibility. IFIP TCS 2002: 498-510 - [c25]Daniel Leivant:
Calibrating Computational Feasibility by Abstraction Rank. LICS 2002: 345- - [c24]Daniel Leivant:
Feasible functionals and intersection of ramified types. ITRS 2002: 149-162 - 2001
- [c23]Daniel Leivant:
The Functions Provable by First Order Abstraction. LPAR 2001: 330-346 - [c22]Daniel Leivant:
Termination Proofs and Complexity Certification. TACS 2001: 183-200 - 1999
- [c21]Daniel Leivant:
Applicative Control and Computational Complexity. CSL 1999: 82-95 - 1998
- [c20]Daniel Leivant:
A Characterization of NC by Tree Recurrence. FOCS 1998: 716-724 - [c19]Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi:
Panel: logic in the computer science curriculum. SIGCSE 1998: 376-377 - 1997
- [c18]Daniel Leivant, Jean-Yves Marion:
Predicative Functional Recurrence and Poly-space. TAPSOFT 1997: 369-380 - 1994
- [c17]Daniel Leivant, Jean-Yves Marion:
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. CSL 1994: 486-500 - [c16]Daniel Leivant:
Intrinsic Theories and Computational Complexity. LCC 1994: 177-194 - [c15]Daniel Leivant:
Predicative Recurrence in Finite Types. LFCS 1994: 227-239 - 1993
- [c14]Daniel Leivant:
Stratified Functional Programs and Computational Complexity. POPL 1993: 325-333 - [c13]Daniel Leivant, Jean-Yves Marion:
Lambda calculus characterizations of poly-time. TLCA 1993: 274-288 - 1991
- [c12]Daniel Leivant:
A Foundational Delineation of Computational Feasiblity. LICS 1991: 2-11 - 1990
- [c11]Daniel Leivant:
Discrete Polymorphism. LISP and Functional Programming 1990: 288-297 - 1989
- [c10]Daniel Leivant:
Stratified Polymorphism (Extended Summary). LICS 1989: 39-47 - 1987
- [c9]Daniel Leivant:
Characterization of complexity classes in higher-order logic. SCT 1987: 203-217 - [c8]Daniel Leivant, Tim Fernando:
Skinny and Fleshy Failures of Relative Completeness. POPL 1987: 246-252 - 1985
- [c7]Daniel Leivant:
Partial-Correctness Theories as First-Order Theories. Logic of Programs 1985: 190-195 - [c6]Daniel Leivant:
Logical and Mathematical Reasoning about Imperative Programs. POPL 1985: 132-140 - 1983
- [c5]Daniel Leivant:
Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines. FOCS 1983: 460-469 - [c4]Daniel Leivant:
Polymorphic Type Inference. POPL 1983: 88-98 - [c3]Daniel Leivant:
Structural Semantics for Polymorphic Data Types. POPL 1983: 155-166 - 1981
- [c2]Daniel Leivant:
A Proof Theoretic Methodology for Propositional Dynamic Logic. ICFPC 1981: 356-373 - [c1]Daniel Leivant:
The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories). STOC 1981: 38-45
Parts in Books or Collections
- 1994
- [p1]Daniel Leivant:
Higher order logic. Handbook of Logic in Artificial Intelligence and Logic Programming (2) 1994: 229-322
Editorship
- 2015
- [e3]Valeria de Paiva, Ruy J. G. B. de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina Grisi de Oliveira:
Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings. Lecture Notes in Computer Science 9160, Springer 2015, ISBN 978-3-662-47708-3 [contents] - 2007
- [e2]Daniel Leivant, Ruy J. G. B. de Queiroz:
Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings. Lecture Notes in Computer Science 4576, Springer 2007, ISBN 978-3-540-73443-7 [contents] - 1995
- [e1]Daniel Leivant:
Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, Indiana, USA, 13-16 October 1994. Lecture Notes in Computer Science 960, Springer 1995, ISBN 3-540-60178-3 [contents]
Informal and Other Publications
- 2019
- [i3]Daniel Leivant:
A generic imperative language for polynomial time. CoRR abs/1911.04026 (2019) - 2018
- [i2]Daniel Leivant, Jean-Yves Marion:
Implicit complexity via structure transformation. CoRR abs/1802.03115 (2018) - [i1]Daniel Leivant:
A theory of finite structures. CoRR abs/1808.04949 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
