Douglas J. Howe Department of Computer Science Cornell University Ithaca, New ...  Home/Search
Context Related
| cornell.edu/Info/P...tyinLazy_LICS98.ps From: cornell.edu/Info/Pr...publication (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we introduce a general class of lazy computation systems and define a natural program equivalence for them. We prove that if an extensionality condition holds of each of the operators of a computation system, then the equivalence relation is a congruence, so that the usual kinds of equality reasoning are valid for it. This condition is a simple syntactic one, and is easy to verify for the various lazy computation systems we have considered so far. We also give conditions under... (Update)
Cited by: More
From Rewrite Rules to Bisimulation - Congruences Peter Sewell (Correct)
Unknown - (Correct)
GDP Festschrift ENTCS, to appear Syntactic Logical.. - Robert Harper Computer (Correct)
Active bibliography (related documents): More All
0.3: Natural Semantics for Non-Determinism - Moran (1993) (Correct)
0.2: Interpreting Functions as π-Calculus Processes: A Tutorial - Sangiorgi (1999) (Correct)
0.2: Proving Congruence of Bisimulation in Functional Programming.. - Howe (1996) (Correct)
Similar documents based on text: More All
0.1: A Classical Set-Theoretic Model of Polymorphic Extensional Type.. - Howe (1997) (Correct)
0.1: Importing Mathematics from HOL into Nuprl - Howe (1996) (Correct)
0.1: Moving Proofs-As-Programs Into Practice - Caldwell (1997) (Correct)
Related documents from co-citation: More All
41: The lazy lambda calculus - Abramsky - 1990
37: Bisimilarity as a theory of functional programming (context) - Gordon - 1995
23: Full Abstraction in the Lazy Lambda Calculus (context) - Abramsky, Ong - 1993
BibTeX entry: (Update)
D. J. Howe. Equality in lazy computation systems. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 198--203. IEEE Computer Society, June 1989. http://citeseer.ist.psu.edu/howe89equality.html More
@inproceedings{ douglas89equality,
author = "Howe, Douglas J.",
title = "Equality in Lazy Computation Systems",
booktitle = "Proceedings of the Fourth Annual Symposium on Logic in Computer Science",
month = "June",
publisher = "IEEE Computer Society",
pages = "198--203",
year = "1989",
url = "citeseer.ist.psu.edu/howe89equality.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
322 volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
179 The lazy lambda calculus - Abramsky - 1987
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1982
111 Fast decision procedures based on congruence closure (context) - Nelson, Oppen - 1980
42 Bisimulation can't be traced: Preliminary report (context) - Bloom, Istrail et al. - 1988
39 A non-type-theoretic semantics for type-theoretic language (context) - Allen - 1987
25 A non-type theoretic definition of Martin-Lof's types (context) - Allen - 1987
19 Automating Reasoning in an Implementation of Constructive Ty.. (context) - Howe - 1988
3 flat lattice models of typed lambda calculus (context) - Bloom, be - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/Info/Projects/NuPrl/html/publication.html): More
The Structure of Nuprl's Type Theory - Constable (1997) (Correct)
Formalizing Constructive Real Analysis - Forester (1993) (Correct)
Formalizing Automata II: Decidable Properties - Constable (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