Simone Martini

Proceedings of the GoodIT '21: Conference on Information Technology for Social Good, 2021

2020

A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic.

[BibT_eX]

[DOI]

Margherita Zorzi

CoRR, 2020

The Standard Model for Programming Languages: The Birth of a Mathematical Theory of Computation.

[BibT_eX]

[DOI]

Proceedings of the Recent Developments in the Design and Implementation of Programming Languages, 2020

2018

Problem Solving Olympics: An Inclusive Education Model for Learning Informatics.

[BibT_eX]

[DOI]

Proceedings of the Informatics in Schools. Fundamentals of Computer Science and Software Engineering, 2018

2017

Quantum Turing Machines Computations and Measurements.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Light logics and higher-order processes.

[BibT_eX]

[DOI]

Davide Sangiorgi

Math. Struct. Comput. Sci., 2016

Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Towards A Theory Of Quantum Computability.

[BibT_eX]

[DOI]

CoRR, 2015

Several Types of Types in Programming Languages.

[BibT_eX]

[DOI]

Proceedings of the History and Philosophy of Computing - Third International Conference, 2015

2012

On Constructor Rewrite Systems and the Lambda Calculus

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

2010

Programming Languages: Principles and Paradigms.

[BibT_eX]

[DOI]

Maurizio Gabbrielli

Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84882-914-5, 2010

CSL 2008 special issue.

[BibT_eX]

[DOI]

Michael Kaminski

ACM Trans. Comput. Log., 2010

General Ramified Recurrence is Sound for Polynomial Time

[BibT_eX]

[DOI]

Margherita Zorzi

Proceedings of the Proceedings International Workshop on Developments in Implicit Computational complExity, 2010

2009

Derivational Complexity Is an Invariant Cost Model.

[BibT_eX]

[DOI]

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

2008

The weak lambda calculus as a reasonable machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2006

Optimizing optimal reduction: A type inference algorithm for elementary affine logic.

[BibT_eX]

[DOI]

Paolo Coppola

ACM Trans. Comput. Log., 2006

An Invariant Cost Model for the Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2004

Phase semantics and decidability of elementary affine logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

(Optimal) duplication is not elementary recursive.

[BibT_eX]

[DOI]

Andrea Asperti

Paolo Coppola

Inf. Comput., 2004

2003

Coherence for sharing proof-nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Higher-Order Linear Ramified Recurrence.

[BibT_eX]

[DOI]

Luca Roversi

Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2001

Proof nets, garbage, and computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Typing Lambda Terms in Elementary Logic with Linear Constraints.

[BibT_eX]

[DOI]

Paolo Coppola

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1998

An Analysis of (Linear) Exponentials Based on Extended Sequents.

[BibT_eX]

[DOI]

Log. J. IGPL, 1998

1997

Experiments in Linear Natural Deduction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

1994

A Modal View of Linear Logic.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

An Extension of System F with Subtyping

[BibT_eX]

[DOI]

Inf. Comput., 1994

Proof-functional connectives and realizability.

[BibT_eX]

[DOI]

Franco Barbanera

Arch. Math. Log., 1994

1993

Generating the analytic component parts of syntax-directed editors with efficient-error recovery.

[BibT_eX]

[DOI]

J. Syst. Softw., 1993

An 'Executable' Impredicative Semantics for the Ada Configuration.

[BibT_eX]

[DOI]

A. Bucci

Paola Inverardi

Formal Aspects Comput., 1993

1992

Categorical Models of Polymorphism

[BibT_eX]

[DOI]

Andrea Asperti

Inf. Comput., July, 1992

Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1992

1989

Is Type Checking Practical for System Configuration?

[BibT_eX]

[DOI]

Paola Inverardi

Carlo Montangero

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.

[BibT_eX]

Andrea Asperti

Proceedings of the Logic Programming, 1989

1988

Complete Logic Programs with Domain-Closure Axiom.

[BibT_eX]

[DOI]

Paolo Mancarella

Dino Pedreschi

J. Log. Program., 1988

1987

An Interval Model for Second-Order Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 1987

1986

Computability in Higher Types, P omega and the Completeness of Type Assignment.

[BibT_eX]

[DOI]

Giuseppe Longo

Theor. Comput. Sci., 1986

1984

Computability in Higher Types and the Universal Domain P_omega.

[BibT_eX]

[DOI]

Giuseppe Longo