Simona Ronchi Della Rocca

According to our database1, Simona Ronchi Della Rocca authored at least 74 papers between 1974 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
New Semantical Insights Into Call-by-Value λ-Calculus.
Fundam. Inform., 2019

Lambda Calculus and Probabilistic Computation.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Inhabitation for Non-idempotent Intersection Types.
Logical Methods in Computer Science, 2018

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.
Inf. Comput., 2018

Observability = Typability + Inhabitation.
CoRR, 2018

2017
Essential and relational models.
Mathematical Structures in Computer Science, 2017

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus.
Logical Methods in Computer Science, 2017

2016
Preface.
Inf. Comput., 2016

A type assignment for λ-calculus complete both for FPTIME and strong normalization.
Inf. Comput., 2016

Intersection Types and Denotational Semantics: An Extended Abstract (Invited Paper).
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.
Sci. Comput. Program., 2015

Standardization of a Call-By-Value Lambda-Calculus.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Observability for Pair Pattern Calculi.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Call-by-Value, Elementary Time and Intersection Types.
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2015

The Ackermann Award 2015.
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.
CoRR, 2014

The Inhabitation Problem for Non-idempotent Intersection Types.
Proceedings of the Theoretical Computer Science, 2014

2012
An Implicit Characterization of PSPACE.
ACM Trans. Comput. Log., 2012

Intersection Types from a Proof-theoretic Perspective.
Fundam. Inform., 2012

Standardization in resource lambda-calculus
Proceedings of the Proceedings 2nd International Workshop on Linearity, 2012

Bounding normalization time through intersection types.
Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

2011
Strong normalization from an unusual point of view.
Theor. Comput. Sci., 2011

2010
Linearity, Non-determinism and Solvability.
Fundam. Inform., 2010

Intersection Logic in sequent calculus style
Proceedings of the Proceedings Fifth Workshop on Intersection Types and Related Systems, 2010

Solvability in Resource Lambda-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
Guest editorial: Special issue on implicit computational complexity.
ACM Trans. Comput. Log., 2009

From light logics to type assignments: a case study.
Logic Journal of the IGPL, 2009

Logical Semantics for Stability.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Intersection, Universally Quantified, and Reference Types.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
Light Logics and the Call-by-Value Lambda Calculus.
Logical Methods in Computer Science, 2008

Soft Linear Logic and Polynomial Complexity Classes.
Electr. Notes Theor. Comput. Sci., 2008

Type Inference for a Polynomial Lambda Calculus.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

A logical account of pspace.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

2007
Intersection-types à la Church.
Inf. Comput., 2007

A Soft Type Assignment System for lambda -Calculus.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
An Operational Characterization of Strong Normalization.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Principal Typing for Lambda Calculus in Elementary Affine Logic.
Fundam. Inform., 2005

Lazy Strong Normalization.
Electr. Notes Theor. Comput. Sci., 2005

Towards an Intersection Typed System à la Church.
Electr. Notes Theor. Comput. Sci., 2005

Elementary Affine Logic and the Call-by-Value Lambda Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2004
The Parametric Lambda Calculus - A Metamodel for Computation
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-10394-4, 2004

Parametric parameter passing Lambda-calculus.
Inf. Comput., 2004

Lazy Logical Semantics.
Electr. Notes Theor. Comput. Sci., 2004

2003
Principal Typing in Elementary Affine Logic.
Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

2002
Intersection Typed lambda-calculus.
Electr. Notes Theor. Comput. Sci., 2002

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

2000
Operational semantics and extensionality.
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.
Mathematical Structures in Computer Science, 1999

Call-by-value Solvability.
ITA, 1999

Alpha-Conversion and Typability.
Inf. Comput., 1999

1998
Structured Operational Semantics of a Fragment of the Language Scheme.
J. Funct. Program., 1998

Structures for lazy semantics.
Proceedings of the Programming Concepts and Methods, 1998

1997
Lambda Calculus and Intuitionistic Linear Logic.
Studia Logica, 1997

Comparing Cubes of Typed and Type Assignment Systems.
Ann. Pure Appl. Logic, 1997

1995
Categorical semantics of the call-by-value lambda-calculus.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
A Type Inference Algorithm for a Stratified Polymorphic Type Discipline
Inf. Comput., 1994

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

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

1993
Type Inference: Some Results, Some Problems.
Fundam. Inform., 1993

1992
An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus.
J. Comput. Syst. Sci., 1992

Operational, denotational and logical descriptions: a case study.
Fundam. Inform., 1992

1991
Type Inference in Polymorphic Type Discipline.
Proceedings of the Theoretical Aspects of Computer Software, 1991

The lazy call-by-value Lamda-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
Reasoning About Interpretations in Qualitative λ-Models.
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.
Theor. Comput. Sci., 1988

Characterization of typings in polymorphic type discipline
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
An Unification Semi-Algorithm for Intersection Type Schemes.
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.
Theor. Comput. Sci., 1984

1982
Characterization Theorems for a Filter Lambda Model
Information and Control, September, 1982

1981
Discriminability of Infinite Sets of Terms in the Dinfinity-Models of the lambda-calculus.
Proceedings of the CAAP '81, 1981

1979
A Discrimination Algorithm Inside lambda-beta-Calculus.
Theor. Comput. Sci., 1979

Complexity of lambda-term reductions.
ITA, 1979

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

1974
Listing of information structures defined by fixed-point operators.
Proceedings of the Programming Symposium, 1974


  Loading...