Principal type scheme and unification for intersection type discipline
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Lambda-calculus, types and models
Lambda-calculus, types and models
Terminiation of permutative conversions in intuitionistic Gentzen calculi
Theoretical Computer Science - Special issue: Gentzen
Domains and lambda-calculi
Une Extension de la Theorie des Types en lambda-Calcul
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Standardization and Confluence for a Lambda Calculus with Generalized Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
Permutative conversions in intuitionistic multiary sequent calculi with cuts
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
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
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
Characterising Strongly Normalising Intuitionistic Terms
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper's sequent term calculus integrates smoothly the λ-terms with generalised application or explicit substitution. Strong normalisability of these terms as sequent terms characterises their typeability in certain "natural" typing systems with intersection types. The latter are in the natural deduction format, like systems previously studied by Matthes and Lengrand et al., except that they do not contain any extra, exceptional rules for typing generalised applications or substitution.