The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We give positive answers to the following decision problems for the intersection type system λΛ and its variations; (1) the type checking problem of normalizing terms for λΛ, (2) the inhabitation problem for the system λΛ without (ΛI)-rule, and (3) the same problem for a typed counterpart of λΛ (or the intersection type system à la Church). Our result (1) contrasts with the well-known negative answer...
Two variations of the intersection type assignment system are studied in connection with Böhm-trees. One is the intersection type assignment system with a non-standard subtype relation, by means of which we characterize whereabouts of D in Böhm-trees. The other is a refinement of the intersection type assignment system whose restricted typability is shown to coincide with finiteness of Böhm-trees.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.