Daniel Lima Ventura

Orcid: 0000-0001-5141-0438

According to our database1, Daniel Lima Ventura authored at least 18 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Node Replication: Theory And Practice.
Log. Methods Comput. Sci., 2024

2022
Quantitative Weak Linearisation.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

2021
A subexponential view of domains in session types.
Proceedings of the Proceedings 16th Logical and Semantic Frameworks with Applications, 2021

The Spirit of Node Replication.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2019
A resource aware semantics for a focused intuitionistic calculus.
Math. Struct. Comput. Sci., 2019

A Quantitative Understanding of Pattern Matching.
Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

2018
Nominal essential intersection types.
Theor. Comput. Sci., 2018

2017
Non-idempotent intersection types for the Lambda-Calculus.
Log. J. IGPL, 2017

2015
Explicit substitution calculi with de Bruijn indices and intersection type systems.
Log. J. IGPL, 2015

Strong Normalization through Intersection Types and Memory.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

A Resource Aware Computational Interpretation for Herbelin's Syntax.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Automath Type Inclusion in Barendregt's Cube.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Formalizing a Named Explicit Substitutions Calculus in Coq.
Proceedings of the Joint Proceedings of the MathUI, 2014

Quantitative Types for the Linear Substitution Calculus.
Proceedings of the Theoretical Computer Science, 2014

2010
Intersection Type Systems and Explicit Substitutions Calculi.
Proceedings of the Logic, 2010

2009
Explicit substitutions calculi with one step Eta-reduction decided explicitly.
Log. J. IGPL, 2009

Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices
Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

2008
Principal Typings for Explicit Substitutions Calculi.
Proceedings of the Logic and Theory of Algorithms, 2008


  Loading...