Logical Foundations of Computation (Logic)
Staff
- Berardi Stefano (Coordinator)
- Cardone Felice (Member)
- De' Liguoro Ugo (Member)
- Paolini Luca Luigi (Member)
- Roversi Luca (Member)
- Treglia Riccardo (Collaborator)
- (Collaborator)
- Ronchi Della Rocca Simonetta (Member)
- Margherita Zorzi (External Collaborator)
Contacts
- + 39 011 670 6750
- stefano@di.unito.it
- Send email to members
Activity
Computer Science is a key discipline in the context of modern society. Despite its technological advances, Computer Science is still immature from the scientific point of view. Just think of the difficulties to certify --- functionally and in terms of resources used, for example --- the correctness of the compositions of software modules running within a distributed environment. Our background and our scientific inclinations will help us to contribute to an advancement of foundational knowledge about computing inside Past and current collaborations activities.
Our favourite method is to analyse aspects of mathematical abstractions who bought a central importance in the theory of computation, even after the birth of new computational models which are based on the physics of computational processes andwhich also urge to look with a new awareness issues such as the traditional distributed and asynchronous
computing. In general, these are problems of interaction between processes in space and time, where time and space are in turn reconsidered in a key computational. We work according to a vision that puts the construction of theories which help to explain the concept of "calculation" to the center of our research. We are focused on the foundational aspects of the technical concepts that we study, rather than to the solution of individual contingent problems. The belief is that the computational science, as such, has an absolute need for a revision of both its mathematical and, in a broad sense, philosophical bases.
- (2013-2015) "Linear Techniques For The Analysis Of Languages (LINTEL)" TO_Call1_2012_0085 with Paolini as principal investigator,
- (2012-2015) PRIN "Metodi Logici per il trattamento dell'informazione" with Berardi as local coordinator,
- (2012-2014) Royal Society’s joint project "Sharing and Sequentiality in Proof Systems with Locality" in collaboration with the University of Bath and Roversi oversea coordinator,
- (2010-2012) INRIA’s equipe associeé "Contrôle des Ressources par Interprétations Sémantiques et Théorie de la démonstration Linéaire (CRISTAL)" with Ronchi Della Rocca as local coordinator,
- (2010-2012) CNRS Project International de Coopération Scientifique "Logique Lineaire et applications (PICS)" with Ronchi Della Rocca as local coordinator,
- (2007-2009) PRIN "Control and Certification of Resources" with Ronchi Della Rocca as local coordinator,
- MCTAAP 2008H49TEH_002 (2010-2012) with Berardi as local coordinator,
- (2004-2007) EU 6th framework programme with Berardi as local coordinator,
- (2004-2006) PRIN "Logical Foundations of Abstract Programming Languages (FOLLIA)" with Ronchi Della Rocca as national coordinator,
- (2000-2006) MCTAAP projects, with Berardi as local coordinator,
- (2002-2004) PRIN "From Proofs to Computation Through Linear Logic (PROTOCOLLO)" with Ronchi Della Rocca as national coordinator.
Dr. Mauro Piccolo
Dott.ssa Silvia Steila
Erika Debenedetti
Luca Fossati
Marco Gaboardi
Luigi Liquori
Michele Pagani
Alberto Pravato
Alexis Saurin
Luca Vercelli
Stefano Berardi
+ 39 011 670 6750
stefano@di.unito.it
Publications
A class of Recursive Permutations which is Primitive Recursive complete
THEORETICAL COMPUTER SCIENCE, 2020
The fixed point problem of a simple reversible language
THEORETICAL COMPUTER SCIENCE, 2020
On the expressiveness of modal transition systems with variability constraints
SCIENCE OF COMPUTER PROGRAMMING, 2019
A formal model for Multi Software Product Lines
SCIENCE OF COMPUTER PROGRAMMING, 2019
QPCF: Higher-Order Languages and Quantum Circuits
JOURNAL OF AUTOMATED REASONING, 2019
Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form
INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2019
New Semantical Insights Into Call-by-Value λ-Calculus.
FUNDAMENTA INFORMATICAE, 2019
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions
NEW GENERATION COMPUTING, 2018
Inhabitation for non-idempotent intersection types
LOGICAL METHODS IN COMPUTER SCIENCE, 2018
Essential and relational models
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2017
Non-monotonic Pre-fix Points and Learning
FUNDAMENTA INFORMATICAE, 2017
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
LOGICAL METHODS IN COMPUTER SCIENCE, 2017
Ramsey's theorem for pairs and K colors as a sub-classical principle of arithmetic
JOURNAL OF SYMBOLIC LOGIC, 2017
Classical system of Martin-Lof's inductive definitions is not equivalent to cyclic proof system
LECTURE NOTES IN COMPUTER SCIENCE, 2017
On the reification of semantic linearity
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2016
A type assignment for lambda-calculus complete both for FPTIME and strong normalization
INFORMATION AND COMPUTATION, 2016
L’eredità di Carl Adam Petri: dagli automi alla comunicazione
MONDO DIGITALE, 2016
Tiered objects
FUNDAMENTA INFORMATICAE, 2016
Light combinators for finite fields arithmetic
SCIENCE OF COMPUTER PROGRAMMING, 2015
An intuitionistic version of Ramsey Theorem and its use in Program Termination
ANNALS OF PURE AND APPLIED LOGIC, 2015
An analysis of the Podelski–Rybalchenko termination theorem via bar recursion
JOURNAL OF LOGIC AND COMPUTATION, 2015
Continuity in Semantic Theories of Programming
HISTORY AND PHILOSOPHY OF LOGIC, 2015
Development on Implicit Computational Complexity (DICE 2013)
INFORMATION AND COMPUTATION, 2016
Special Issue on Foundational and Practical Aspects of Resource Analysis (FOPARA) 2009 & 2011
SCIENCE OF COMPUTER PROGRAMMING, 2015
A certified study of a reversible programming language
21st International Conference on Types for Proofs and Programs (TYPES 2015), 2018
Le direzioni della ricerca logica in Italia: Logica e Informatica
Le direzioni della ricerca logica in Italia, 2015
Quantum programming made easy
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE,
2018 Joint International Workshop on Linearity and Trends in Linear Logic and Applications, Linearity-TLLA 2018
2019
Static analysis of featured transition systems
ACM International Conference Proceeding Series,
23rd International Systems and Software Product Line Conference, SPLC 2019
2019
Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
15th International Conference on Integrated Formal Methods, IFM 2019
2019
Lambda Calculus and Probabilistic Computation.
Logic in Computer science,
Logic in Computer Science
2019
Multi software product lines in the wild
ACM International Conference Proceeding Series,
12th International Workshop on Variability Modelling of Software-Intensive Systems, VaMoS 2018
2018
The fixed point problem for general and for linear SRL programs is undecidable
CEUR Workshop Proceedings,
19th Italian Conference on Theoretical Computer Science, ICTCS 2018
2018
Intuitionistic podelski-rybalchenko theorem and equivalence between inductive definitions and cyclic proofs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
14th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2018 Colocated with ETAPS 2018
2018
qPCF: A language for quantum circuit computations
14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017,
14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017
2017
A Formal Model for Multi SPLs
Fundamentals of Software Engineering. FSEN 2017,
7th International Conference on Fundamentals of Software Engineering, FSEN 2017
2017
Equivalence of inductive definitions and cyclic proofs under arithmetic
Proceedings - Symposium on Logic in Computer Science,
32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017
2017
A Class of Reversible Primitive Recursive Functions
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE,
ICTCS2015
2016
From Featured Transition Systems to Modal Transition Systems with Variability Constraints
Software Engineering and Formal Methods,
13th International Conference on Software Engineering and Formal Methods, SEFM 2015
2015
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
24th EACSL Annual Conference on Computer Science Logic,,
CSL 2015
2015
Observability for Pair Pattern Calculi
Typed Lambda Calculus and Applications,
Typed Lambda Calculus and Applications
2015
Standardization of a Call-By-Value Lambda-Calculus
13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015),
Typed Lambda Calculus and Applications
2015
Computers and the Mechanics of Communication
Evolving Computability,
11th Conference on Computability in Europe, CiE 2015
2015