{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:18Z","timestamp":1751660538473,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"abstract":"<jats:p>A refinement type {x : T | C} is the subset of the type T consisting of the values x to satisfy the formula C. In this tutorial article we explain the principles of refinement types by developing from first principles a concurrent &amp;lambda;-calculus whose type system supports refinement types. Moreover, we describe a series of applications of our refined type theory and of related systems.<\/jats:p>","DOI":"10.3233\/978-1-60750-100-8-73","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:11:46Z","timestamp":1739992306000},"source":"Crossref","is-referenced-by-count":2,"title":["Principles and Applications of Refinement Types"],"prefix":"10.3233","author":[{"family":"Gordon Andrew D.","sequence":"additional","affiliation":[]},{"family":"Fournet C&eacute;dric","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["NATO Science for Peace and Security Series - D: Information and Communication Security","Logics and Languages for Reliability and Security"],"original-title":[],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:13:50Z","timestamp":1739992430000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=1874-6268&volume=25&spage=73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-60750-100-8-73","relation":{},"ISSN":["1874-6268"],"issn-type":[{"value":"1874-6268","type":"print"}],"subject":[],"published":{"date-parts":[[2010]]}}}