John Power, Edmund Robinson  Home/Search
Context
Related
| dcs.qmw.ac.uk/~edmundr/pub...ppdp31.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.qmw.ac.uk/~edm...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We develop a notion of equivalence between interpretations of the simply typed -calculus together with an equationally de ned abstract data-type, and we show that two interpretations are equivalent if and only if they are linked by a logical relation. We show that our construction generalises from the simply typed -calculus to include the linear -calculus and calculi with additional type and term constructors, such as those given by sum types or by a strong monad for modelling phenomena such ... (Update)
Similar documents (at the sentence level):
11.6%: Logical Relations and Data Abstraction - Power, Robinson (Correct)
Active bibliography (related documents): More All
0.5: Axiomatics for Data Refinement in Call By Value Programming.. - Power, Tanaka (Correct)
0.5: On Plotkin-Abadi Logic for Parametric Polymorphism - Towards a.. - Maneggia (Correct)
0.3: An Axiomatic Approach to Binary Logical Relations.. - Kinoshita.. (1997) (Correct)
Similar documents based on text: More All
0.5: A Compositional Generalisation of Logical Relations - Plotkin, Power, Sannella (1998) (Correct)
0.4: Pre-logical Relations - Honsell, Sannella (1999) (Correct)
0.4: Lax Logical Relations - Plotkin, Power, Sannella, Tennent (2000) (Correct)
BibTeX entry: (Update)
@misc{ power-logical,
author = "John Power and Edmund Robinson",
title = "Logical Relations, Data Abstraction, and Structured Fibrations",
url = "citeseer.ist.psu.edu/495525.html" }
Citations (may not include all citations):291 Computational lambda-calculus and monads - Moggi - 1989
229 Foundations for programming languages (context) - Mitchell - 1996
139 Type systems for programming languages (context) - Mitchell - 1990
97 and parametric polymorphism (context) - Reynolds, abstraction - 1983
34 Equality in hyperdoctrines and the comprehension schema as a.. (context) - Lawvere - 1970
25 An axiomatic approach to binary logical relations with appli.. - Kinoshita, O'Hearn et al. - 1997
23 An axiomatisation of computationally adequate domain-theoret.. - Fiore, Plotkin - 1994
18 Fully abstract models of typed lambda-calculus (context) - Milner - 1977
17 Premonoidal categories as categories with algebraic structur.. (context) - Power
15 Pre-logical relations - Honsell, Sannella - 1999
13 Lax logical relations - Plotkin, Power et al. - 2000
12 Correctness of data representations in algol-like languages (context) - Tennent - 1994
11 abstraction and parametric polymorphism (context) - Ma, Reynolds - 1991
6 Structures in Computer Science (context) - Power, Robinson et al. - 1997
6 Logical Predicates and Indeterminates (context) - Hermida - 1993
3 Logical relations and data abstraction - Power, Robinson - 2000
2 A characterisation of lambda denability in categorical model.. (context) - Alimohamed - 1995
2 A new characterisation of lambda denability (context) - Jung, Tiuryn - 1993
Documents on the same site (http://www.dcs.qmw.ac.uk/~edmundr/publications.html): More
Premonoidal Categories and Notions of Computation - Power, Robinson (1995) (Correct)
Variations on Algebra: monadicity and generalisations of.. - Robinson (2001) (Correct)
Logical Relations and Data Abstraction - Power, Robinson (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