How to prove type soundness of Java-like languages without forgoing big-step semantics

Davide Ancona. How to prove type soundness of Java-like languages without forgoing big-step semantics. In David J. Pearce, editor, Proceedings of 16th Workshop on Formal Techniques for Java-like Programs, FTfJP@ECOOP 2014, Uppsala, Sweden, July 28 - August 1, 2014. ACM, 2014. [doi]

@inproceedings{Ancona14,
  title = {How to prove type soundness of Java-like languages without forgoing big-step semantics},
  author = {Davide Ancona},
  year = {2014},
  doi = {10.1145/2635631.2635846},
  url = {http://doi.acm.org/10.1145/2635631.2635846},
  researchr = {https://researchr.org/publication/Ancona14},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of 16th Workshop on Formal Techniques for Java-like Programs, FTfJP@ECOOP 2014, Uppsala, Sweden, July 28 - August 1, 2014},
  editor = {David J. Pearce},
  publisher = {ACM},
  isbn = {978-1-4503-2866-1},
}