We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly normalizable) compute the maximal length of the reduction sequences starting from that net.

de Carvalho, D., & TORTORA DE FALCO, L. (2016). A semantic account of strong normalization in Linear Logic. INFORMATION AND COMPUTATION, 248, 104-129.

A semantic account of strong normalization in Linear Logic

TORTORA DE FALCO, LORENZO
2016

Abstract

We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly normalizable) compute the maximal length of the reduction sequences starting from that net.
de Carvalho, D., & TORTORA DE FALCO, L. (2016). A semantic account of strong normalization in Linear Logic. INFORMATION AND COMPUTATION, 248, 104-129.
File in questo prodotto:
File Dimensione Formato  
strong.pdf

accesso aperto

Descrizione: Articolo principale
Tipologia: Documento in Post-print
Dimensione 404.76 kB
Formato Adobe PDF
404.76 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11590/311739
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 10
social impact