|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
| Mauro Piccolo | |
|---|---|
| Personal Home Page Type-Hierarchical Overview | |
| Chronological Overview | |
| 2020 | |
| Paolini, Piccolo and Roversi | "A class of Recursive Permutations which is Primitive Recursive complete" Article. |
| 2019 | |
| Paolini, Piccolo and Zorzi | "QPCF: Higher-Order Languages and Quantum Circuits" Article. |
| 2018 | |
| Paolini, Piccolo and Roversi | "A Certified Study of a Reversible Programming Language" In proceedings: LIPIcs. |
| Paolini, Piccolo and Roversi | "On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions" Article: New Generation Computing. |
| Paolini, Piccolo and Zorzi | "QPCF: higher order languages and quantum circuits" Technical report. |
| 2017 | |
| Paolini, Piccolo and Luca | "A class of Recursive Permutations which is Primitive Recursive complete" Technical report. |
| Paolini, Piccolo and Ronchi Della Rocca | "Essential and relational models" Article: Mathematical Structures in Computer Science. |
| 2016 | |
| Gaboardi, Paolini and Piccolo | "On the reification of semantic linearity" Article: Mathematical Structures in Computer Science. |
| Paolini, Piccolo and Roversi | "A Class of Reversible Primitive Recursive Functions" Article: Electronic Notes in Theoretical Computer Science. |
| Paolini, Piccolo and Roversi | "A Class of Reversible Primitive Recursive Functions" Article. |
| 2015 | |
| Paolini, Piccolo and Roversi | "Big and Small-step Operational Semantics of the Reversible Programming Language Janus" Technical report. |
| 2014 | |
| Gaboardi and Piccolo | "What is a model for a semantically linear -calculus?" Article. |
| Piccolo, Sacerdoti Coen and Tranquilli | "The labelling approach to precise resource analysis on the source code, revisited" Unpublished. |
| 2013 | |
| Amadio, Ayache, Bobot, Boender, Campbell, Garnier, Madet, McKinna, Mulligan, Piccolo, Pollack, Régis-Gianas, Coen, Stark and Tranquilli | "Certified Complexity (CerCo)" In proceedings. |
| 2011 | |
| Gaboardi, Paolini and Piccolo | "Linearity and PCF: a semantic insight!" In proceedings: ICFP 2011. |
| 2010 | |
| Piccolo | "Strong Normalization in the -calculus with Intersection and Union Types" Article. |
| 2009 | |
| Faggian and Piccolo | "Partial Orders, Event Structures and Linear Strategies" In proceedings. |
| Gaboardi and Piccolo | "Categorical Models for a Semantically Linear -calculus" In proceedings. |
| Paolini and Piccolo | "A Process-Model for Linear Programs" In proceedings. |
| Paolini, Piccolo and Ronchi Della Rocca | "Logical Semantics for Stability" In proceedings: MFPS 2009. |
| Piccolo | "Linearity and Beyond in Denotational Semantics" PhD thesis. |
| 2008 | |
| Paolini and Piccolo | "Linear Programming Languages" Unpublished. |
| Paolini and Piccolo | "Semantically Linear Programming Languages" In proceedings: PPDP 2008. |
| Piccolo | "Strong Normalization in the -calculus with Intersection and Union Types" Unpublished. |
| 2007 | |
| Faggian and Piccolo | "A Graph Abstract Machine Describing Event Structure Composition" Article. |
| Faggian and Piccolo | "Ludics is a Model for the Finitary Linear Pi-Calculus" In proceedings. |
| 2006 | |
| Piccolo | "Strutture ad Eventi e Strategie: un Ponte fra Teoria della Concorrenza e Semantica dei Giochi" Master's thesis: Tesi di Laurea in Informatica. |
|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)