Antonio Bucciarelli

CoRR, 2023

2022

Sequent calculi of finite dimension.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Solvability = Typability + Inhabitation.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

2019

On noncommutative generalisations of Boolean algebras.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2019

2018

Inhabitation for Non-idempotent Intersection Types.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Observability = Typability + Inhabitation.

[BibT_eX]

[DOI]

CoRR, 2018

Boolean-like algebras of finite dimension.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Non-idempotent intersection types for the Lambda-Calculus.

[BibT_eX]

[DOI]

Daniel Ventura

Log. J. IGPL, 2017

2016

Graph easy sets of mute lambda terms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Strong Normalization through Intersection Types and Memory.

[BibT_eX]

[DOI]

Daniel Ventura

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

Observability for Pair Pattern Calculi.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

2014

The Inhabitation Problem for Non-idempotent Intersection Types.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

A graph-easy class of mute lambda-terms.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2012

Minimal lambda-theories by ultraproducts

[BibT_eX]

[DOI]

Alberto Carraro

Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

A relational semantics for parallelism and non-determinism in a functional setting.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

2011

Extensional Collapse Situations I: non-termination and unrecoverable errors

[BibT_eX]

[DOI]

CoRR, 2011

Full Abstraction for Resource Calculus with Tests.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2011

2010

Categorical Models for Simply Typed Resource Calculi.

[BibT_eX]

[DOI]

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

2009

On Linear Information Systems

[BibT_eX]

[DOI]

Proceedings of the Proceedings First International Workshop on Linearity, 2009

A Relational Model of a Parallel and Non-deterministic lambda-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008

Graph lambda theories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

2007

Not Enough Points Is Enough.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2004

The Sensible Graph Theories of Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Hypergraphs and Degrees of Parallelism: A Completeness Result.

[BibT_eX]

[DOI]

Benjamin Leperchey

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

2003

Intersection Types and lambda-Definability.

[BibT_eX]

[DOI]

Adolfo Piperno

Ivano Salvo

Math. Struct. Comput. Sci., 2003

Relative Definability and Models of Unary PCF.

[BibT_eX]

[DOI]

Benjamin Leperchey

Vincent Padovani

Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

The Minimal Graph Model of Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Relative definability of boolean functions via hypergraphs.

[BibT_eX]

[DOI]

Pasquale Malacaria

Theor. Comput. Sci., 2002

2001

On phase semantics and denotational semantics: the exponentials.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2001

2000

On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2000

1999

Some Computational Properties of Intersection Types.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Totality, Definability and Boolean Ciruits.

[BibT_eX]

[DOI]

Ivano Salvo

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Degrees of Parallelism in the Continuous Type Hierarchy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Bi-Models: Relational Versus Domain-Theoretic Approaches.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Logical Reconstruction of Bi-domains.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1997

1994

Sequentiality in an Extensional Framework

[BibT_eX]

[DOI]

Inf. Comput., May, 1994

1993

A Theory of Sequentiality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Another Approach to Sequentiality: Kleene's Unimonotone Functions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1991

Sequentiality and Strong Stability

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Extensional Embedding of a Strongly Stable Model of PCF.

[BibT_eX]

[DOI]