Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki  Home/Search
Context Related
| dcs.ed.ac.uk/home/dts/p...refinement.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/ho...ellaDT.html#ALF (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A new treatment of data refinement in typed lambda calculus is proposed, based on pre-logical relations [HS99] rather than logical relations as in [Ten94], and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented. 1 Introduction Various treatments of data refinement in the context of typed lambda calculus, beginning with Tennent's in [Ten94], have used logical relations to ... (Update)
Context of citations to this paper: More
.... the design of a convenient formalism for writing specifications [ABK 03,BST02] and applications to data refinement in typed # calculus [HLST00] A new angle that we explore here is the global e#ect of refining individual local components of a specification. This involves a...
...that is not just sound, as with logical relations, but is also complete. The use of pre logical relations in data refinement is studied in [HLST00]. The situation is more complicated when we consider polymorphically typed lambda calculi such as System F [Gir71,Rey74] Pre...
Cited by: More
Behavioural Equivalence and Indistinguishability in Higher-Order .. - Katsumata (2003) (Correct)
A Generalisation of Pre-logical Predicates to Simply Typed.. - Katsumata (Correct)
Pre-logical Relations - Honsell, Sannella (1999) (Correct)
Similar documents (at the sentence level):
33.0%: Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (Correct)
Active bibliography (related documents): More All
0.3: Algebraic specification and program development by stepwise.. - Sannella (1999) (Correct)
0.3: Exact Arithmetic Using the Golden Ratio - McGaw (1999) (Correct)
0.2: Computing with Real Numbers - I. The LFT Approach to Real.. - Edalat, Heckmann (Correct)
Similar documents based on text: More All
0.3: Axiomatics for Data Refinement in Call By Value Programming.. - Power, Tanaka (Correct)
0.3: Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2002) (Correct)
0.3: Semantic and Syntactic Approaches to Simulation Relations - Hannay, Katsumata, Sannella (2003) (Correct)
Related documents from co-citation: More All
6: Foundations for Programming Languages (context) - Mitchell - 1996
4: Essential concepts of algebraic specification and program development - Sannella, Tarlecki
4: Specification refinement with System F - Hannay - 1999
BibTeX entry: (Update)
F. Honsell, J. Longley, D. Sannella, and A. Tarlecki. Constructive data refinement in typed lambda calculus. In Proc. FOSSACS 2000, LNCS, 2000. http://citeseer.ist.psu.edu/honsell00constructive.html More
@article{ honsell00constructive,
author = "Furio Honsell and John Longley and Donald Sannella and Andrzej Tarlecki",
title = "Constructive Data Refinement in Typed Lambda Calculus",
journal = "Lecture Notes in Computer Science",
volume = "1784",
pages = "161--??",
year = "2000",
url = "citeseer.ist.psu.edu/honsell00constructive.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
229 Foundations for Programming Languages (context) - Mitchell - 1996
198 Toward formal development of programs from algebraic specifi.. - Sannella, Tarlecki - 1988
198 Toward formal development of programs from algebraic specifi.. - Sannella, Soko et al. - 1992
144 Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1996
143 Foundations of Constructive Mathematics (context) - Beeson - 1985
68 On full abstraction for PCF (context) - Hyland, Ong - 1996
53 Toward formal development of ML programs: foundations and me.. - Sannella, Tarlecki - 1989
46 Data Abstraction and the Correctness of Modular Programming (context) - Schoett - 1987
41 Essential concepts of algebraic specification and program de.. - Sannella, Tarlecki - 1997
33 Behavioural correctness of data representations (context) - Schoett - 1990
25 An axiomatic approach to binary logical relations with appli.. - Kinoshita, O'Hearn et al. - 1997
22 Second-order logical relations (context) - Mitchell, Meyer - 1997
16 on Software Engineering SE (context) - Goguen, IEEE - 1984
12 Correctness of data representations in Algol-like languages (context) - Tennent - 1994
12 Lazy functional algorithms for exact real functionals - Simpson - 1998
9 When is a functional program not a functional program - Longley - 1999
8 The continuous functionals of finite types over the reals - Normann - 1998
5 Mathematical Structures in Computer Science (context) - Plotkin, totality - 1997
4 A calculator for exact real number computation (context) - Plume - 1998
4 Computer Science Logic (context) - Honsell, Sannella et al. - 1999
3 Computer Science Logic (context) - Altenkirch, inductive et al. - 1998
2 Correctness of data representations (context) - Hoare - 1972
1 Electronic Notes in Theoretical Computer Science - Longley, untyped et al. - 1999
1 Available from http://www (context) - Bauer, computability et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcs.ed.ac.uk/home/dts/pub/SannellaDT.html#ALF): 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