Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
Parallel reductions in λ-calculus
Journal of Symbolic Computation
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Explicit polymorphism and CPS conversion
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphism by name for references and continuations
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 2)
On the type structure of standard ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Polymorphic type assignment and CPS conversion
Lisp and Symbolic Computation - Special issue on continuations—part I
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th 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
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Extracting Constructive Content from Classical Logic via Control-like Reductions
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Simple Calculus of Exception Handling
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Calculus of Classical Proofs I
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Polymorphic Call-by-Value Calculus Based on Classical Proofs
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
A CPS-Translation of the Lambda-µ-Calculus
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Partially Typed Terms between Church-Style and Curry-Style
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Type checking and typability in domain-free lambda calculi
Theoretical Computer Science
Type checking and inference are equivalent in lambda calculi with existential types
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
We introduce an explicitly typed λµ-calculus of call-by-value as a short-hand for the 2nd order Church-style. Our motivation comes from the observation that in Curry-style polymorphic calculi, control operators such as callcc or µ-operators cannot, in general, treat the terms placed on the control operator's left. Following the continuation semantics, we also discuss the notion of values in classical system, and propose an extended form of values. It is shown that the CPS-translation is sound with respect to λ2 (2nd order λ-calculus). Next, we provide an explicitly and an implicitly typed Damas-Milner systems with µ-operators. Finally, we give a brief comparison with standard ML plus callcc, and discuss a natural way to avoid the unsoundness of ML with callcc.