Luís Pinto

474 total citations
19 papers, 162 citations indexed

About

Luís Pinto is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Philosophy. According to data from OpenAlex, Luís Pinto has authored 19 papers receiving a total of 162 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 13 papers in Computational Theory and Mathematics and 2 papers in Philosophy. Recurrent topics in Luís Pinto's work include Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (15 papers) and Formal Methods in Verification (8 papers). Luís Pinto is often cited by papers focused on Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (15 papers) and Formal Methods in Verification (8 papers). Luís Pinto collaborates with scholars based in Portugal, France and United Kingdom. Luís Pinto's co-authors include Gilles Barthe, Roy Dyckhoff, Tarmo Uustalu, Peter Dybjer, João Saraiva, João M. Fernandes, Sérgio Sousa and Ralph Matthes and has published in prestigious journals such as Theoretical Computer Science, Procedia Manufacturing and Annals of Pure and Applied Logic.

In The Last Decade

Luís Pinto

16 papers receiving 151 citations

Peers

Luís Pinto
Ben Moszkowski United Kingdom
Kamal Lodaya India
Corina Ĉırstea United Kingdom
Rajeev Goré Australia
Benedikt Bollig France
Reinhold Letz Germany
Calogero G. Zarba Italy
Paul Hoogendijk Netherlands
Laurent Théry France
Udi Boker Israel
Ben Moszkowski United Kingdom
Luís Pinto
Citations per year, relative to Luís Pinto Luís Pinto (= 1×) peers Ben Moszkowski

Countries citing papers authored by Luís Pinto

Since Specialization
Citations

This map shows the geographic impact of Luís Pinto'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 Luís Pinto with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luís Pinto more than expected).

Fields of papers citing papers by Luís Pinto

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luís Pinto. 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 Luís Pinto. The network helps show where Luís Pinto may publish in the future.

Co-authorship network of co-authors of Luís Pinto

This figure shows the co-authorship network connecting the top 25 collaborators of Luís Pinto. A scholar is included among the top collaborators of Luís Pinto 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 Luís Pinto. Luís Pinto is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
1.
Pinto, Luís, et al.. (2022). Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications. Journal of Logical and Algebraic Methods in Programming. 131. 100830–100830.
2.
Pinto, Luís, et al.. (2022). Plotkin's call-by-value λ-calculus as a modal calculus. Journal of Logical and Algebraic Methods in Programming. 127. 100775–100775.
3.
Matthes, Ralph, et al.. (2021). A coinductive approach to proof search through typed lambda-calculi. Annals of Pure and Applied Logic. 172(10). 103026–103026. 1 indexed citations
4.
Pinto, Luís, et al.. (2020). A framework to improve training and development of workers’ technical skills: effects on operational performance during company relocation. Procedia Manufacturing. 51. 1806–1813. 10 indexed citations
5.
Matthes, Ralph, et al.. (2019). Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
6.
Matthes, Ralph, et al.. (2019). Decidability of Several Concepts of Finiteness for Simple Types. Fundamenta Informaticae. 170(1-3). 111–138. 1 indexed citations
7.
Pinto, Luís, et al.. (2019). Modal Embeddings and Calling Paradigms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
8.
Pinto, Luís, et al.. (2018). Permutability in Proof Terms for Intuitionistic Sequent Calculus with Cuts. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 97. 27. 1 indexed citations
9.
Pinto, Luís & Tarmo Uustalu. (2017). A proof-theoretic study of bi-intuitionistic propositional sequent calculus. Journal of Logic and Computation. 28(1). 165–202. 4 indexed citations
10.
Matthes, Ralph, et al.. (2013). Monadic translation of classical sequent calculus. Mathematical Structures in Computer Science. 23(6). 1111–1162.
11.
Pinto, Luís, et al.. (2011). A calculus of multiary sequent terms. ACM Transactions on Computational Logic. 12(3). 1–41. 1 indexed citations
12.
Matthes, Ralph, et al.. (2009). Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. Logical Methods in Computer Science. Volume 5, Issue 2. 1 indexed citations
13.
Fernandes, João M., et al.. (2005). Model Checking Embedded Systems with PROMELA. 2460. 378–385. 17 indexed citations
14.
Barthe, Gilles, et al.. (2004). Type-based termination of recursive definitions. Mathematical Structures in Computer Science. 14(1). 97–141. 49 indexed citations
15.
Barthe, Gilles, Peter Dybjer, Luís Pinto, & João Saraiva. (2000). Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures. 38 indexed citations
16.
Dyckhoff, Roy & Luís Pinto. (1999). Permutability of proofs in intuitionistic sequent calculi. Theoretical Computer Science. 212(1-2). 141–155. 17 indexed citations
17.
Dyckhoff, Roy & Luís Pinto. (1998). Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica. 60(1). 107–118. 13 indexed citations
18.
Pinto, Luís & Roy Dyckhoff. (1998). Sequent Calculi for the Normal Terms of the λΠ- and λΠ∑-Calculi. Electronic Notes in Theoretical Computer Science. 17. 1–14. 2 indexed citations
19.
Dyckhoff, Roy & Luís Pinto. (1994). Uniform Proofs and Natural Deduction.. International Conference on Lightning Protection. 3 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

Breakdown of academic impact, for papers by Ben Moszkowski Breakdown of academic impact, for papers by Kamal Lodaya Breakdown of academic impact, for papers by Corina Ĉırstea Breakdown of academic impact, for papers by Rajeev Goré Breakdown of academic impact, for papers by Benedikt Bollig Breakdown of academic impact, for papers by Reinhold Letz Breakdown of academic impact, for papers by Calogero G. Zarba Breakdown of academic impact, for papers by Paul Hoogendijk Breakdown of academic impact, for papers by Laurent Théry Breakdown of academic impact, for papers by Udi Boker
Rankless by CCL
2026