Giulio Guerrieri

Dr Giulio Guerrieri

Researcher

Leaving date: 30th November 2017

Themes:

• Quantum
• Programming Languages

See Also:

• My personal webpage

Interests

Proof-theory, (differential) linear logic, (differential) lambda-calculus, quantitative denotational semantics, call-by-value vs call-by-name.

Selected Publications

View AllManage publications

• A Semantical and Operational Account of Call−by−Value Solvability

  Alberto Carraro and Giulio Guerrieri

  In Anca Muscholl, editor, Foundations of Software Science and Computation Structures − 17th International Conference‚ FOSSACS 2014‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2014‚ Grenoble‚ France‚ April 5−13‚ 2014‚ Proceedings. Vol. 8412 of Lecture Notes in Computer Science. Pages 103–118. Springer. 2014.

  Details about A Semantical and Operational Account of Call−by−Value Solvability | BibTeX data for A Semantical and Operational Account of Call−by−Value Solvability | DOI (10.1007/978-3-642-54830-7) | Link to A Semantical and Operational Account of Call−by−Value Solvability

• The Bang Calculus: an untyped lambda−calculus generalizing call−by−name and call−by−value

  Thomas Ehrhard and Giulio Guerrieri

  In James Cheney and Germán Vidal, editors, Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming‚ Edinburgh‚ United Kingdom‚ September 5−7‚ 2016. Pages 174–187. ACM. 2016.

  Details about The Bang Calculus: an untyped lambda−calculus generalizing call−by−name and call−by−value | BibTeX data for The Bang Calculus: an untyped lambda−calculus generalizing call−by−name and call−by−value | DOI (10.1145/2967973) | Link to The Bang Calculus: an untyped lambda−calculus generalizing call−by−name and call−by−value

• Computing Connected Proof(−Structure)s From Their Taylor Expansion

  Giulio Guerrieri‚ Luc Pellissier and Lorenzo Tortora de Falco

  In Delia Kesner and Brigitte Pientka, editors, 1st International Conference on Formal Structures for Computation and Deduction‚ FSCD 2016‚ June 22−26‚ 2016‚ Porto‚ Portugal. Vol. 52 of LIPIcs. Pages 20:1–20:18. Schloss Dagstuhl − Leibniz−Zentrum fuer Informatik. 2016.

  Details about Computing Connected Proof(−Structure)s From Their Taylor Expansion | BibTeX data for Computing Connected Proof(−Structure)s From Their Taylor Expansion | DOI (10.4230/LIPIcs.FSCD.2016.20) | Link to Computing Connected Proof(−Structure)s From Their Taylor Expansion