Simone Martini

According to our database1, Simone Martini authored at least 36 papers between 1984 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Problem Solving Olympics: An Inclusive Education Model for Learning Informatics.
Proceedings of the Informatics in Schools. Fundamentals of Computer Science and Software Engineering, 2018

2016
Light logics and higher-order processes.
Mathematical Structures in Computer Science, 2016

Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Several Types of Types in Programming Languages.
Proceedings of the History and Philosophy of Computing - Third International Conference, 2015

2012
On Constructor Rewrite Systems and the Lambda Calculus
Logical Methods in Computer Science, 2012

2010
Programming Languages: Principles and Paradigms.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84882-914-5, 2010

CSL 2008 special issue.
ACM Trans. Comput. Log., 2010

Light Logics and Higher-Order Processes
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

General Ramified Recurrence is Sound for Polynomial Time
Proceedings of the Proceedings International Workshop on Developments in Implicit Computational complExity, 2010

2009
On Constructor Rewrite Systems and the Lambda-Calculus.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Derivational Complexity Is an Invariant Cost Model.
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008
The weak lambda calculus as a reasonable machine.
Theor. Comput. Sci., 2008

2006
Optimizing optimal reduction: A type inference algorithm for elementary affine logic.
ACM Trans. Comput. Log., 2006

An Invariant Cost Model for the Lambda Calculus.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2004
Phase semantics and decidability of elementary affine logic.
Theor. Comput. Sci., 2004

2003
Higher-Order Linear Ramified Recurrence.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2001
Typing Lambda Terms in Elementary Logic with Linear Constraints.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

2000
(Optimal) Duplication is not Elementary Recursive.
Proceedings of the POPL 2000, 2000

1998
An Analysis of (Linear) Exponentials Based on Extended Sequents.
Logic Journal of the IGPL, 1998

1997
Experiments in Linear Natural Deduction.
Theor. Comput. Sci., 1997

Proof Nets, Garbage, and Computations.
Proceedings of the Typed Lambda Calculi and Applications, 1997

1996
Coherence for Sharing Proof Nets.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1994
A Modal View of Linear Logic.
J. Symb. Log., 1994

An Extension of System F with Subtyping
Inf. Comput., 1994

Proof-functional connectives and realizability.
Arch. Math. Log., 1994

1993
Generating the analytic component parts of syntax-directed editors with efficient-error recovery.
Journal of Systems and Software, 1993

An 'Executable' Impredicative Semantics for the Ada Configuration.
Formal Asp. Comput., 1993

1992
Categorical Models of Polymorphism
Inf. Comput., July, 1992

Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic.
Mathematical Structures in Computer Science, 1992

1991
An Extension of System F with Subtyping.
Proceedings of the Theoretical Aspects of Computer Software, 1991

1989
Is Type Checking Practical for System Configuration?
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs.
Proceedings of the Logic Programming, 1989

1988
Complete Logic Programs with Domain-Closure Axiom.
J. Log. Program., 1988

1987
An Interval Model for Second-Order Lambda Calculus.
Proceedings of the Category Theory and Computer Science, 1987

1986
Computability in Higher Types, P omega and the Completeness of Type Assignment.
Theor. Comput. Sci., 1986

1984
Computability in Higher Types and the Universal Domain P_omega.
Proceedings of the STACS 84, 1984


  Loading...