BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Finland
1 × France
1 × Germany
1 × Italy
1 × Latvia
2 × Spain
2 × The Netherlands
3 × United Kingdom
6 × USA
Collaborated with:
∅ J.Marion R.Ramyaa T.Fernando A.Dawar
Talks about:
comput (8) polymorph (5) complex (5) logic (5) program (4) dynam (4) type (4) function (3) structur (2) stratifi (2)

Person: Daniel Leivant

DBLP DBLP: Leivant:Daniel

Contributed to:

FoSSaCS 20152015
CSL 20132013
ICALP (2) 20132013
FOSSACS 20092009
LICS 20062006
FoSSaCS 20042004
LICS 20042004
CSL 20022002
LICS 20022002
CSL 19991999
POPL 19931993
TLCA 19931993
LICS 19911991
LFP 19901990
LICS 19891989
POPL 19871987
POPL 19851985
POPL 19831983
STOC 19811981
TAPSOFT CAAP/FASE 19971997
CSL 20172017

Wrote 22 papers:

FoSSaCS-2015-LeivantR
The Computational Contents of Ramified Corecurrence (DL, RR), pp. 422–435.
CSL-2013-Leivant #induction #semantics #type system
Global semantic typing for inductive and coinductive computing (DL), pp. 469–483.
ICALP-v2-2013-LeivantM #complexity #evolution
Evolving Graph-Structures and Their Implicit Computational Complexity (DL, JYM), pp. 349–360.
FoSSaCS-2009-Leivant #logic #on the
On the Completeness of Dynamic Logic (DL), pp. 78–91.
LICS-2006-Leivant #logic #proving #reasoning #source code
Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic (DL), pp. 157–168.
FoSSaCS-2004-Leivant #correctness #logic
Partial Correctness Assertions Provable in Dynamic Logics (DL), pp. 304–317.
LICS-2004-Leivant #logic #proving #termination
Proving Termination Assertions in Dynamic Logics (DL), pp. 89–98.
CSL-2002-Leivant #complexity
Implicit Computational Complexity for Higher Type Functionals (DL), pp. 367–381.
LICS-2002-Leivant #abstraction #rank
Calibrating Computational Feasibility by Abstraction Rank (DL), p. 345–?.
CSL-1999-Leivant #complexity
Applicative Control and Computational Complexity (DL), pp. 82–95.
POPL-1993-Leivant #complexity #functional #source code
Stratified Functional Programs and Computational Complexity (DL), pp. 325–333.
TLCA-1993-LeivantM #λ-calculus
λ calculus characterizations of poly-time (DL, JYM), pp. 274–288.
LICS-1991-Leivant
A Foundational Delineation of Computational Feasiblity (DL), pp. 2–11.
LFP-1990-Leivant #morphism #polymorphism
Discrete Polymorphism (DL), pp. 288–297.
LICS-1989-Leivant #morphism #polymorphism
Stratified Polymorphism (DL), pp. 39–47.
POPL-1987-LeivantF
Skinny and Fleshy Failures of Relative Completeness (DL, TF), pp. 246–252.
POPL-1985-Leivant #imperative #logic #reasoning #source code
Logical and Mathematical Reasoning about Imperative Programs (DL), pp. 132–140.
POPL-1983-Leivant #polymorphism #type inference
Polymorphic Type Inference (DL), pp. 88–98.
POPL-1983-Leivant83a #data type #polymorphism #semantics
Structural Semantics for Polymorphic Data Types (DL), pp. 155–166.
STOC-1981-Leivant #complexity #independence #parametricity #polymorphism #programming language #theorem
The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) (DL), pp. 38–45.
TAPSOFT-1997-LeivantM #functional
Predicative Functional Recurrence and Poly-space (DL, JYM), pp. 369–380.
CSL-2017-DawarL
The Ackermann Award 2017 (AD, DL), p. 4.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.