Author:
Barbanera Franco,Martini Simone
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. [Anderson & Belnap 75] Anderson A., Belnap N.: Entailment vol. I, Princeton, Princeton University Press 1975
2. [Alessi & Barbanera 91] Alessi F., Barbanera F.: Strong conjunction and intersection types, Lect. Notes Comput. Sci.520, 64?73 (1991)
3. [Barendegt 1984] Barendregt H.: The lambda calculus: its syntax and semantics, Amsterdam: North Holland (1984)
4. [Barendregt et al. 83] Barendregt H., Coppo M., Dezani M.: A filter lambda model and the completeness of type assignment. J. Symb. Logic48(4), 931?940 (1983)
5. [Bruce & Longo 85] Bruce K., Longo G.: Provable isomorphisms and domain equations in models of typed languages. ACM Symp. Theory Computing (1985)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. YACC: Yet Another Church Calculus;Lecture Notes in Computer Science;2024
2. Plugging-in proof development environments usingLocksinLF;Mathematical Structures in Computer Science;2018-05-15
3. Towards a Logical Framework with Intersection and Union Types;Proceedings of the Workshop on Logical Frameworks and Meta-Languages: Theory and Practice;2017-09-08
4. A Decidable Subtyping Logic for Intersection and Union Types;Topics in Theoretical Computer Science;2017
5. A Realizability Interpretation for Intersection and Union Types;Programming Languages and Systems;2016