Introduction to higher order categorical logic
Introduction to higher order categorical logic
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
An interpretation of λµ-calculus in λ-calculus
Information Processing Letters
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th 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
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Galois embedding from polymorphic types into existential types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
A hierarchy for delimited continuations in call-by-name
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We investigate injectivity of the novel CPS-translation with surjective pairing which is originally introduced by Hofmann-Streicher. It is syntactically proved that the CPS-translation is sound and complete not only for the λ-calculus but also for the extensional λµ-calculus. The injective CPS-translation reveals a Church-Rosser fragment of the λ-calculus with surjective pairing and a neat connection to C-monoids.