Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
A note on inconsistencies caused by fixpoints in a Cartesian closed category
Theoretical Computer Science
Lisp and Symbolic Computation
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Axioms for Recursion in Call-by-Value
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Category Theory and Computer Science
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Dual Calculus with Inductive and Coinductive Types
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Classical Natural Deduction for S4 Modal Logic
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Parameterizations and fixed-point operators on control categories
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Call-by-name and call-by-value in normal modal logic
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A parameterized graph transformation calculus for finite graphs with monadic branches
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
We investigate the duality between call-by-name recursion and call-by-value iteration in the 驴碌-calculi and their models. Semantically, we consider that iteration is the dual notion of recursion. Syntactically, we extend the call-by-name 驴碌-calculus and the call-by-value one with a fixed-point operator and an iteration operator, respectively. This paper shows that the dual translations between the call-byname 驴碌-calculus and the call-by-value one, which is constructed by Selinger, can be expanded to our extended 驴碌-calculi. Another result of this study provides uniformity principles for those operators.