Matteo Cimini's publications



  1. Extrinsically Typed Operational Semantics for Functional Languages.
    Matteo Cimini, Dale Miller, Jeremy G. Siek.
    To appear in Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2020), November 2020.
  2. On the Effectiveness of Higher-Order Logic Programming in Language-Oriented Programming.
    Matteo Cimini.
    In Proceedings of the 15th International Symposium on Functional and Logic Programming (FLOPS 2020), pages 106-123, April 2020.
  3. System Description: Lang-n-Change - A Tool for Transforming Languages.
    Benjamin Mourad, Matteo Cimini.
    In Proceedings of the 15th International Symposium on Functional and Logic Programming (FLOPS 2020), pages 198-214, April 2020.
  4. A Calculus for Language Transformations.
    Benjamin Mourad, Matteo Cimini.
    In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), pages 547-555, Limassol, Cyprus, January 2020.
  5. Early Experience in Teaching the Basics of Functional Language Design with a Language Type Checker.
    Matteo Cimini.
    In Proceedings of the 20th International Symposium on Trends in Functional Programming (TFP 2019), pages 21-37, Vancouver, Canada, June 2019.
  6. Towards Gradually Typed Capabilities in the Pi-Calculus.
    Matteo Cimini.
    In Proceedings of the 12th Interaction and Concurrency Experience (ICE 2019), pages 61--76, Copenhagen, Denmark, June 2019.
  7. Proceedings of the 30th Symposium on Implementation and Application of Functional Languages (IFL 2018).
    Matteo Cimini, Jay McCarthy.
    Edited volume of the proceedings of IFL 2018, Lowell, MA, USA -- September 05 - 07, 2018.
  8. Languages as First-Class Citizens (Vision Paper).
    Matteo Cimini.
    In Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2018), pages 65-69, Boston, USA, November 2018.
  9. Ghostbuster: A Tool for Simplifying and Converting GADTs.
    Timothy Zakian, Trevor McDonell, Matteo Cimini, Ryan Newton.
    In the journal Journal of Functional Programming (JFP), Volume 28, e16, 2018.
  10. Automatically Generating the Dynamic Semantics of Gradually Typed Languages.
    Matteo Cimini and Jeremy Siek.
    In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017), pages 789-803, Paris, France, January 2017.
  11. Fractional Permissions for Race-Free Mutable References in a Dataflow Intermediate Language.
    Matteo Cimini and Jeremy Siek.
    In Proceedings of the 1st Workshop on Programming Models and Languages for Distributed Computing (PMLDC 2016), article n.8, pages 1-4, Rome, Italy, July 2016.
  12. Ghostbuster: A Tool for Simplifying and Converting GADTs.
    Trevor McDonell, Timothy Zakian, Matteo Cimini, Ryan Newton.
    In Proceedings of the 21st annual ACM SIGPLAN International Conference on Functional Programming (ICFP 2016), pages 338-350, 2016.
  13. PTRebeca: Modeling and Analysis of Distributed and Asynchronous Systems.
    Ali Jafari, Ehsan Khamespanah, Marjan Sirjani, Holger Hermanns, Matteo Cimini.
    In the journal Science of Computer Programming, 128:22-50, 2016.
  14. The Gradualizer: A Methodology and Algorithm for Generating Gradual Type Systems.
    Matteo Cimini and Jeremy Siek.
    In Proceedings of the 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2016), pages 443-455, 2016.
  15. Refined Criteria for Gradual Typing.
    Jeremy Siek, Michael M. Vitousek, Matteo Cimini, and John Tang Boyland.
    In Proceedings of The Inaugural Summit oN Advances in Programming Languages (SNAPL 2015), pages 274--293, 2015.
  16. Monotonic References for Efficient Gradual Typing.
    Jeremy Siek, Michael M. Vitousek, Matteo Cimini, Sam Tobin-Hochstadt, and Ronald Garcia.
    In Proceedings of the 24th European Symposium on Programming (ESOP 2015), pages 432--456, 2015.
  17. Principal Type Schemes for Gradual Programs.
    Ronald Garcia and Matteo Cimini.
    In Proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2015), pages 303--315, 2015.
  18. A Lightweight Formalization of the Meta-theory of Bisimulation-up-to.
    Kaustuv Chaudhuri, Matteo Cimini, and Dale Miller.
    In Proceedings of the 4-th ACM-SIGPLAN Conference on Certified Programs and Proofs (CPP 2015), pages 157--166, 2015.
  19. Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca.
    Arni Hermann Reynisson, Marjan Sirjani, Luca Aceto, Matteo Cimini, Ali Jafari, Anna Ingólfsdóttir and Steinar Hugi Sigurdarson.
    In the journal Science of Computer Programming, 89:41-68, 2014.
  20. Rule formats for distributivity.
    Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammadreza Mousavi, and Michel A. Reniers.
    In the journal Theoretical Computer Science, 458:1-28, 2012.
  21. Nominal SOS.
    Matteo Cimini, MohamamdReza Mousavi, Michel A. Reniers and Murdoch J. Gabbay.
    In Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII), Bath, UK, Electronic Notes in Theoretical Computer Science, 286:103-116, 2012.
  22. Proving the validity of equations in GSOS languages using rule-matching bisimilarity.
    Luca Aceto, Matteo Cimini, and Anna Ingólfsdóttir.
    In the journal Mathematical Structures in Computer Science, 22(2):291--331, Cambridge University Press, 2012.
  23. Modelling and simulation of asynchronous real-time systems using Timed Rebeca.
    Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Arni Hermann Reynisson, Steinar Hugi Sigurdarson, and Marjan Sirjani.
    In Proceedings of the 10th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2011), volume 58 of Electronic Proceedings in Theoretical Computer Science, pages 1-19, 2011.
  24. Rule formats for distributivity.
    Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammadreza Mousavi, and Michel A. Reniers.
    In Proceedings of the 5th International Conference on Language and Automata Theory and Applications (LATA 2011), volume 6638 of Lecture Notes in Computer Science, pages 79-90, Springer-Verlag, 2011.
  25. SOS rule formats for zero and unit elements.
    Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, MohammadReza Mousavi, and Michel A. Reniers.
    In the journal Theoretical Computer Science, 412(28):3045-3071, 2011.
  26. Functions as processes: Termination and the Lambda-bar-mu-mu-tilde-Calculus.
    Matteo Cimini, Claudio Sacerdoti Coen, and Davide Sangiorgi.
    In Proceedings of the 5th Symposium on Trustworthy Global Computing (TGC 2010), volume 6084 of Lecture Notes in Computer Science, pages 73-86, Springer-Verlag, 2010.
    Online Appendix
  27. On rule formats for zero and unit elements.
    Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, MohammadReza Mousavi, and Michel A. Reniers.
    In Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVI), Ottawa, Canada, volume 265 of Electronic Notes in Theoretical Computer Science, pages 145-160. Elsevier B.V., The Netherlands, 2010.
  28. A bisimulation-based method for proving the validity of equations in GSOS languages.
    Luca Aceto, Matteo Cimini, and Anna Ingólfsdóttir.
    In Proceedings of the 6th Workshop on Structural Operational Semantics 2009 (SOS 2009), August 31, 2009, Bologna (Italy), volume 18 of Electronic Proceedings in Theoretical Computer Science, pages 1-16, 2010.