Conservation and uniform normalization in Lambda calculi with erasing reductions
Information and Computation
Proof-Directed De-compilation of Low-Level Code
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Curry-Howard Isomorphism for Compilation and Program Execution
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Strong Normalisation of Cut-Elimination in Classical Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Revisiting the Correspondence between Cut Elimination and Normalisation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Computational types from a logical perspective
Journal of Functional Programming
Pattern matching as cut elimination
Theoretical Computer Science
On structuring proof search for first order linear logic
Theoretical Computer Science
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
A proof theory for machine code
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strong normalisation for a gentzen-like cut-elimination procedure
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A cut-free sequent calculus for pure type systems verifying the structural rules of Gentzen/Kleene
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Completing Herbelin's programme
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
| Hi-index | 5.23 |