Jo Hannay, Shin-ya Katsumata, Donald Sannella  Home/Search
Context
Related
| dcs.ed.ac.uk/home/dts/pub...mfcs2003.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.ed.ac.uk/home/dt...SannellaDT (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 su#er 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... (Update)
Active bibliography (related documents): More All
1.1: A Generalisation of Pre-logical Predicates to Simply Typed.. - Katsumata (Correct)
0.9: Pre-logical Relations - Honsell, Sannella (1999) (Correct)
0.8: Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (Correct)
Similar documents based on text: More All
0.3: SIMULATION RELATIONS FOR DISCRETE-TIME LINEAR Herbert.. - Department Of Electrical (Correct)
0.2: Logical Relations and Data Abstraction - Power, Robinson (Correct)
0.2: The Polynomial Time Decidability of Simulation.. - Shukla.. (Correct)
BibTeX entry: (Update)
@misc{ hannay-semantic,
author = "Jo Hannay and Shin-ya Katsumata and Donald Sannella",
title = "Semantic and Syntactic Approaches to Simulation Relations",
url = "citeseer.ist.psu.edu/hannay03semantic.html" }
Citations (may not include all citations):311 Abstract types have existential type (context) - Mitchell, Plotkin - 1988 ACM DBLP
268 Proofs and Types (context) - Girard, Taylor et al. - 1990 ACM
265 Proof of correctness of data representations (context) - Hoare - 1972 ACM DBLP
229 Foundations for Programming Languages (context) - Mitchell - 1996
106 An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990 ACM
61 Une extension de l'interpretation de Godel a l'analyse (context) - Girard - 1971
53 Automatic synthesis of typed #-programs on term algebras (context) - Bohm, Berarducci - 1985
51 Fundamental concepts in programming languages (context) - Strachey - 1967 ACM DBLP
41 Essential concepts of algebraic specification and program de.. - Sannella, Tarlecki - 1997 DBLP
33 Behavioural correctness of data representations (context) - Schoett - 1990
29 On behavioural abstraction and behavioural satisfaction in h.. - Hofmann, Sannella - 1996 ACM DBLP
28 The semantics of the second-order lambda calculus (context) - Bruce, Meyer et al. - 1990
28 The Craft of Programming (context) - Reynolds - 1981
23 Information and Computation (context) - Honsell, Sannella - 1999 DBLP
12 Correctness of data representations in Algol-like languages (context) - Tennent - 1994 ACM
12 Parametricity of extensionally collapsed term models of poly.. (context) - Hasegawa - 1991 ACM DBLP
7 Constructive data refinement in typed lambda calculus - Honsell, Longley et al. - 2000 ACM DBLP
6 Colloque sur la Programmation (context) - Reynolds, of et al. - 1974
5 A higher-order simulation relation for System F - Hannay - 2000
5 Specification refinement with System F - Hannay - 1999 ACM DBLP
5 on Mathematical Foundations of Programming Semantics (context) - Ma, Reynolds et al. - 1991
3 A model for formal parametric polymorphism: a PER interpreta.. - Bellucci, Abadi et al. - 1995 DBLP
3 Typed Lambda Calculi and Applications (context) - Plotkin, Abadi et al. - 1993 ACM
2 Languages and Programming (context) - Plotkin, Power et al. - 2000
2 Behavioural equivalence and indistinguishability in higheror.. - Katsumata - 2003
2 Second-order pre-logical relations and representation indepe.. (context) - Lei - 2001 DBLP
2 Science of Computer and Programming (context) - Bidoit, Hennicker et al. - 1995
2 th IFIP World Computer Congress (context) - Reynolds, abstraction et al. - 1983
1 Abstraction barrier-observing relational parametricity (context) - Hannay - 2003 DBLP
1 Abstraction Barriers and Refinement in the Polymorphic Lambd.. (context) - Hannay - 2001
1 An axiomatic system of parametricity (context) - Takeuti - 1998 ACM DBLP
1 on Functional Programming and Computer Architecture (context) - Mairson, theory et al. - 1991
1 Ninth Annual IEEE Symposium on Logic in Computer Science (context) - Robinson, Rosolini et al. - 1994
Documents on the same site (http://www.dcs.ed.ac.uk/home/dts/pub/SannellaDT.html): More
Pre-logical Relations - Honsell, Sannella (1999) (Correct)
Essential Concepts of Algebraic Specification and Program.. - Sannella, Tarlecki (1996) (Correct)
A Compositional Generalisation of Logical Relations - Plotkin, Power, Sannella (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC