Author:
Brunel Aloïs,Madet Antoine
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;R.M. Amadio,2009
2. Appel, A.W., McAllester, D.: An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems (TOPLAS) 23(5), 657–683 (2001)
3. Asperti, A.: Light affine logic. In: Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, pp. 300–308 (1998)
4. Baillot, P.: Stratified coherence spaces: a denotational semantics for light linear logic. Theoretical Computer Science 318(1), 29–55 (2004)
5. Brunel, A.: Quantitative classical realizability (submitted, 2012)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Transfinite step-indexing for termination;Proceedings of the ACM on Programming Languages;2021-01-04
2. A Core Quantitative Coeffect Calculus;Programming Languages and Systems;2014