Brian T. Howard, John C. Mitchell  Home/Search
Context Related
| 129.130.10.93/~schmidt/...lispfp90.ps.Z ksu.edu/~bhoward/ftp/lispfp90.ps.Z 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: 129.130.10.93/~schmidt/techrep... (more) From: ksu.edu/~bhoward/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms for PCF include j-equivalence and the so-called "surjective pairing" axiom for pairs. However, the reduction system pcf j;sp defined by directing each equational axiom is not confluent, for virtually any choice of algebraic data types. Moreover, neither j-reduction nor surjective pairing seems to have a counterpart in... (Update)
Context of citations to this paper: More
.... normalization for the combination of lambda calculus and algebraic rewriting systems have been the object of many researches [BT88, JO91, BTG92, HM90], where the modularity of these properties is studied. However, the lambda calculus under consideration cannot be equipped with...
.... normalization for the combination of lambda calculus and algebraic rewriting systems have been the object of many researches [BT88, JO91, BTG94, HM90], where the modularity of these properties is studied. However, the lambda calculus under consideration cannot be equipped with...
Cited by: More
On Modular Properties of Higher Order Extensional Lambda Calculi - Di Cosmo, Ghani (1997) (Correct)
Combining Algebraic Rewriting, Extensional Lambda Calculi.. - Di Cosmo, Kesner (Correct)
Combining First Order Algebraic Rewriting Systems, Recursion .. - Di Cosmo, Kesner (1994) (Correct)
Similar documents (at the sentence level):
74.7%: Fixed Points and Extensionality in Typed Functional Programming.. - Howard (1992) (Correct)
Active bibliography (related documents): More All
0.3: An Application of Klop's Counterexample to a Higher-Order Rewrite .. - Nesmith (1994) (Correct)
0.2: Adding Algebraic Rewriting to the Untyped Lambda Calculus - Dougherty (Correct)
0.2: The FL Project: The Design of a Functional Language - Aiken, Williams, Wimmers (Correct)
Similar documents based on text: More All
0.5: Conservative Extensions of Polymorphic PCF - Akama (1996) (Correct)
0.4: Integration in Real PCF - Edalat, Escardó (1996) (Correct)
0.4: Semantic Orthogonality of Type Disciplines - Riecke, Subrahmanyam (1997) (Correct)
Related documents from co-citation: More All
6: Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
5: Distributed on the types mailing list (context) - Cubric, CCC - 1992
5: On Mints' reduction for ccc-calculus (context) - Akama - 1993
BibTeX entry: (Update)
B.T. Howard, J.C. Mitchell, "Operational and Axiomatic Semantics of PCF". L&FP'90. http://citeseer.ist.psu.edu/howard90operational.html More
@incollection{ howard90operational,
author = "Brian T. Howard and John C. Mitchell",
title = "Operational and Axiomatic Semantics of {PCF}",
booktitle = "Proceedings 1990 {ACM} Conf.\ on {LISP} and Functional Programming, Nice, France, 27--29 June 1990",
address = "New York",
year = "1990",
url = "citeseer.ist.psu.edu/howard90operational.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
306 LCF considered as a programming language (context) - Plotkin - 1977
258 Miranda: a non-strict functional language with polymorphic t.. (context) - Turner - 1985
139 Type systems for programming languages (context) - Mitchell - 1990
55 Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
54 Polymorphic rewriting conserves algebraic strong normalizati.. (context) - Breazu-Tannen, Gallier - 1989
22 Functional Programming (context) - Henderson - 1980
15 A type--theoretic alternative to CUCH (context) - Scott - 1969
13 Unique normal forms for lambda calculus with surjective pair.. (context) - Klop, de Vrijer - 1989
9 Published as Mathematical Center Tract (context) - Klop, Systems et al. - 1980
5 Denotational semantics and rewrite rules for FP (context) - Halpern, Williams et al. - 1985
4 The Church--Rosser theorem for typed -calculus with surjecti.. (context) - Pottinger - 1981
2 The Church-Rosser property in higher-order rewrite systems (context) - Nesmith - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://129.130.10.93/~schmidt/techreport/ftppub/CIS/Howard/): More
Fixed Points and Extensionality in Typed Functional Programming.. - Howard (1992) (Correct)
Inductive, Projective, and Retractive Types - Howard (1993) (Correct)
Another Iteration on Darlington's "A Synthesis of Several Sorting .. - Howard (1994) (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