How to prove type soundness of Java-like languages without forgoing big-step semantics. Ancona, D. In Proceedings of 16th Workshop on Formal Techniques for Java-like Programs, FTfJP@ECOOP 2014, Uppsala, Sweden, July 28 - August 1, 2014, pages 1:1–1:6, 2014. ACM. Paper doi bibtex @inproceedings{DBLP:conf/ecoop/Ancona14,
author = {Davide Ancona},
editor = {David J. Pearce},
title = {How to prove type soundness of Java-like languages without forgoing
big-step semantics},
booktitle = {Proceedings of 16th Workshop on Formal Techniques for Java-like Programs,
FTfJP@ECOOP 2014, Uppsala, Sweden, July 28 - August 1, 2014},
pages = {1:1--1:6},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2635631.2635846},
doi = {10.1145/2635631.2635846},
timestamp = {Wed, 26 May 2021 08:40:06 +0200},
biburl = {https://dblp.org/rec/conf/ecoop/Ancona14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"DF7NMPhE83tHj2Wah","bibbaseid":"ancona-howtoprovetypesoundnessofjavalikelanguageswithoutforgoingbigstepsemantics-2014","author_short":["Ancona, D."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Davide"],"propositions":[],"lastnames":["Ancona"],"suffixes":[]}],"editor":[{"firstnames":["David","J."],"propositions":[],"lastnames":["Pearce"],"suffixes":[]}],"title":"How to prove type soundness of Java-like languages without forgoing big-step semantics","booktitle":"Proceedings of 16th Workshop on Formal Techniques for Java-like Programs, FTfJP@ECOOP 2014, Uppsala, Sweden, July 28 - August 1, 2014","pages":"1:1–1:6","publisher":"ACM","year":"2014","url":"https://doi.org/10.1145/2635631.2635846","doi":"10.1145/2635631.2635846","timestamp":"Wed, 26 May 2021 08:40:06 +0200","biburl":"https://dblp.org/rec/conf/ecoop/Ancona14.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/ecoop/Ancona14,\n author = {Davide Ancona},\n editor = {David J. Pearce},\n title = {How to prove type soundness of Java-like languages without forgoing\n big-step semantics},\n booktitle = {Proceedings of 16th Workshop on Formal Techniques for Java-like Programs,\n FTfJP@ECOOP 2014, Uppsala, Sweden, July 28 - August 1, 2014},\n pages = {1:1--1:6},\n publisher = {{ACM}},\n year = {2014},\n url = {https://doi.org/10.1145/2635631.2635846},\n doi = {10.1145/2635631.2635846},\n timestamp = {Wed, 26 May 2021 08:40:06 +0200},\n biburl = {https://dblp.org/rec/conf/ecoop/Ancona14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Ancona, D."],"editor_short":["Pearce, D. J."],"key":"DBLP:conf/ecoop/Ancona14","id":"DBLP:conf/ecoop/Ancona14","bibbaseid":"ancona-howtoprovetypesoundnessofjavalikelanguageswithoutforgoingbigstepsemantics-2014","role":"author","urls":{"Paper":"https://doi.org/10.1145/2635631.2635846"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/a/DAncona.bib","dataSources":["hbmDF3mowSFP7RzLi"],"keywords":[],"search_terms":["prove","type","soundness","java","languages","without","forgoing","big","step","semantics","ancona"],"title":"How to prove type soundness of Java-like languages without forgoing big-step semantics","year":2014}