Luís Pinto

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 12

Top Topics

Propositional Logic

Top Venues

J. Log. Algebraic Methods Program.

Math. Struct. Comput. Sci.

Publications

José Espírito Santo, Maria João Frade, Luís Pinto
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications. J. Log. Algebraic Methods Program. 131 (2023)
José Espírito Santo, Luís Pinto, Tarmo Uustalu
-calculus as a modal calculus. J. Log. Algebraic Methods Program. 127 (2022)
José Espírito Santo, Ralph Matthes, Luís Pinto
A coinductive approach to proof search through typed lambda-calculi. Ann. Pure Appl. Log. 172 (10) (2021)
José Espírito Santo, Ralph Matthes, Luís Pinto
Proof search for full intuitionistic propositional logic through a coinductive approach for polarized logic. CoRR (2020)
José Espírito Santo, Ralph Matthes, Luís Pinto
Coinductive Proof Search for Polarized Logic with Applications to Full Intuitionistic Propositional Logic. TYPES (2020)
José Espírito Santo, Ralph Matthes, Luís Pinto
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search. Math. Struct. Comput. Sci. 29 (8) (2019)
José Espírito Santo, Luís Pinto, Tarmo Uustalu
Modal Embeddings and Calling Paradigms. FSCD (2019)
José Espírito Santo, Ralph Matthes, Luís Pinto
Decidability of Several Concepts of Finiteness for Simple Types. Fundam. Informaticae 170 (1-3) (2019)
Luís Pinto, Tarmo Uustalu
A proof-theoretic study of bi-intuitionistic propositional sequent calculus. J. Log. Comput. 28 (1) (2018)
José Espírito Santo, Maria João Frade, Luís Pinto
Permutability in Proof Terms for Intuitionistic Sequent Calculus with Cuts. TYPES (2016)
José Espírito Santo, Ralph Matthes, Luís Pinto
A Coinductive Approach to Proof Search through Typed Lambda-Calculi. CoRR (2016)
José Espírito Santo, Ralph Matthes, Luís Pinto
Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search. CoRR (2016)
José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luís Pinto
Confluence for classical logic through the distinction between values and computations. CL&C (2014)
José Espírito Santo, Ralph Matthes, Luís Pinto
A Coinductive Approach to Proof Search. FICS (2013)
José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luís Pinto
Monadic translation of classical sequent calculus. Math. Struct. Comput. Sci. 23 (6) (2013)
José Espírito Santo, Luís Pinto
A calculus of multiary sequent terms. ACM Trans. Comput. Log. 12 (3) (2011)
Luís Pinto, Tarmo Uustalu
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic CL&C (2010)
Luís Pinto, Tarmo Uustalu
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents. TABLEAUX (2009)
José Espírito Santo, Ralph Matthes, Luís Pinto
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi Log. Methods Comput. Sci. 5 (2) (2009)
José Espírito Santo, Ralph Matthes, Luís Pinto
Monadic Translation of Intuitionistic Sequent Calculus. TYPES (2008)
José Espírito Santo, Ralph Matthes, Luís Pinto
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. TLCA (2007)
José Espírito Santo, Maria João Frade, Luís Pinto
Structural Proof Theory as Rewriting. RTA (2006)
Gilles Barthe, Maria João Frade, Eduardo Giménez, Luís Pinto, Tarmo Uustalu
Type-based termination of recursive definitions. Math. Struct. Comput. Sci. 14 (1) (2004)
José Espírito Santo, Luís Pinto
Confluence and Strong Normalisation of the Generalised Multiary ?-Calculus. TYPES (2003)
José Espírito Santo, Luís Pinto
Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts. TLCA (2003)
Roy Dyckhoff, Luís Pinto
Permutability of Proofs in Intuitionistic Sequent Calculi. Theor. Comput. Sci. 212 (1-2) (1999)
Luís Pinto, Roy Dyckhoff
Sequent Calculi for the Normal Terms of the - and - Calculi. Electron. Notes Theor. Comput. Sci. 17 (1998)
Roy Dyckhoff, Luís Pinto
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Stud Logica 60 (1) (1998)
Roy Dyckhoff, Luís Pinto
Uniform Proofs and Natural Deduction. ICLP Workshop: Proof-Theoretical Extensions on Logic Programming (1994)
Luís Pinto
Cut Formulae and Logic Programming. ELP (1993)