We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not. Type safety guarantees that a typeable process is honest - that is, it abides by the contracts it has stipulated in all possible contexts, even in presence of dishonest adversaries. Type inference is decidable, and it allows to safely approximate the honesty of processes using either synchronous or asynchronous communication.

@article{abs-1211-2609,
  title = {Honesty by Typing},
  author = {Massimo Bartoletti and Alceste Scalas and Emilio Tuosto and Roberto Zunino},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 12, Issue 4},
  year = {2017},
  doi = {10.2168/lmcs-12(4:7)2016}
}