Typing termination in a higher-order concurrent imperative language
From MaRDI portal
Publication:979082
DOI10.1016/J.IC.2009.06.007zbMATH Open1213.68159OpenAlexW2127169000MaRDI QIDQ979082FDOQ979082
Authors: Gérard Boudol 
Publication date: 25 June 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.06.007
Recommendations
Cites Work
- The Esterel synchronous programming language: Design, semantics, implementation
- Title not available (Why is that?)
- On the interpretation of intuitionistic number theory
- Title not available (Why is that?)
- A syntactic approach to type soundness
- Frontiers of Combining Systems
- Operational reasoning for functions with local state
- Intensional interpretations of functionals of finite type I
- The Mechanical Evaluation of Expressions
- The type and effect discipline
- Verification of non-functional programs using interpretations in type theory
- Relational Reasoning for Recursive Types and References
- Typed Lambda Calculi and Applications
- Programming Languages and Systems
- Theoretical Aspects of Computing – ICTAC 2005
- Termination of processes
- Strong normalisation in the \(\pi\)-calculus
- Region-based memory management
- Title not available (Why is that?)
- Syntactic logical relations for polymorphic and recursive types
- Title not available (Why is that?)
- Relational interpretations of recursive types in an operational setting.
- Programming Languages and Systems
- Higher-Order Termination: From Kruskal to Computability
- Typing Safe Deallocation
Cited In (8)
- Termination in impure concurrent languages
- Termination in higher-order concurrent calculi
- Termination in higher-order concurrent calculi
- A Kripke logical relation for effect-based program transformations
- Safe session-based concurrency with shared linear state
- An elementary affine \(\lambda \)-calculus with multithreading and side effects
- Fair Cooperative Multithreading
- Linear logical relations and observational equivalences for session-based concurrency
Uses Software
This page was built for publication: Typing termination in a higher-order concurrent imperative language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979082)
