Simulation relations are tools for establishing the correctness of data refinement steps. In the simply-typed lambda calculus, logical relations are the standard choice for simulation relations, but they suffer from certain shortcomings; these are resolved by use of the weaker notion of pre-logical relations instead. Developed from a syntactic setting, abstraction barrier-observing simulation relations serve the same purpose, and also handle polymorphic operations. Meanwhile, second-order prelogical relations directly generalise pre-logical relations to polymorphic lambda calculus (System F). We compile the main refinement-pertinent results of these various notions of simulation relation, and try to raise some issues for aiding their comparison and reconciliation. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Hannay, J., Katsumata, S. Y., & Sannella, D. (2003). Semantic and syntactic approaches to simulation relations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 68–91. https://doi.org/10.1007/978-3-540-45138-9_4
Mendeley helps you to discover research relevant for your work.