Yohji AKAMA Department of Information Science, The University of Tokyo,...  Home/Search
Context
Related
| nicosia.is.s.utokyo.ac.jp/...ttp.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 introduce an intersection typing system for combinatory logic. We prove that it is sound and complete for the class of partial combinatory algebras. From the soundness, we derive that a term of combinatory logic is typeable iff it is sn. Let F be the class of non-empty filters which consists of types. Then F is an extensional non-total partial combinatory algebra. Furthermore, it is a fully abstract model with respect to the set of sn terms of combinatory logic. By F , we can solve... (Update)
Similar documents (at the sentence level):
22.1%: SN Combinators and Partial Combinatory Algebras - Akama (Correct)
Active bibliography (related documents): More All
0.5: Completeness of Intersection and Union Type Assignment.. - Ishihara, Kurata (Correct)
0.4: Collapsing Partial Combinatory Algebras - Bethke, Klop (1996) (Correct)
0.3: On the Longest Perpetual Reductions in Orthogonal Expression.. - Khasidashvili (2000) (Correct)
Similar documents based on text: More All
0.9: Completing Partial Combinatory Algebras with Unique.. - Bethke, Klop, de Vrijer (1996) (Correct)
0.9: A Note on Absolutely Unorderable Combinatory Algebras - Lusin, Salibra (2001) (Correct)
0.6: Partial Applicative Theories and Explicit Substitutions - Strahm (1996) (Correct)
BibTeX entry: (Update)
@article{ akama98sn,
author = "Yohji Akama",
title = "{SN} Combinators and Partial Combinatory Algebras",
journal = "Lecture Notes in Computer Science",
volume = "1379",
pages = "302--??",
year = "1998",
url = "citeseer.ist.psu.edu/30720.html" }
Citations (may not include all citations):474 Term rewriting systems - Klop - 1992
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
143 Foundations of Constructive Mathematics (context) - Beeson - 1984
41 Complete restrictions of the intersection type discipline - van Bakel - 1992
30 denotational and logical descriptions: A case study (context) - Egidi, Honsell et al. - 1992
25 Termination and Confluence Properties of Structured Rewrite .. (context) - Gramlich - 1996
13 Intersection types for combinatory logic (context) - Dezani-Ciancaglini, Hindley - 1992
12 Modified realizability toposes and strong normalization proo.. - Hyland, Ong - 1993
12 Easy terms in the lambda-calculus (context) - Jacopini, Zilli - 1985
11 A condition for identifying two elements of whatever model o.. (context) - Jacopini - 1975
9 Some new results on easy lambda-terms (context) - Berarducci, Intrigila - 1993
8 the existence of extensional partial combinatory algebras (context) - Bethke - 1987
6 Collapsing partial combinatory algebras - Bethke, Klop - 1996
4 Models for theories of functions strictly depending on all t.. (context) - Honsell, Ronchi - 1984
3 to-CL translation for strong normalization - Akama - 1997
2 Subtype relations yielding filter lambda-models (context) - Kurata - 1997
2 The call-by-value type discipline over the minimal relevant .. (context) - Motohama - 1997
2 Combinatory weak reduction in lambda calculus (context) - Cagman, Roger - 1997
1 An extensional partial combinatory algebra based on -terms (context) - Perez - 1991
Documents on the same site (http://nicosia.is.s.u-tokyo.ac.jp/~akama/): More
Conservative Extensions of Polymorphic PCF - Akama (1996) (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