M. Hasegawa and Y. Kakutani. Axioms for recursion in call-by-value. In Foundations of Software Science and Computation Structures, volume 2030 of LNCS, pages 246--260. Springer-Verlag, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Duality between Call-by-Name Recursion and Call-by-Value Iteration - Kakutani (2001) Self-citation (Kakutani) (Correct)
No context found.
M. Hasegawa and Y. Kakutani. Axioms for recursion in call-by-value. In Foundations of Software Science and Computation Structures, volume 2030 of LNCS, pages 246--260. Springer-Verlag, 2001.
Linearly Used E ects: - Monadic And Cps Self-citation (Hasegawa) (Correct)
No context found.
Hasegawa, M. and Kakutani, Y. (2001) Axioms for recursion in call-by-value (extended abstract). In Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2001), Springer Lecture Notes in Computer Science 2030, pp. 246-260.
Parameterizations and Fixed-Point Operators on Control.. - Kakutani, Hasegawa Self-citation (Hasegawa Kakutani) (Correct)
....[5] The aim of this work is to derive analogous results for bi parameterization on control categories. 1. 2 Fixed Point Operators and Parameterizations Our motivation to study parameterization on control categories comes from our previous work about fixed point operators on the # calculi in [4] and [6] The equational theories of fixed point operators in call by name # calculi have been studied extensively, and now there are some canonical axiomatizations including iteration theories [1] and Conway theories, equivalently traced cartesian categories [3] see [12] for recent results) ....
M. Hasegawa and Y. Kakutani. Axioms for recursion in call-by-value. HigherOrder and Symbolic Computation, 15(2):235--264, 2002.
Duality between Call-by-Name Recursion and Call-by-Value Iteration - Kakutani (2001) Self-citation (Kakutani) (Correct)
....Namely, a xed point operator on a control category is exactly dual for an iteration operator on a co control category. On the other hand, in [7] Filinski also proposed the uniformity principles for xed point operators and iteration operators. We re ne and justify the uniformity principle in [12]. The v calculus can enjoy its results. Overview In this paper, we recall the calculi in Section 1, and their categorical semantics in Section 2. Section 2 also gives an investigation of the duality between call byname recursion and call by value iteration from the categorical point of ....
....recursive programming in a call by value language or can verify call byvalue programs in the call by name setting. 4 Applications 4.1 Call by value xed point operators What is described in this subsection is the joint work with M. Hasegawa. Categorical discussion and more details are in [12]. Though we have discussed iteration in the call by value languages, iteration is less familiar than recursion with functional languages. However, Filinski demonstrated in [7] that iteration operators have bijective correspondence with recursion operators under a certain condition in a ....
[Article contains additional citation context not shown here]
M. Hasegawa and Y. Kakutani. Axioms for recursion in call-by-value. In Foundation of Software Science and Computation Structures, volume
On the call-by-value CPS transform and its semantics - Führmann, Thielecke (2003) (3 citations) (Correct)
No context found.
Masahito Hasegawa and Yoshihiko Kakutani. Axioms for recursion in call-by-value. Higher-Order and Symbolic Computation, 15(2-3):235--264, September 2002.
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