Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Complete restrictions of the intersection type discipline;van Bakel;Theoretical Computer Science,1992
2. Intersection type assignment systems;van Bakel;Theoretical Computer Science,1995
3. Cut-elimination in the strict intersection type assignment system is strongly normalising;van Bakel;Notre Dame Journal of Formal Logic,2004
4. Approximation and normalization results for typeable term rewriting systems;van Bakel,1996
5. Normalization results for typeable rewrite systems;van Bakel;Information and Computation,1997
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types;ACM Transactions on Computational Logic;2018-02-15
2. Characterisation of Approximation and (Head) Normalisation for λμ using Strict Intersection Types;Electronic Proceedings in Theoretical Computer Science;2017-02-07
3. Compositional higher-order model checking via
ω
-regular games over Böhm trees;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
4. Semantic Types and Approximation for Featherweight Java;Theoretical Computer Science;2014-01
5. Strict intersection types for the Lambda Calculus;ACM Computing Surveys;2011-04