Daniel Lima Ventura

Loïc Peyrot

Log. Methods Comput. Sci., 2024

2022

Quantitative Weak Linearisation.

[BibT_eX]

[DOI]

Sandra Alves

Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

2021

A subexponential view of domains in session types.

[BibT_eX]

[DOI]

Daniele Nantes

Carlos Olarte

Proceedings of the Proceedings 16th Logical and Semantic Frameworks with Applications, 2021

The Spirit of Node Replication.

[BibT_eX]

[DOI]

Loïc Peyrot

Proceedings of the Foundations of Software Science and Computation Structures, 2021

2019

A resource aware semantics for a focused intuitionistic calculus.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2019

A Quantitative Understanding of Pattern Matching.

[BibT_eX]

[DOI]

Sandra Alves

Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

2018

Nominal essential intersection types.

[BibT_eX]

[DOI]

Ana Cristina Rocha Oliveira

Maribel Fernández

Theor. Comput. Sci., 2018

2017

Non-idempotent intersection types for the Lambda-Calculus.

[BibT_eX]

[DOI]

Antonio Bucciarelli

Log. J. IGPL, 2017

2015

Explicit substitution calculi with de Bruijn indices and intersection type systems.

[BibT_eX]

[DOI]

Log. J. IGPL, 2015

Strong Normalization through Intersection Types and Memory.

[BibT_eX]

[DOI]

Antonio Bucciarelli

Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

A Resource Aware Computational Interpretation for Herbelin's Syntax.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Automath Type Inclusion in Barendregt's Cube.

[BibT_eX]

[DOI]

Joe B. Wells

Washington de Carvalho Segundo

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Formalizing a Named Explicit Substitutions Calculus in Coq.

[BibT_eX]

[DOI]

Flávio L. C. de Moura

Proceedings of the Joint Proceedings of the MathUI, 2014

Quantitative Types for the Linear Substitution Calculus.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

2010

Intersection Type Systems and Explicit Substitutions Calculi.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2010

2009

Explicit substitutions calculi with one step Eta-reduction decided explicitly.

[BibT_eX]

[DOI]

Log. J. IGPL, 2009

Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

2008

Principal Typings for Explicit Substitutions Calculi.

[BibT_eX]

[DOI]