We describe a Java-like calculus which supports cyclic data structures, and offers a mechanism of flexible regular corecursion for their manipulation. The calculus enhances an earlier proposal by a more sophisticated reduction semantics, which filters out, by an additional check, some spurious results which were obtained in the previous model.
Corecursive featherweight Java revisited
Barbieri P.;Dagnino F.;Zucca E.;Ancona D.
2019-01-01
Abstract
We describe a Java-like calculus which supports cyclic data structures, and offers a mechanism of flexible regular corecursion for their manipulation. The calculus enhances an earlier proposal by a more sophisticated reduction semantics, which filters out, by an additional check, some spurious results which were obtained in the previous model.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
main.pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Documento in Post-print
Dimensione
272.29 kB
Formato
Adobe PDF
|
272.29 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
