Author:
Ariola Zena M.,Herbelin Hugo,Saurin Alexis
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Lecture Notes in Computer Science;Z. Ariola,2003
2. Ariola, Z.M., Bohannon, A., Sabry, A.: Sequent calculi and abstract machines. Transactions on Programming Languages and Systems (TOPLAS) 31(4), 275–317 (2009)
3. Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. J. Funct. Program. 7(3), 265–301 (1997)
4. Ariola, Z.M., Herbelin, H.: Control reduction theories: the benefit of structural substitution. J. Funct. Program. 18(3), 373–419 (2008)
5. Ariola, Z.M., Herbelin, H., Sabry, A.: A proof-theoretic foundation of abortive continuations. Higher Order Symbol. Comput. 20, 403–429 (2007)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Consuming and Persistent Types for Classical Logic;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
2. Abstracting models of strong normalization for classical calculi;Journal of Logical and Algebraic Methods in Programming;2020-02
3. Types by Need;Programming Languages and Systems;2019
4. Uniform Strong Normalization for Multi-discipline Calculi;Rewriting Logic and Its Applications;2018
5. A tutorial on computational classical logic and the sequent calculus;Journal of Functional Programming;2018