- Home
- Top Scientists - Computer Science
- Luca Cardelli

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
68
Citations
23,352
149
World Ranking
926
National Ranking
55

2006 - Member of Academia Europaea

2005 - Fellow of the Royal Society, United Kingdom

2004 - ACM Fellow For contributions to object-oriented programming languages.

- Programming language
- Artificial intelligence
- Algorithm

Programming language, Theoretical computer science, Ambient calculus, Algorithm and Computation are his primary areas of study. His research ties Abstract type and Programming language together. His study in the field of Linear temporal logic, Dynamic logic and Temporal logic of actions is also linked to topics like Modal logic.

His Ambient calculus research is multidisciplinary, incorporating perspectives in Calculus, Calculus and Artificial intelligence. His research on Algorithm also deals with topics like

- Subtyping and Type constructor most often made with reference to Discrete mathematics,
- Lambda calculus that intertwine with fields like Recursive data type and Parametric polymorphism. His research in the fields of DNA computing overlaps with other disciplines such as Interpreted language.

- On understanding types, data abstraction, and polymorphism (1523 citations)
- A Theory of Objects (966 citations)
- Mobile ambients (961 citations)

The scientist’s investigation covers issues in Programming language, Theoretical computer science, Algorithm, Computation and Algebra. Programming language is represented through his Object, Subtyping, Typed lambda calculus, Semantics and Formal semantics research. His Subtyping research includes themes of Object type and Calculus.

He studies Process calculus which is a part of Theoretical computer science. Luca Cardelli merges Algorithm with Gaussian process in his study. His research on Computation often connects related topics like Ambient calculus.

- Programming language (26.71%)
- Theoretical computer science (18.24%)
- Algorithm (15.64%)

- Applied mathematics (11.40%)
- Gaussian process (4.89%)
- Probabilistic logic (12.38%)

His primary areas of investigation include Applied mathematics, Gaussian process, Probabilistic logic, Robustness and Algorithm. His Applied mathematics study combines topics in areas such as Qualitative reasoning, Equivalence, Reachability and Equivalence relation. His studies deal with areas such as Target distribution, Countable set, Norm, Theory of computation and Complex system as well as Probabilistic logic.

His work in Ode addresses subjects such as Ordinary differential equation, which are connected to disciplines such as Polynomial, Theoretical computer science, Perspective and Concurrency. In his research on the topic of Theoretical computer science, Formal methods is strongly related with Abstraction. Luca Cardelli works mostly in the field of Replication, limiting it down to concerns involving Task and, occasionally, Process calculus.

- Computing with biological switches and clocks (30 citations)
- Computing with biological switches and clocks (30 citations)
- ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations (30 citations)

- Programming language
- Artificial intelligence
- Algorithm

His main research concerns Theory of computation, Applied mathematics, Probabilistic logic, Complex system and Abstraction. The concepts of his Applied mathematics study are interwoven with issues in Equivalence, Markov chain and Equivalence relation. His work carried out in the field of Probabilistic logic brings together such families of science as MNIST database and Robustness.

His research integrates issues of Qualitative reasoning, Target distribution, Countable set, Systems biology and Norm in his study of Complex system. His Abstraction research incorporates elements of Correctness, Electronic design automation, Network topology, Function and Syntax. The study incorporates disciplines such as Polynomial and Ordinary differential equation in addition to Calculus.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On understanding types, data abstraction, and polymorphism

Luca Cardelli;Peter Wegner.

ACM Computing Surveys **(1985)**

2867 Citations

Mobile ambients

Luca Cardelli;Andrew D. Gordon.

Theoretical Computer Science **(2000)**

2552 Citations

A Theory of Objects

Martin Abadi;Luca Cardelli.

**(1996)**

1911 Citations

A semantics of multiple inheritance

Luca Cardelli.

Information & Computation **(1988)**

1392 Citations

Explicit substitutions

M. Abadi;L. Cardelli;P.-L. Curien;J.-J. Levy.

symposium on principles of programming languages **(1989)**

1017 Citations

A language with distributed scope

Luca Cardelli.

symposium on principles of programming languages **(1995)**

819 Citations

Subtyping recursive types

Roberto M. Amadio;Luca Cardelli.

ACM Transactions on Programming Languages and Systems **(1993)**

669 Citations

Type systems

Luca Cardelli.

ACM Computing Surveys **(1996)**

647 Citations

BioAmbients: an abstraction for biological compartments

Aviv Regev;Ekaterina M. Panina;William Silverman;Luca Cardelli.

computational methods in systems biology **(2004)**

619 Citations

GALILEO: a strongly-typed, interactive conceptual language

Antonio Albano;Luca Cardelli;Renzo Orsini.

ACM Transactions on Database Systems **(1985)**

577 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

University of California, Santa Cruz

University of Oxford

Microsoft (United States)

University of Oxford

University of Pennsylvania

Stanford University

University of Edinburgh

University of Oxford

University of Bologna

University of Pisa

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.