A proof-theoretic foundation of abortive continuations-Reference-Cited by-同舟云学术

A proof-theoretic foundation of abortive continuations

Published:2007-10-24 Issue:4 Volume:20 Page:403-429
ISSN:1388-3690
Container-title:Higher-Order and Symbolic Computation
language:en
Short-container-title:Higher-Order Symb Comput

Author:

Ariola Zena M.,Herbelin Hugo,Sabry Amr

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s10990-007-9007-z.pdf

Reference32 articles.

1. Lecture Notes in Computer Science;Z.M. Ariola,2003

2. Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of continuations and prompts. In: ACM SIGPLAN International Conference on Functional Programming, pp. 40–53. ACM Press, New York (2004)

3. Ariola, Z.M., Herbelin, H., Sabry, A.: A proof-theoretic foundation of abortive continuations (extended version). Technical Report TR608, Computer Science Department, Indiana University (2005)

4. Avron, A.: Natural 3-valued logics—characterization and proof theory. J. Symb. Log. 56(1), 276–294 (1991)

5. Lecture Notes in Computer Science;F. Barbanera,1993

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ADDING NEGATION TO LAMBDA MU;LOG METH COMPUT SCI;2023

2. Exception Handling and Classical Logic;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07

3. BISIMULATIONS FOR DELIMITED-CONTROL OPERATORS;LOG METH COMPUT SCI;2019

4. PROVING SOUNDNESS OF EXTENSIONAL NORMAL-FORM BISIMILARITIES;LOG METH COMPUT SCI;2019

5. Postponement of $$\mathsf {raa}$$ raa and Glivenko’s Theorem, Revisited;Studia Logica;2018-03-09