Call-by-name and call-by-value in normal modal logic

Authors:
Yoshihiko Kakutani
Affiliations:
Department of Information Science, University of Tokyo
Venue:
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Year:
2007

Citing 16
Cited 1

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Linear logic

Theoretical Computer Science
Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
A formulae-as-type notion of control

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
A Curry-Howard foundation for functional computation with control

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal logic

Modal logic
A modal analysis of staged computation

Journal of the ACM (JACM)
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
What is a Categorical Model of Intuitionistic Linear Logic?

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Duality between Call-by-Name Recursion and Call-by-Value Iteration

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A CPS-Translation of the Lambda-µ-Calculus

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Continuation models are universal for lambda-mu-calculus

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Lambda calculus schemata

Proceedings of ACM conference on Proving assertions about programs
Call-by-value is dual to call-by-name

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Control categories and duality: on the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science

Classical Natural Deduction for S4 Modal Logic

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extensions of the λµ-calculi, and their semantics are given by CPS transformations into a calculus corresponding to the intuitionistic fragment of K. The duality between call-byname and call-by-value with modalities is investigated in our calculi.