Adult attachment and prolonged grief:A systematic review and meta-analysis

Diagnoses characterized by severe, persistent and disabling grief have recently been added to the ICD-11 and DSM-5-TR as prolonged grief disorder. Adult attachment is widely assumed critical in the development, persistence, and treatment of prolonged grief, yet a meta-analysis on this topic is lacking. We conducted a systematic review (PROSPERO: CRD42021220511) searching PsycInfo, Web of Science, and PubMed (final search: August 2022) to identify and summarize quantitative research examining relationships between adult attachment (i.e., attachment anxiety, attachment avoidance, secure attachment, disorganized attachment) and prolonged grief symptoms. Thirty-one studies including 8347 bereaved adults were included. Attachment anxiety (r = 0.28, 95 % CI:0.23–0.32, k = 15) and attachment avoidance (r = 0.15, 95 % CI:0.05–0.26, k = 15) related positively to prolonged grief symptoms concurrently. We found no evidence of publication bias but did detect heterogeneity in effect sizes. Ten longitudinal analyses showed no evidence that insecure attachment styles increase prolonged grief symptoms. Attachment anxiety predicted better therapy outcomes. Insecure attachment styles are concurrently positively related to prolonged grief symptoms but do not increase grief severity. The role of adult attachment in contemporary grief theories may need reconsideration. Intensive longitudinal research should aim to clarify how dynamic changes in attachment to the deceased and others relate to changes in prolonged grief symptoms.</p

Unsafe Grammars and Panic Automata

International audienceWe show that the problem of checking if an infinite tree gen- erated by a higher-order grammar of level 2 (hyperalgebraic) satisfies a given µ-calculus formula (or, equivalently, if it is accepted by an al- ternating parity automaton) is decidable, actually 2-Exptime-complete. Consequently, the monadic second-order theory of any hyperalgebraic tree is decidable, so that the safety restriction can be removed from our previous decidability result. The last result has been independently obtained by Aehlig, de Miranda and Ong. Our proof goes via a char- acterization of possibly unsafe second-order grammars by a new variant of higher-order pushdown automata, which we call panic automata. In addition to the standard pop 1 and pop 2 operations, these automata have an option of a destructive move called panic . The model-checking prob- lem is then reduced to the problem of deciding the winner in a parity game over a suitable 2nd order pushdown system

Typing weak MSOL properties

International audienceWe consider non-interpreted functional programs: the result of the execution of a program is its normal form, that can be seen as the tree of calls to built-in operations. Weak monadic second-order logic (wMSO) is well suited to express properties of such trees. This is an extension of first order logic with quantification over finite sets. Many behavioral properties of programs can be expressed in wMSO. We use the simply typed lambda calculus with the fixpoint operator, $\lambda Y$-calculus, as an abstraction of functional programs that faithfully represents the higher-order control flow. We give a type system for ensuring that the result of the execution of a $\lambda Y$-program satisfies a given wMSO property. The type system is an extension of a standard intersection type system with both: the least-fixpoint rule, and a restricted version of the greatest-fixpoint rule. In order to prove soundness and completeness of the system we construct a denotational semantics of $\lambda Y$-calculus that is capable of computing properties expressed in wMSO. The model presents many symmetries reflecting dualities in the logic and has also other applications on its own. The type system is obtained from the model following the domain in logical form approach

Untyped Recursion Schemes and Infinite Intersection Types

Abstract. A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then model-checked. As recursion schemes are essentially terms of the simply-typed lambda-calculus with recursion and tree constructors, however, it was not clear how the new framework applies to programs written in languages with more advanced type systems. To circumvent the limitation, this paper introduces an untyped version of recursion schemes and develops an in-finite intersection type system that is equivalent to the model checking of untyped recursion schemes, so that the model checking can be re-duced to type checking as in recent work by Kobayashi and Ong for typed recursion schemes. The type system is undecidable but we can obtain decidable subsets of the type system by restricting the shapes of intersection types, yielding a sound (but incomplete in general) model checking algorithm.

Safety is not a restriction at level 2 for string languages

Recent work by Knapik, Niwinski and Urzczyn [KNU02] has revived interest in the connexions between higher-order grammars and higher-order pushdown automata. Both devices can be viewed as definitions for term trees as well as string languages. In the latter setting we recall the extensive study by Damm [Dam82], and Damm and Goerdt [DG86]. There it was shown that the language of a level-n higher-order grammar is accepted by a level-n higher-order pushdown automaton subject to the restriction of derived types, more recent rebranded as safety. We show that at level 2, if a string language is generated by an unsafe grammar, there is a (level-2, non-deterministic) safe grammar that generates the same language. Thus safety is not a restriction for level-2 string languages