Complete restrictions of the intersection type discipline
Theoretical Computer Science
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Handbook of logic in computer science (vol. 2)
An equivalence between lambda-terms
Theoretical Computer Science
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Term rewriting and all that
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Une Extension de la Theorie des Types en lambda-Calcul
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
Journal of Functional Programming
Resource operators for λ-calculus
Information and Computation
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Completing Herbelin's programme
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Simple proofs of characterizing strong normalization for explicit substitution calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Intuitionistic sequent-style calculus with explicit structural rules
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Solvability in resource lambda-calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Hi-index | 0.00 |
We propose intersection type assignment systems for two resource control term calculi: the lambda calculus and the sequent lambda calculus with explicit operators for weakening and contraction. These resource control calculi, λ® and λ®Gtz, respectively, capture the computational content of intuitionistic natural deduction and intuitionistic sequent logic with explicit structural rules. Our main contribution is the characterisation of strong normalisation of reductions in both calculi. We first prove that typability implies strong normalisation in λ® by adapting the reducibility method. Then we prove that typability implies strong normalisation in λ®Gtz by using a combination of well-orders and a suitable embedding of λ®Gtz-terms into λ®-terms which preserves types and enables the simulation of all its reductions by the operational semantics of the λ®-calculus. Finally, we prove that strong normalisation implies typability in both systems using head subject expansion.