| F. Barbanera, M. Dezani-Ciancaglini, and F.-J. de Vries. Types for trees. In Proceedings of PROCOMET'98, pages 11-29. Chapman & Hall, London, 1998. |
....context in the concurrent calculus. For the classical calculus the more common way of comparing terms is to consider their Bohm trees [7, Chapter 10] So a natural question is what can be added to the pure calculus in order to give it the discriminating power of Bohm trees. The paper [6] gives a type assignment system in which two terms have the same types iff they have the same Bohm trees. Starting from this result, 16] proves that adding to the pure calculus a non deterministic choice operator and an adequate numeral system we obtain a language which internally discriminates ....
Barbanera, F., Dezani-Ciancaglini, M., and de Vries, F.J. (1998), Types for trees, in "Proc. PROCOMET'98", (D.Gries and W.P.de Rover, Eds.), pp.11-29, Chaptman&Hall, London. 35
....orders it according to the order it is produced, then it is quite natural to obtain a tree representation of the information implicitly contained in the original term. There exist many tree representations in literature, depending on the possible notions of stable relevant information [16] 17] [3]. If only head normal forms are stable, i.e. terms of the shape x 1 : x n :yM 1 : Mm , then we obtain the notion of B ohm trees [4] If we consider stable weak head normal forms (i.e. also all abstractions) we get the notion of L evy Longo trees [23] Lastly when all top normal forms ....
F. Barbanera, M. Dezani-Ciancaglini, and F.-J. d. Vries. Types for trees. In PROCOMET'98 (Shelter Island, 1998), pages 6-29. Chapman & Hall, London, 1998.
....of models dates to the 70 s. Beside Bohm trees, introduced in Barendregt book [15] and recently considered in [41] L evy Longo trees have been known and studied at length: see [63, 64, 70] A survey of various notions of trees and a study of their description via intersection type assignment is [14]. Since, given an arbitrary term, it is undecidable whether it can be typed using intersection types, it is interesting to look for decidable restrictions, see [12, 36] The inhabitation problem for intersection types (given a type decide whether there is a term typable with that type) is also ....
F. Barbanera, M. Dezani-Ciancaglini, F.-J. de Vries, "Types for Trees", PROCOMET '98, Chapman & Hall, London, 1998, 11-29.
No context found.
F. Barbanera, M. Dezani-Ciancaglini, and F.-J. de Vries. Types for trees. In Proceedings of PROCOMET'98, pages 11-29. Chapman & Hall, London, 1998.
No context found.
F. Barbanera, M. Dezani-Ciancaglini, F.-J. de Vries, "Types for Trees", PROCOMET '98, Chapman & Hall, London, 1998, 11-29.
No context found.
F. Barbanera, M. Dezani-Ciancaglini, and F.-J. d. Vries. Types for trees. In PROCOMET'98 (Shelter Island, 1998.
No context found.
F. Barbanera, M. Dezani-Ciancaglini, F.J. de Vries, "Types for Trees", PROCOMET'98 , Chaptman&Hall, 1998, 11-29.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC