Typing termination in a higher-order concurrent imperative language-Reference-Cited by-同舟云学术

Typing termination in a higher-order concurrent imperative language

Published:2010-06 Issue:6 Volume:208 Page:716-736
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Boudol Gérard

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference39 articles.

1. A. Adya, J. Howell, M. Theimer, W.J. Bolosky, H.R. Douceur, Cooperative task management without manual stack management or, Event-driven programming is not the opposite of threaded programming, Usenix ATC, 2002.

2. Step-indexed syntactic logical relations for recursive quantified types;Ahmed;ESOP’06, Lecture Notes in Computer Science,2006

3. A stratified semantics of general references embeddable in higher-order logic;Ahmed;LICS’02,2002

4. An indexed model of recursive types for foundational proof-carrying code;Appel;ACM TOPLAS,2001

5. Lambda calculi with types;Barendregt,1992

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

1. Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations;Proceedings of the ACM on Programming Languages;2023-01-09

2. Safe Session-Based Concurrency with Shared Linear State;Programming Languages and Systems;2023

3. Transfinite step-indexing for termination;Proceedings of the ACM on Programming Languages;2021-01-04

4. A Kripke logical relation for effect-based program transformations;Information and Computation;2016-08

5. Mashic compiler: Mashup sandboxing based on inter-frame communication;Journal of Computer Security;2016-03-01