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.
How to prove type soundness of Java-like languages without forgoing big-step semantics [link]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