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
An interpretation of λµ-calculus in λ-calculus
Information Processing Letters
Polarized proof-nets and λµ-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 confluent λ-calculus with a catch/throw mechanism
Journal of Functional Programming
Strong normalization of the second-order symmetric λμ-calculus
Information and Computation
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Computation with classical sequents
Mathematical Structures in Computer Science
On the Relations between the Syntactic Theories of λμ-Calculi
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Intuitionistic Letcc via Labelled Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Arithmetical proofs of strong normalization results for the symmetric λµ-calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
| Hi-index | 0.00 |