Hashimoto, M. and Ohori, A. 2001. A typed context calculus. Theoretical Computer Science 266, 1--2, 249--272. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Simply Typed Context Calculus with First-Class Environments - Sato, Sakurai, Kameyama (2002) (4 citations) (Correct)
....to be free. So, unlike substitution, hole lling may introduce new and intended bound variables. Recently there have been several attempts to formalize the notion of context and thereby make computing with contexts possible. For example, Talcott [16] Lee Friedman [8] Dami [5] Hashimoto Ohori [7], Sands [13] Mason [9] and Bognar de Vrijer [3] made notable contributions. However, as far as we know, there is as yet no proposal of a language which has contexts as rst class values and which is at the same time pure in the following sense. We understand that a functional language is pure 1 ....
....original context a[ is within the scope of x and y, while the hole in the reduced context is only within the scope of x. This means that a part of the information as to which variables should be captured at the hole is lost if one reduces a redex which has a hole in it. Hashimoto Ohori [7] did not solve this problem. Instead they put restriction on the reduction rule in their system and prohibited such reductions like the above example. To solve this problem, we introduce the type A E which represents the set of objects obtained by abstracting objects of type A with respect ....
[Article contains additional citation context not shown here]
Hashimoto, M. and Ohori, A., A typed context calculus, Preprint RIMS-1098, Res. Inst. for Math. Sci., Kyoto Univ., 1996, Journal version is to appear in Theoretical Computer Science.
A Simply Typed Context Calculus with First-Class Environments - Sato, Sakurai, Kameyama (2002) (4 citations) (Correct)
....to be free. So, unlike substitution, hole filling may introduce new and intended bound variables. Recently there have been several attempts to formalize the notion of context and thereby make computing with contexts possible. For example, Talcott [16] Lee Friedman [8] Dami [5] Hashimoto Ohori [7], Sands [13] Mason [9] and Bognar de Vrijer [3] made notable contributions. However, as far as we know, there are as yet no proposal of a language which has contexts as first class values and which is at the same time pure in the following sense. We understand that a functional language is pure ....
....original context a[ is within the scope of x and y, while the hole in the fi reduced context is only within the scope of x. This means that a part of the information as to which variables should be captured at the hole is lost if one reduces a fi redex which has a hole in it. Hashimoto Ohori [7] did not solve this problem. Instead they put restriction on the fi reduction rule in their system and prohibited such fi reductions like the above example. To solve this problem, we introduce the type A E which represents the set of objects obtained by abstracting objects of type A with respect ....
[Article contains additional citation context not shown here]
Hashimoto, M. and Ohori, A., A typed context calculus, Preprint RIMS-1098, Res. Inst. for Math. Sci., Kyoto Univ., 1996, Journal version is to appear in Theoretical Computer Science.
Confluent Equational Reasoning for Linking with First-Class .. - Wells, Vestergaard (1999) (15 citations) (Correct)
....real difficulty in dealing with objects is not in expressing their computational meaning but rather in devising the type system, an issue which we do not address in this paper. 3.6 First Class Contexts Contexts are terms with holes where filling the hole of a context can capture variables. In [HO97], Hashimoto and Ohori extended the calculus to manipulate contexts as first class entities. They added named holes, written X , hole abstraction to form contexts, written ffiX:M , and context application (i.e. context filling) written M 1 fi M 2 . Hashimoto and Ohori described in [HO97] the ....
....In [HO97] Hashimoto and Ohori extended the calculus to manipulate contexts as first class entities. They added named holes, written X , hole abstraction to form contexts, written ffiX:M , and context application (i.e. context filling) written M 1 fi M 2 . Hashimoto and Ohori described in [HO97] the difficulties they had in designing their calculus. A very important goal for a calculus is that the meaning of an expression should be independent of the order in which the rewrite rules are applied. However, this goal seemed to conflict with the key feature of context hole filling, the ....
Masatomo Hashimoto and Atsushi Ohori. A typed context calculus. Technical Report RIMS-1098, Research Inst. for Math. Sci., Kyoto University, 25 September 1997.
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005) (Correct)
No context found.
Hashimoto, M. and Ohori, A. 2001. A typed context calculus. Theoretical Computer Science 266, 1--2, 249--272.
Confluent Equational Reasoning for Linking with First-Class .. - Wells, Vestergaard (1999) (15 citations) (Correct)
No context found.
Masatomo Hashimoto and Atsushi Ohori. A typed context calculus. Technical Report RIMS-1098, Research Inst. for Math. Sci., Kyoto University, 25 September 1997.
A Calculus of Lambda Calculus Contexts - Bognar, de Vrijer (2001) (4 citations) (Correct)
No context found.
Hashimoto, M. and A. Ohori: 1998, `A typed context calculus'. Surikaisekikenkyusho Kokyuroku 1023, 76-91. Type theory and its application to computer systems (Japanese) (Kyoto, 1997).
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