Luís Pinto

32 papers B 2Journal 15Unranked 13
YearRankTypeTitle / Venue / Authors
2023 J jnl
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications.
J. Log. Algebraic Methods Program.
José Espírito Santo, Maria João Frade, Luís Pinto
2022 J jnl
Plotkin's call-by-value
J. Log. Algebraic Methods Program.
José Espírito Santo, Luís Pinto, Tarmo Uustalu
2021 J jnl
A coinductive approach to proof search through typed lambda-calculi.
Ann. Pure Appl. Log.
José Espírito Santo, Ralph Matthes, Luís Pinto
2020 — conf
Coinductive Proof Search for Polarized Logic with Applications to Full Intuitionistic Propositional Logic.
TYPES
José Espírito Santo, Ralph Matthes, Luís Pinto
2020 J jnl
Proof search for full intuitionistic propositional logic through a coinductive approach for polarized logic.
CoRR
José Espírito Santo, Ralph Matthes, Luís Pinto
2019 — ed.
24th International Conference on Types for Proofs and Programs, TYPES 2018, Braga, Portugal, June 18-21, 2018
TYPES
Peter Dybjer, José Espírito Santo, Luís Pinto
2019 J jnl
Decidability of Several Concepts of Finiteness for Simple Types.
Fundam. Informaticae
José Espírito Santo, Ralph Matthes, Luís Pinto
2019 J jnl
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search.
Math. Struct. Comput. Sci.
José Espírito Santo, Ralph Matthes, Luís Pinto
2019 B conf
Modal Embeddings and Calling Paradigms.
FSCD
José Espírito Santo, Luís Pinto, Tarmo Uustalu
2018 J jnl
A proof-theoretic study of bi-intuitionistic propositional sequent calculus.
J. Log. Comput.
Luís Pinto, Tarmo Uustalu
2016 J jnl
A Coinductive Approach to Proof Search through Typed Lambda-Calculi.
CoRR
José Espírito Santo, Ralph Matthes, Luís Pinto
2016 J jnl
Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search.
CoRR
José Espírito Santo, Ralph Matthes, Luís Pinto
2016 — conf
Permutability in Proof Terms for Intuitionistic Sequent Calculus with Cuts.
TYPES
José Espírito Santo, Maria João Frade, Luís Pinto
2014 — conf
Confluence for classical logic through the distinction between values and computations.
CL&C
José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luís Pinto
2013 — conf
A Coinductive Approach to Proof Search.
FICS
José Espírito Santo, Ralph Matthes, Luís Pinto
2013 J jnl
Monadic translation of classical sequent calculus.
Math. Struct. Comput. Sci.
José Espírito Santo, Ralph Matthes, Koji Nakazawa, Luís Pinto
2011 J jnl
A calculus of multiary sequent terms.
ACM Trans. Comput. Log.
José Espírito Santo, Luís Pinto
2010 — conf
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic
CL&C
Luís Pinto, Tarmo Uustalu
2009 J jnl
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
Log. Methods Comput. Sci.
José Espírito Santo, Ralph Matthes, Luís Pinto
2009 B conf
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents.
TABLEAUX
Luís Pinto, Tarmo Uustalu
2008 — conf
Monadic Translation of Intuitionistic Sequent Calculus.
TYPES
José Espírito Santo, Ralph Matthes, Luís Pinto
2007 — conf
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.
TLCA
José Espírito Santo, Ralph Matthes, Luís Pinto
2006 — conf
Structural Proof Theory as Rewriting.
RTA
José Espírito Santo, Maria João Frade, Luís Pinto
2004 J jnl
Type-based termination of recursive definitions.
Math. Struct. Comput. Sci.
Gilles Barthe, Maria João Frade, Eduardo Giménez, Luís Pinto, Tarmo Uustalu
2003 — conf
Confluence and Strong Normalisation of the Generalised Multiary ?-Calculus.
TYPES
José Espírito Santo, Luís Pinto
2003 — conf
Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts.
TLCA
José Espírito Santo, Luís Pinto
2002 — ed.
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
APPSEM
Gilles Barthe, Peter Dybjer, Luís Pinto, João Saraiva
1999 J jnl
Permutability of Proofs in Intuitionistic Sequent Calculi.
Theor. Comput. Sci.
Roy Dyckhoff, Luís Pinto
1998 J jnl
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic.
Stud Logica
Roy Dyckhoff, Luís Pinto
1998 — conf
Sequent Calculi for the Normal Terms of the - and - Calculi.
Proof Search in Type-Theoretic Languages@CADE
Luís Pinto, Roy Dyckhoff
1994 — conf
Uniform Proofs and Natural Deduction.
ICLP Workshop: Proof-Theoretical Extensions on Logic Programming
Roy Dyckhoff, Luís Pinto
1993 — conf
Cut Formulae and Logic Programming.
ELP
Luís Pinto