Lambda-calculus, types and models
Lambda-calculus, types and models
Semantical analysis of perpetual strategies in &lgr;-calculus
Theoretical Computer Science - Special issue: Gentzen
Normalisation is Insensible to \lambda-Term Identity or Difference
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
On strong normalization in the intersection type discipline
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Calculi, types and applications
Theoretical Computer Science
Complexity of strongly normalising λ-terms via non-idempotent intersection types
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Hi-index | 0.00 |
A model characterising strong normalisation for Klop's extension of @l-calculus is presented. The main technical tools for this result are an inductive definition of strongly normalising terms of Klop's calculus and an intersection type system for terms of Klop's calculus.