@inproceedings{7b76b06a6d8548cb82be1c88d38e70a6,
title = "Constructive Data Refinement in Typed Lambda Calculus",
abstract = "A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented.",
author = "Furio Honsell and John Longley and Donald Sannella and Andrzej Tarlecki",
year = "2000",
doi = "10.1007/3-540-46432-8_11",
language = "English",
isbn = "978-3-540-67257-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "161--176",
editor = "Jerzy Tiuryn",
booktitle = "Foundations of Software Science and Computation Structures",
address = "United Kingdom",
}