Steffen van Bakel

755 total citations
38 papers, 313 citations indexed

About

Steffen van Bakel is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Steffen van Bakel has authored 38 papers receiving a total of 313 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Artificial Intelligence, 29 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in Steffen van Bakel's work include Logic, programming, and type systems (36 papers), Logic, Reasoning, and Knowledge (26 papers) and Formal Methods in Verification (20 papers). Steffen van Bakel is often cited by papers focused on Logic, programming, and type systems (36 papers), Logic, Reasoning, and Knowledge (26 papers) and Formal Methods in Verification (20 papers). Steffen van Bakel collaborates with scholars based in United Kingdom, Italy and Netherlands. Steffen van Bakel's co-authors include Maribel Fernández, Ugo de’Liguoro, Pierre Lescanne, Franco Barbanera, Mariangiola Dezani-Ciancaglini, Luigi Liquori, Simona Ronchi Della Rocca, Paweł Urzyczyn, Roseriet Beijers and Annemie M.W.J. Schols and has published in prestigious journals such as SHILAP Revista de lepidopterología, ACM Computing Surveys and Theoretical Computer Science.

In The Last Decade

Steffen van Bakel

35 papers receiving 295 citations

Peers

Steffen van Bakel

AI

CTM

CNC

SOFTW

GT

Alban Ponse Netherlands

Bartek Klin Poland

Vincent van Oostrom Netherlands

Corina Ĉırstea United Kingdom

Guy McCusker United Kingdom

Michel Parigot France

Fairouz Kamareddine United Kingdom

Clemens Ballarin Germany

Marino Miculan Italy

Daniele Varacca France

Alban Ponse Netherlands

Steffen van Bakel

185 ×0.6

AI

202 ×0.8

CTM

22 ×1.1

CNC

21 ×1.4

SOFTW

6 ×0.6

GT

Citations per year, relative to Steffen van Bakel Steffen van Bakel (= 1×) peers Alban Ponse

Countries citing papers authored by Steffen van Bakel

Since Specialization

Citations

This map shows the geographic impact of Steffen van Bakel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Steffen van Bakel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Steffen van Bakel more than expected).

Fields of papers citing papers by Steffen van Bakel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Steffen van Bakel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Steffen van Bakel. The network helps show where Steffen van Bakel may publish in the future.

Co-authorship network of co-authors of Steffen van Bakel

This figure shows the co-authorship network connecting the top 25 collaborators of Steffen van Bakel. A scholar is included among the top collaborators of Steffen van Bakel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Steffen van Bakel. Steffen van Bakel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Bakel, Steffen van. (2023). Adding Negation to Lambda Mu. Logical Methods in Computer Science. Volume 19, Issue 2.

2.

Bakel, Steffen van. (2019). Exception Handling and Classical Logic. Spiral (Imperial College London). 902. 1–14. 1 indexed citations

3.

Bakel, Steffen van, Franco Barbanera, & Ugo de’Liguoro. (2018). Intersection Types for the lambda-mu Calculus. Logical Methods in Computer Science. Volume 14, Issue 1.

4.

Bakel, Steffen van. (2017). Characterisation of Approximation and (Head) Normalisation for λμ using Strict Intersection Types. SHILAP Revista de lepidopterología. 242. 20–30. 1 indexed citations

5.

Barbanera, Franco, Steffen van Bakel, & Ugo de’Liguoro. (2016). Orchestrated session compliance. Journal of Logical and Algebraic Methods in Programming. 86(1). 30–76. 4 indexed citations

6.

Barbanera, Franco, Steffen van Bakel, & Ugo de’Liguoro. (2015). Orchestrated Session Compliance. SHILAP Revista de lepidopterología. 189. 21–36. 1 indexed citations

7.

Bakel, Steffen van. (2010). Completeness and partial soundness results for intersection and union typing forλ¯μμ. Annals of Pure and Applied Logic. 161(11). 1400–1430. 4 indexed citations

8.

Bakel, Steffen van, et al.. (2009). Semantic predicate types and approximation for class-based object oriented programming. 1–7. 1 indexed citations

9.

Bakel, Steffen van. (2008). The heart of intersection type assignment: Normalisation proofs revisited. Theoretical Computer Science. 398(1-3). 82–94. 6 indexed citations

10.

Bakel, Steffen van & Pierre Lescanne. (2008). Computation with classical sequents. Mathematical Structures in Computer Science. 18(3). 555–609. 8 indexed citations

11.

Bakel, Steffen van & Ugo de’Liguoro. (2007). Logical Equivalence for Subtyping Object and Recursive Types. Theory of Computing Systems. 42(3). 306–348. 6 indexed citations

12.

Bakel, Steffen van. (2006). The Heart of Intersection Type Assignment. HAL (Le Centre pour la Communication Scientifique Directe). 34. 1 indexed citations

13.

Bakel, Steffen van & Ugo de’Liguoro. (2003). Logical Semantics for the First Order varsigma-Calculus.. 202–215. 1 indexed citations

14.

Bakel, Steffen van, et al.. (2002). Intersection types for λ-trees. Theoretical Computer Science. 272(1-2). 3–40. 4 indexed citations

15.

Bakel, Steffen van & Maribel Fernández. (2002). Normalization, approximation, and semantics for combinator systems. Theoretical Computer Science. 290(1). 975–1019. 6 indexed citations

16.

Bakel, Steffen van, Luigi Liquori, Simona Ronchi Della Rocca, & Paweł Urzyczyn. (1997). Comparing cubes of typed and type assignment systems. Annals of Pure and Applied Logic. 86(3). 267–303. 9 indexed citations

17.

Bakel, Steffen van & Maribel Fernández. (1997). Normalization Results for Typeable Rewrite Systems. Information and Computation. 133(2). 73–116. 16 indexed citations

18.

Bakel, Steffen van. (1995). Intersection type assignment systems. Theoretical Computer Science. 151(2). 385–435. 58 indexed citations

19.

Bakel, Steffen van. (1993). Principal Type Schemes for the Strict Type Assignment System. Journal of Logic and Computation. 3(6). 643–670. 19 indexed citations

20.

Bakel, Steffen van. (1992). Complete restrictions of the intersection type discipline. Theoretical Computer Science. 102(1). 135–163. 83 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact