Bibliography of "Formal Methods in Computing"

Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)

Luca Paolini
Personal Home Page Chronological Overview
Type-Hierarchical Overview

Articles
- (2020) Paolini, Piccolo and Roversi
  "A class of Recursive Permutations which is Primitive Recursive complete"
- (2020) Matos, Paolini and Roversi
  "The fixed point problem of a simple reversible language"
- (2019) ter Beek, Damiani, Gnesi, Mazzanti and Paolini
  "On the expressiveness of modal transition systems with variability constraints"
- (2019) Paolini, Piccolo and Zorzi
  "QPCF: Higher-Order Languages and Quantum Circuits"
- (2019) Damiani, Lienhardt and Paolini
  "Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form"
- (2019) Damiani, Lienhardt and Paolini
  "A formal model for Multi Software Product Lines"
- (2018) Paolini, Piccolo and Roversi
  "On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions"
- (2017) Paolini, Piccolo and Ronchi Della Rocca
  "Essential and relational models"
- (2017) Guerrieri, Paolini and Ronchi Della Rocca
  "Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus"
- (2016) Paolini, Piccolo and Roversi
  "A Class of Reversible Primitive Recursive Functions"
- (2016) Paolini, Piccolo and Roversi
  "A Class of Reversible Primitive Recursive Functions"
- (2016) Gaboardi, Paolini and Piccolo
  "On the reification of semantic linearity"
- (2011) Paolini, Pimentel and Ronchi Della Rocca
  "Strong Normalization from an unusual point of view"
- (2008) Paolini
  "Parametric $λ$ -Theories"
- (2006) Paolini
  "A Stable Programming Language"
- (2004) Paolini and Ronchi Della Rocca
  "Parametric parameter passing lambda-calculus"
- (1999) Paolini and Ronchi Della Rocca
  "Call-by-value Solvability"
Books
- (2004) Ronchi Della Rocca and Paolini
  "The Parametric $λ$ -Calculus: a Metamodel for Computation"
In proceedings
- (2020) Matos, Paolini and Roversi
  "On the Expressivity of Total Reversible Programming Languages"
- (2019) ter Beek, Damiani, Lienhardt, Mazzanti and Paolini
  "Static Analysis of Featured Transition Systems"
- (2019) Paolini, Roversi and Zorzi
  "Quantum Programming Made Easy"
- (2018) Paolini, Roversi and Zorzi
  "Quantum programming made easy"
- (2018) Paolini, Piccolo and Roversi
  "A Certified Study of a Reversible Programming Language"
- (2018) Lienhardt, Damiani, Donetti and Paolini
  "Multi Software Product Lines in the Wild"
- (2017) Paolini and Zorzi
  "qPCF: a language for quantum circuit computations"
- (2017) Damiani, Lienhardt and Paolini
  "A Formal Model for Multi SPLs"
- (2017) Damiani, Lienhardt and Paolini
  " A Formal Model for Multi SPLs "
- (2015) ter Beek, Damiani, Gnesi, Mazzanti and Paolini
  "From Featured Transition Systems to Modal Transition Systems with Variability Constraints"
- (2015) Guerrieri, Paolini and Ronchi Della Rocca
  "Standardization for a Call-by-Value Lambda-Calculus"
- (2012) Accattoli and Paolini
  "Call-by-Value Solvability, Revisited"
- (2011) Gaboardi, Paolini and Piccolo
  "Linearity and PCF: a semantic insight!"
- (2009) Paolini, Piccolo and Ronchi Della Rocca
  "Logical Semantics for Stability"
- (2009) Paolini and Piccolo
  "A Process-Model for Linear Programs"
- (2008) Paolini and Piccolo
  "Semantically Linear Programming Languages"
- (2007) Gaboardi and Paolini
  "Syntactical, Operational and Denotational Linearity"
- (2007) Gaboardi and Paolini
  "Syntactical, Operational and Denotational Linearity"
- (2006) Paolini, Pimentel and Ronchi Della Rocca
  "An Operational Characterization of Strong Normalization"
- (2005) Paolini, Pimentel and Ronchi Della Rocca
  "Lazy strong normalization"
- (2004) Paolini and Ronchi Della Rocca
  "A fully abstract model for the lazy lambda-calculus"
- (2004) Paolini and Ronchi Della Rocca
  "Lazy Logical Semantics"
- (2002) Paolini
  "Call-by-Value Separability and Computability"
Master's thesis
- (2000) Paolini
  "Élements de Ludique"
- (1998) Paolini
  "La chiamata per Valore e La valutazione pigra nel $λ$ -calcolo"
PhD thesis
- (2004) Paolini
  "Lambda-theories: some investigations"
Technical reports
- (2018) Paolini, Piccolo and Zorzi
  "QPCF: higher order languages and quantum circuits"
- (2017) Paolini, Piccolo and Luca
  "A class of Recursive Permutations which is Primitive Recursive complete"
- (2015) Paolini, Piccolo and Roversi
  "Big and Small-step Operational Semantics of the Reversible Programming Language Janus"
Unpublished
- (2017) Paolini
  "Foundational principles of reversible and quantum computing: Quantum Computing"
- (2009) Paolini
  "Call-by-value lambda-calculus"
- (2009) Paolini
  "Parametric Lambda Calculus. A meta-calculus for computation"
- (2008) Paolini and Piccolo
  "Linear Programming Languages"
- (2007) Paolini
  "Denotational Paradigms"
- (2006) Paolini
  "Semantics of PCF and the full abstraction problem"

Edited Volumes

Conference proceedings
- (2013) Graham-Lengrand and Paolini
  "Proceedings Sixth Workshop on Intersection Types and Related Systems, ITRS 2012, Dubrovnik, Croatia, 29th June 2012"
- (2012) Ghilezan and Paolini
  "Revised Papers of the Conference "Intersection Types and Related Systems", Torino, Italia, 2008"
- (2010) Baillot, Curien and Paolini
  "Selected Papers of the Conference "Typed Lambda Calculi and Applications 2009", Brasilia, Brazil, 2009"

Chronological Overview

Type-Hierarchical Overview

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)