Skip to main content
Notre Dame Journal of Formal LogicVolume 37, Issue 1, Winter 1996, Pages 44-52

Strong normalization and typability with intersection types(Article)(Open Access)

  Save all to author list
  • Faculty of Engineering, University of Novi Sad, Trg Dositeja Obradovica 6, Novi Sad, 21000, Serbia

Abstract

A simple proof is given of the property that the set of strongly normalizing lambda terms coincides with the set of lambda terms typable in certain intersection type assignment systems. © 1996 by the University of Notre Dame. All rights reserved.

  • ISSN: 00294527
  • Source Type: Journal
  • Original language: English
  • DOI: 10.1305/ndjfl/1040067315
  • Document Type: Article

  Ghilezan, S.; Faculty of Engineering, University of Novi Sad, Trg Dositeja Obradovica 6, Serbia;
© Copyright 2017 Elsevier B.V., All rights reserved.

Cited by 28 documents

Parreaux, L. , Chau, C.Y.
MLstruct: principal type inference in a Boolean algebra of structural types
(2022) Proceedings of the ACM on Programming Languages
Ke, W. , Chan, K.-H.
Pattern Matching Based on Object Graphs
(2021) IEEE Access
Kashima, R. , Matsuda, N. , Yuyama, T.
Term-space semantics of typed lambda calculus
(2021) Notre Dame Journal of Formal Logic
View details of all 28 citations
Inform me when this document is cited in Scopus:
Set citation alert Set citation feed
{"topic":{"name":"Lambda-calculus; Type Systems; Calculus","id":33160,"uri":"Topic/33160","prominencePercentile":27.896057,"prominencePercentileString":"27.896","overallScholarlyOutput":0},"dig":"f5ea0a64bdca2caa5e8ecf618d9920135a9ea988381a5e6a51aa7ad50054ec63"}

SciVal Topic Prominence

Topic:
Prominence percentile: