A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CPS translating inductive and coinductive types
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Cut Elimination for Classical Proofs as Continuation Passing Style Computation
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
A CPS-Transform of Constructive Classical Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
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
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
Journal of Functional Programming
Strong normalization of the second-order symmetric λμ-calculus
Information and Computation
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Logic, Language, and Computation
Pedagogical second-order λ-calculus
Theoretical Computer Science
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Strong normalization of classical natural deduction with disjunction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Parigot's second order λµ-calculus and inductive types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th 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
Arithmetical proofs of strong normalization results for the symmetric λµ-calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi 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
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Hi-index | 0.01 |