A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strong normalizability of the non-deterministic catch/throw calculi
Theoretical Computer Science - Special issue on theories of types and proofs
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
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
An intuitionistic λ-calculus with exceptions
Journal of Functional Programming
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Proofs, tests and continuation passing style
ACM Transactions on Computational Logic (TOCL)
Practical Program Extraction from Classical Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
Strong normalization of classical natural deduction with disjunction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Light functional interpretation
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Hi-index | 0.00 |