Author:
Aspinall David,Compagnoni Adriana
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. D. Aspinall, Subtyping with singleton types, Proc. Computer Science Logic, CSL’94, Kazimierz, Poland, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995.
2. D. Aspinall, Type systems for modular programs and specification, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1997.
3. D. Aspinall, A. Compagnoni, Subtyping dependent types, in: E. Clarke (Ed.), Proc. 11th Annual IEEE Symp. on Logic in Computer Science, New Brunswick, New Jersey, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 86–97.
4. Using typed lambda calculus to implement formal systems on a machine;Avron;J. Automat. Reason.,1992
5. Lambda calculi with types, Handbook of Logic in Computer Science;Barendregt,1992
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Definitional Functoriality for Dependent (Sub)Types;Lecture Notes in Computer Science;2024
2. Trocq: Proof Transfer for Free, With or Without Univalence;Lecture Notes in Computer Science;2024
3. Label dependent lambda calculus and gradual typing;Proceedings of the ACM on Programming Languages;2021-10-20
4. A theory of higher-order subtyping with type intervals;Proceedings of the ACM on Programming Languages;2021-08-22
5. Label-dependent session types;Proceedings of the ACM on Programming Languages;2020-01