(Enter summary)
Abstract: . We study a weakening of the notion of logical relations, called prelogical
relations, that has many of the features that make logical relations so
useful but having further algebraic properties including composability. The basic
idea is simply to require the reverse implication in the definition of logical
relations to hold only for lambda-expressible functions. Pre-logical relations are
the minimal weakening of logical relations that gives composability for extensional
structures and... (Update)
Cited by: More
Behavioural Equivalence and Indistinguishability in Higher-Order .. - Katsumata (2003)
(Correct)
Complete Lax Logical Relations for Cryptographic.. - Goubault-Larrecq.. (2004)
(Correct)
Subtyping with Power Types - Aspinall (2000)
(Correct)
Similar documents (at the sentence level):
66.3%: Pre-logical Relations - Honsell, Sannella (1999)
(Correct)
Active bibliography (related documents): More All
0.3: A Higher-Order Simulation Relation for System F - Hannay (2000)
(Correct)
0.2: Complexity of the Higher Order Matching - Wierzbicki (2000)
(Correct)
0.1: Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000)
(Correct)
Similar documents based on text: More All
0.5: Logical Relations and Data Abstraction - Power, Robinson
(Correct)
0.5: Semantic and Syntactic Approaches to Simulation Relations - Hannay, Katsumata, Sannella (2003)
(Correct)
0.4: Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2002)
(Correct)
Related documents from co-citation: More All
13: Foundations for Programming Languages (context) - Mitchell - 1996
6: abstraction and parametric polymorphism (context) - Reynolds - 1983
6: Lax logical relations
- Plotkin, Power et al. - 2000
BibTeX entry: (Update)
F. Honsell and D. Sannella. Pre-logical relations. In Proc. CSL'99, LNCS, 1999. http://citeseer.ist.psu.edu/article/honsell99prelogical.html More
@inproceedings{ honsell99prelogical,
author = "Furio Honsell and Donald Sannella",
title = "Pre-logical Relations",
booktitle = "{CSL}",
pages = "546-561",
year = "1999",
url = "citeseer.ist.psu.edu/article/honsell99prelogical.html" }
Citations (may not include all citations):
229
Foundations for Programming Languages (context) - Mitchell - 1996
198
Toward formal development of programs from algebraic specifi..
- Sannella, Tarlecki - 1988
53
Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
46
Data Abstraction and the Correctness of Modular Programming (context) - Schoett - 1987
41
Kripke-style models for typed lambda calculus
- Mitchell, Moggi - 1991
33
Behavioural correctness of data representations (context) - Schoett - 1990
30
Logical relations and the typed lambda calculus (context) - Statman - 1985
28
Proofs of strong normalization (context) - Gandy - 1980
25
An axiomatic approach to binary logical relations with appli..
- Kinoshita, O'Hearn et al. - 1997
20
A new characterization of lambda definability
- Jung, Tiuryn - 1993
12
Correctness of data representations in Algol-like languages (context) - Tennent - 1994
10
and Kan extensions (context) - Abramsky, logical - 1990
5
Chapter 8 of Handbook of Theoretical Computer Science (context) - Mitchell, for - 1990
5
A compositional generalisation of logical relations
- Plotkin, Power et al. - 1998
4
Church Memorial volume (context) - Loader, of
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www2.dcs.ed.ac.uk/~dts/alf/):
Pre-logical Relations - Honsell, Sannella (1999)
(Correct)
Pre-logical Relations - Honsell, Sannella (1999)
(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