Simona Ronchi Della Rocca

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2021

Intersection types and (positive) almost-sure termination.

[BibT_eX]

[DOI]

Claudia Faggian

Proc. ACM Program. Lang., 2021

Solvability = Typability + Inhabitation.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Call-By-Value, Again!

[BibT_eX]

[DOI]

Axel Kerinec

Giulio Manzonetto

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020

Solvability in a Probabilistic Setting (Invited Talk).

[BibT_eX]

[DOI]

Claudia Faggian

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

New Semantical Insights Into Call-by-Value λ-Calculus.

[BibT_eX]

[DOI]

Giulio Manzonetto

Michele Pagani

Fundam. Informaticae, 2019

Lambda Calculus and Probabilistic Computation.

[BibT_eX]

[DOI]

Claudia Faggian

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Inhabitation for Non-idempotent Intersection Types.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.

[BibT_eX]

[DOI]

Patrick Baillot

Inf. Comput., 2018

Observability = Typability + Inhabitation.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Essential and relational models.

[BibT_eX]

[DOI]

Mauro Piccolo

Math. Struct. Comput. Sci., 2017

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus.

[BibT_eX]

[DOI]

Giulio Guerrieri

Log. Methods Comput. Sci., 2017

2016

Preface.

[BibT_eX]

[DOI]

Inf. Comput., 2016

A type assignment for λ-calculus complete both for FPTIME and strong normalization.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Intersection Types and Denotational Semantics: An Extended Abstract (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

2015

Preface of the special issue on Foundational and Practical Aspects of Resource Analysis (FOPARA) 2009 & 2011.

[BibT_eX]

[DOI]

Olha Shkaravska

Marko C. J. D. van Eekelen

Sci. Comput. Program., 2015

Standardization of a Call-By-Value Lambda-Calculus.

[BibT_eX]

[DOI]

Giulio Guerrieri

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

Observability for Pair Pattern Calculi.

[BibT_eX]

[DOI]

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

Call-by-Value, Elementary Time and Intersection Types.

[BibT_eX]

[DOI]

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2015

The Ackermann Award 2015.

[BibT_eX]

[DOI]

Anuj Dawar

Dexter Kozen

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

A type assignment for lambda-calculus complete both for FPTIME and strong normalization.

[BibT_eX]

[DOI]

CoRR, 2014

The Inhabitation Problem for Non-idempotent Intersection Types.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

2012

An Implicit Characterization of PSPACE.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

Intersection Types from a Proof-theoretic Perspective.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Standardization in resource lambda-calculus

[BibT_eX]

[DOI]

Maurizio Dominici

Paolo Tranquilli

Proceedings of the Proceedings 2nd International Workshop on Linearity, 2012

Bounding normalization time through intersection types.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

2011

Strong normalization from an unusual point of view.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

Linearity, Non-determinism and Solvability.

[BibT_eX]

[DOI]

Michele Pagani

Fundam. Informaticae, 2010

Intersection Logic in sequent calculus style

[BibT_eX]

[DOI]

Alexis Saurin

Yiorgos Stavrinos

Anastasia Veneti

Proceedings of the Proceedings Fifth Workshop on Intersection Types and Related Systems, 2010

Solvability in Resource Lambda-Calculus.

[BibT_eX]

[DOI]

Michele Pagani

Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009

Guest editorial: Special issue on implicit computational complexity.

[BibT_eX]

[DOI]

Patrick Baillot

ACM Trans. Comput. Log., 2009

From light logics to type assignments: a case study.

[BibT_eX]

[DOI]

Log. J. IGPL, 2009

Logical Semantics for Stability.

[BibT_eX]

[DOI]

Mauro Piccolo

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Intersection, Universally Quantified, and Reference Types.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

Light Logics and the Call-by-Value Lambda Calculus.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Type Inference for a Polynomial Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, International Conference, 2008

A logical account of pspace.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

2007

Intersection-types à la Church.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Soft Linear Logic and Polynomial Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Logical and Semantic Frameworks, with Applications, 2007

A Soft Type Assignment System for lambda -Calculus.

[BibT_eX]

[DOI]

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

2006

An Operational Characterization of Strong Normalization.

[BibT_eX]

[DOI]

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

2005

Principal Typing for Lambda Calculus in Elementary Affine Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Elementary Affine Logic and the Call-by-Value Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2004

The Parametric Lambda Calculus - A Metamodel for Computation

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-10394-4, 2004

Parametric parameter passing Lambda-calculus.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Lazy Strong Normalization.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

Towards an Intersection Typed System à la Church.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

2003

Lazy Logical Semantics.

[BibT_eX]

[DOI]

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Principal Typing in Elementary Affine Logic.

[BibT_eX]

[DOI]

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

2002

Intersection Typed lambda-calculus.

[BibT_eX]

[DOI]

Proceedings of the Intersection Types and Related Systems, 2002

2001

Intersection Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Operational semantics and extensionality.

[BibT_eX]

[DOI]

Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

1999

The call-by-value [lambda]-calculus: a semantic investigation.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1999

Call-by-value Solvability.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

Alpha-Conversion and Typability.

[BibT_eX]

[DOI]

A. J. Kfoury

Jerzy Tiuryn

Pawel Urzyczyn

Inf. Comput., 1999

1998

Structured Operational Semantics of a Fragment of the Language Scheme.

[BibT_eX]

[DOI]

J. Funct. Program., 1998

Structures for lazy semantics.

[BibT_eX]

Olivier Bastonero

Proceedings of the Programming Concepts and Methods, 1998

1997

Lambda Calculus and Intuitionistic Linear Logic.

[BibT_eX]

[DOI]

Stud Logica, 1997

Comparing Cubes of Typed and Type Assignment Systems.

[BibT_eX]

[DOI]

Steffen van Bakel

Pawel Urzyczyn

Ann. Pure Appl. Log., 1997

1995

Categorical semantics of the call-by-value lambda-calculus.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1995

1994

A Type Inference Algorithm for a Stratified Polymorphic Type Discipline

[BibT_eX]

[DOI]

Inf. Comput., 1994

Type Inference and Extensionality

[BibT_eX]

[DOI]

Adolfo Piperno

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Comparing Cubes.

[BibT_eX]

[DOI]

Steffen van Bakel

Pawel Urzyczyn

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Type Inference: Some Results, Some Problems.

[BibT_eX]

Fundam. Informaticae, 1993

1992

An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1992

Operational, denotational and logical descriptions: a case study.

[BibT_eX]

Lavinia Egidi

Fundam. Informaticae, 1992

1991

Type Inference in Polymorphic Type Discipline.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1991

The lazy call-by-value Lamda-Calculus.

[BibT_eX]

[DOI]

Lavinia Egidi

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

Reasoning About Interpretations in Qualitative λ-Models.

[BibT_eX]

Proceedings of the Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 1990

1988

Principal Type Scheme and Unification for Intersection Type Discipline.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Characterization of typings in polymorphic type discipline

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

An Unification Semi-Algorithm for Intersection Type Schemes.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1984

Principal Type Schemes for an Extended Type Theory.

[BibT_eX]

[DOI]

Betti Venneri

Theor. Comput. Sci., 1984

1982

Characterization Theorems for a Filter Lambda Model

[BibT_eX]

[DOI]

Inf. Control., September, 1982

1981

Discriminability of Infinite Sets of Terms in the Dinfinity-Models of the lambda-calculus.

[BibT_eX]

[DOI]

Proceedings of the CAAP '81, 1981

1979

A Discrimination Algorithm Inside lambda-beta-Calculus.

[BibT_eX]

[DOI]

Corrado Böhm

P. Peretti

Theor. Comput. Sci., 1979

Complexity of lambda-term reductions.

[BibT_eX]

[DOI]

Lorenza Saitta

RAIRO Theor. Informatics Appl., 1979

1978

(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus.

[BibT_eX]

[DOI]

Mario Coppo

Proceedings of the Automata, 1978

1974

Listing of information structures defined by fixed-point operators.

[BibT_eX]

[DOI]

Corrado Böhm