See this document in CiteSeerX!

The Virtues of Eta-expansion (1995)  (Make Corrections)  (40 citations)
C. Barry Jay School of Computing Sciences University of Technology Sydney PO...
Journal of Functional Programming



  Home/Search   Context   Related

 
View or download:
uts.edu.au/~cbj/Publica...virtues.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uts.edu.au/~cbj/Publications/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Interpreting j-conversion as an expansion rule in the simply-typed -calculus maintains the confluence of reduction in a richer type structure. This use of expansions is supported by categorical models of reduction, where fi-contraction, as the local counit, and j-expansion, as the local unit, are linked by local triangle laws. The latter form reduction loops, but strong normalisation (to the long fij-normal forms) can be recovered by "cutting" the loops. (Update)

Cited by:   More
A Linear Spine Calculus - Cervesato, Pfenning (2001)   (Correct)
Recursion over Objects of Functional Type - Despeyroux, Leleu (2000)   (Correct)

Similar documents (at the sentence level):
63.7%:   The Virtues of Eta-expansion - Jay, Ghani (1993)   (Correct)

Active bibliography (related documents):   More   All
1.5:   Modelling Reduction in Confluent - Categories Barry Jay   (Correct)
0.8:   Adjoint Rewriting - Ghani   (Correct)
0.6:   Partial Functions, Ordered Categories, Limits and Cartesian Closure - Jay (1993)   (Correct)

Similar documents based on text:   More   All
0.4:   Separating Shape from Data - Jay   (Correct)
0.4:   Shape Checking of Array Programs - Jay, Sekanina (1997)   (Correct)
0.4:   Poly-dimensional Array Programming - Jay (1998)   (Correct)

Related documents from co-citation:   More   All
24:   On Mints' reduction for ccc-calculus (context) - Akama - 1993
18:   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
15:   Ideas and results in proof theory (context) - Prawitz - 1971

BibTeX entry:   (Update)

C. Barry Jay and Neil Ghani. The virtues of eta-expansion. Journal of Functional Programming, 2(5):135--154, 1995. http://citeseer.ist.psu.edu/734278.html   More

@article{ jay95virtues,
    author = "C. Barry Jay and Neil Ghani",
    title = "The Virtues of Eta-Expansion",
    journal = "Journal of Functional Programming",
    volume = "5",
    number = "2",
    pages = "135-154",
    year = "1995",
    url = "citeseer.ist.psu.edu/734278.html" }
Citations (may not include all citations):
729   The Lambda Calculus Its Syntax and Semantics (context) - Barendregt - 1984
434   A framework for defining logics - Harper, Honsell et al. - 1991
359   Introduction to higher order categorical logic (context) - Lambek, Scott - 1986
133   Cambridge Tracts in Theoretical Computer Science (context) - Girard, Taylor et al. - 1989
116   Ideas and results in proof theory (context) - Prawitz - 1971
36   Formal category theory: adjointness for 2-categories (context) - Gray - 1974
28   Foundations of equational deduction: A categorical treatment.. (context) - Rydeheard, Stell - 1987
24   equations dans des langages d'ordre (context) - Huet - 1976
23   categorical approach to change of base and geometric morphis.. - Carboni, Kelly et al. - 1990
17   Modelling computations: a 2-categorical framework (context) - Seely - 1987
12   Pre-adjunctions in Order Enriched Categories (context) - Hoare, Jifeng et al. - 1989
12   Modelling reduction in confluent categories (context) - Jay - 1992
6   Pure and Appl (context) - Jay, adjunctions - 1988
6   Long fij Normal Forms and Confluence (context) - Jay
6   Universitat Bremen (context) - Kahrs, PhD - 1991
6   Towards a categorical semantics of type classes (context) - Hilken, Rydeheard
5   Teorija categorii i teoria dokazatelstv (context) - Mints - 1979
4   Extendinging properties to categories of partial maps (context) - Jay
3   On Free CCC (context) - Cubri'c
3   limits and cartesian closure (context) - Jay, functions et al. - 1990
2   A confluent reduction for the extensional typed -calculus (context) - Di Cosmo, Kesner
2   A confluent reduction for the -calculus with surjective pair.. (context) - Curien, Di Cosmo - 1991
1   Cofibrations and the realization of non deterministic automa.. (context) - Kasangian, Kelly et al. - 1983
1   On Mints' Reduction for ccc-Calculus To appear in Typed Lamb.. (context) - Akama - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www-staff.it.uts.edu.au/~cbj/Publications/):   More
Shape Analysis for Parallel Computing - Jay (1995)   (Correct)
The Pattern Calculus - Jay (2003)   (Correct)
Partial Evaluation of Shaped Programs: Experience with FISh - Jay (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