Yohji Akama  Home/Search
Context Related
| nicosia.is.s.utokyo.ac...flops95.ps.gz 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: nicosia.is.s.utokyo.ac.jp/~ak... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that product and sum types are definable in polymorphic PCF with call-by-name evaluation strategy. This establishes polymorphic PCF and its extensions can be conservatively extended by product and sum types and recursive types. 1. Introduction When we employ typed -calculi to investigate a complex programming language, it is often useful to concentrate first on a "basic but sufficient" typed -calculus and then on its extensions by the corresponding syntax constructs. One of such basic ... (Update)
Context of citations to this paper: More
.... x j (C B) j (p i C) j (if0 I BB) j (case S of x:B j x:B) Akama has proved that PCF f Theta; g poly conservatively extends PCF poly [4]; he employs the technique of defining sum and product types in the second order polymorphic lambda calculus. We believe that an alternate...
Cited by: More
Semantic Orthogonality of Type Disciplines - Riecke, Subrahmanyam (1997) (Correct)
Active bibliography (related documents): More All
0.3: A Relational Account of Call-by-Value Sequentiality - Riecke, Sandholm (1997) (Correct)
0.2: Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetą (Correct)
0.2: Finitary PCF is not decidable - Loader (2001) (Correct)
Similar documents based on text: More All
0.3: Remarks on Isomorphisms in Typed Lambda Calculi with.. - Fiore, Di Cosmo, Balat (2002) (Correct)
0.3: Projecting Sequential Algorithms on Strongly Stable Functions - Ehrhard (1993) (Correct)
0.3: Integration in Real PCF - Edalat, Escardó (1996) (Correct)
BibTeX entry: (Update)
Y. Akama. Conservative extensions of polymorphic PCF. In M. Takeichi, T. Ida, and A. Ohori, editors, Second Fuji International Workshop on Functional and Logic Programming, pages 48--62. World Scientific, 1996. http://citeseer.ist.psu.edu/akama96conservative.html More
@misc{ akama96conservative,
author = "Y. Akama",
title = "Conservative extensions of polymorphic PCF",
text = "Y. Akama. Conservative extensions of polymorphic PCF. In M. Takeichi, T.
Ida, and A. Ohori, editors, Second Fuji International Workshop on Functional
and Logic Programming, pages 48--62. World Scientific, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/akama96conservative.html" }
Citations (may not include all citations):268 Proofs and Types (context) - Girard, Lafont et al. - 1989 ACM
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
51 the expressive power of programming languages - Felleisen - 1990
17 Fully abstract translations between functional languages (context) - Riecke - 1993 ACM DBLP
13 Delimiting the scope of effects - Riecke - 1993 ACM DBLP
4 A fixed point extension of the second order lambda-calculus:.. (context) - Amadio - 1988
4 Extensions to type systems can preserve operational equivale.. (context) - Riecke, Subramanian - 1994
Documents on the same site (http://nicosia.is.s.u-tokyo.ac.jp/~akama/): More
SN Combinators and Partial Combinatory Algebras - Yohji Akama (Correct)
Normal Proofs and Their Grammar - Takahashi, Akama, al. (1994) (Correct)
Translation of First-Class Environments to Records - Nishizaki, Akama (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