Characterising Strong Normalisation for Explicit Substitutions

  title={Characterising Strong Normalisation for Explicit Substitutions},
  author={Steffen van Bakel and Mariangiola Dezani-Ciancaglini},
We characterisethestronglynormalisingtermsof a composition-free calculusof explicit substitutions(with or without garbagecollection)by means of anintersectiontypeassignment system.Themainnovelty is a cut-rulewhich allows to forget the context of the minor premisewhenthe context of the main premisedoesnothaveanassumptionfor thecutvariable. 

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 53 references

Lescanne.Reductions, intersectiontypesandexplicit substitutions.In TypedLambdaCalculi andApplications2001, volume2044of Lecture Notesin Computer Science, pages121–135.Springer

  • D. DoughertyandP
  • 2001
Highly Influential
10 Excerpts

andP. Lescanne,An improvedsystemof intersectiontypesfor explicit substitutions,InternalReport,ENSdeLyon,2001

  • S.Lengrand, D. Dougherty
  • 2001
Highly Influential
3 Excerpts

Foundationfor ProgrammimgLanguages. MIT Press,1996

  • J. C. Mitchell
  • 1996
Highly Influential
4 Excerpts

Type systemsfor programminglanguages

  • J. C. Mitchell
  • In Handbookof Theoretical ComputerScience…
  • 1990
Highly Influential
4 Excerpts

Melli ès . Typed Äcalculiwith explicit substitutionmaynotterminate

  • P.-A.
  • TypedLambda Calculi and Applications 2001…
  • 2001

Typinguntyped Äterms , or reducibilitystrikesagain !

  • J. Gallier.
  • Annalsof PureandApplied Logic
  • 2001

Compositional characterization of λterms using intersection types

  • F. Honsell M. Dezani-Ciancaglini, Y. Motohama
  • Mathematical Foundations of Computer Science
  • 2000

Compositionalcharacterizationof Ä -termsusingintersectiontypes

  • M. Dezani-Ciancaglini, F. Honsell, andY. Motohama
  • In MathematicalFoundationsof ComputerScience2000…
  • 2000
2 Excerpts

Similar Papers

Loading similar papers…