Search

En los años 2000 surgieron en las Américas nuevas formas teatrales basadas en una renovación de las escrituras dramáticas y de las prácticas escénicas. Tras los experimentos de los años sesenta, esas escrituras plurales, híbridas, concebidas para y desde las tablas, y que ignoran las fronteras genéricas, llevan a replantearse las relaciones entre texto y escenario, dentro de un territorio artístico amplio y complejo, donde existe una tensión permanente entre lo real y lo ficcional, entre el p...

Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarded variants. GKAT is more efficiently decidable than KAT and expressive enough to model simple imperative programs, making it attractive for applications to e.g. network verification. In this paper, we further explore GKAT's automata theory, and present GL*, an algorithm for learning the GKAT automaton representation of a black-box, by observing its behaviour. A complexity analysis shows that it is more efficient to learn a representation of a GKAT program with GL* than with Angluin's existing L* algorithm. We implement GL* and L* in OCaml and compare their performances on example programs.

Compact representations of automata are important for efficiency. In this paper, we study methods to compute reduced automata, in which no two states accept the same language. We do this for finitary automata (FA), an abstract definition that encompasses probabilistic and weighted automata. Our procedure makes use of Milius' locally finite fixpoint. We present a reduction algorithm that instantiates to probabilistic and S-linear weighted automata (WA) for a large class of semirings. Moreover, we propose a potential connection between properness of a semiring and our provided reduction algorithm for WAs, paving the way for future work in connecting the reduction of automata to the properness of their associated coalgebras.

We introduce Probabilistic Guarded Kleene Algebra with Tests (ProbGKAT), an extension of GKAT that allows reasoning about uninterpreted imperative programs with probabilistic branching. We give its operational semantics in terms of special class of probabilistic automata. We give a sound and complete Salomaa-style axiomatisation of bisimilarity of ProbGKAT expressions. Finally, we show that bisimilarity of ProbGKAT expressions can be decided in O(n³ log n) time via a generic partition refinement algorithm., LIPIcs, Vol. 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), pages 136:1-136:20

We give a lightweight alternative construction of Jacobs's distributive law for multisets and distributions that does not involve any combinatorics. We first give a distributive law for lists and distributions, then apply a general theorem on 2-categories that allows properties of lists to be transferred automatically to multisets. The theorem states that equations between 2-cells are preserved by epic 2-natural transformations. In our application, the appropriate epic 2-natural transformation is defined in terms of the Parikh map, familiar from formal language theory, that takes a list to its multiset of elements., Comment: 9 pages, 3 figures

Tema: automedica����o em tempos de pandemia. Problema: Quais os desafios do profissional em farm��cia diante da automedica����o durante a pandemia do novo coronav��rus pela popula����o brasileira? Hip��tese: o uso indiscriminado de medicamentos �� um problema grave em tempos de pandemia, que amea��a a sa��de f��sica e mental das pessoas que utilizam esses procedimentos. Objetivos: analisar os desafios dos farmac��uticos diante da automedica����o durante a pandemia do novo coronav��rus pela popula����o brasileira. Justificativa: no Brasil a automedica����o representa um risco que pode causar graves problemas de sa��de e o farmac��utico tem papel importante na educa����o quanto ao uso de medicamentos. Metodologia: Trata-se de uma revis��o bibliogr��fica. Resultados: durante a pandemia o uso irracional de drogas prevaleceu devido ��s supostas possibilidades de cura para a Covid-19.

Flooding and erosion are among the most relevant hazards for coastal regions and although they are linked, their inherent complexity has typically led them to be addressed separately, potentially leading to highly uncertain estimates. This paper has three aims: (a) to present a methodology for coupling coastal flood projections with shoreline changes; (b) to quantify the effects of neglecting the coupling of flooding and erosion on future projections at a case study location; and (c) to analyse the relative importance of the climate-related uncertainty sources. We use a suite of statistical, process-based, and physics-based models to generate and downscale storms, compute water levels affected by storm morphodynamics and long-term profile changes and propagate flooding over topo-bathymetries that are in turn modified to incorporate the impact of sea-level rise, longshore sediment transport and storm-driven erosion. We sample climate uncertainty by considering storm variability (synthetic generation) and ensembles of radiative forcing scenarios, regional climate models, and sea-level rise trajectories. For illustration purposes, we consider a 40-km coastal stretch in the Spanish Mediterranean. We find that if the effect of erosion is neglected, the mean values of the total water level and flooded area can be either over- or underestimated by up to 18% and 22%, and up to 7% and 85%, respectively, with respect to our coupled results. The factors that most influence total water levels are storm erosion and profile geometry, highlighting the relevance of using real profiles in shoreface translation. In the flooded area, longshore transport can play a fundamental enhancing role. We also find that the coupling approach used can contribute more to the projection of flooded areas than the choice of climate models and sea-level rise trajectories even by 2100 (up to 76% versus 8% and 16%, respectively). We conclude that neglecting erosion effects on coastal flooding can have management implications, especially for urban beaches, leading to poor adaptation planning and maladaptation. This study was partially funded by the Spanish Government through the grant COASTALfutures (PID2021-126506OB-100); the Government of Cantabria through the FENIX Project; and the European Union’s Horizon 2020 CoCliCo Project (grant agreement No 101003598). AT and MA-C are also funded by the Spanish Ministry of Science and Innovation through the Ramon y Cajal Programme (RYC2021-030873-I) and the FPI studentship (PRE-2018-085009), respectively.

In this paper, a proof-theoretic method to prove uniform Lyndon interpolation for non-normal modal logics is introduced and applied to show that the logics \(\mathsf {E}\), \(\mathsf {M}\), \(\mathsf {MC}\), \(\mathsf {EN}\), \(\mathsf {MN}\) have that property. In particular, these logics have uniform interpolation. Although for some of them the latter is known, the fact that they have uniform Lyndon interpolation is new. Also, the proof-theoretic proofs of these facts are new, as well as the constructive way to explicitly compute the interpolants that they provide. It is also shown that the non-normal modal logics \(\mathsf {EC}\) and \(\mathsf {ECN}\) do not have Craig interpolation, and whence no uniform (Lyndon) interpolation.

This study aimed to examine the effects of players and targets number variation on technical, tactical and physiological indicators in basketball, handball and indoor football. Nine 8th grade students (age 13.3 ± 0.7 years, stature 166.8 ± 3.8 cm, body mass 55.3 ± 4.2 kg) participated in four small-sided games (SSG) for each sport. Despite the differences between the sports, similar average values for technical and tactical indicators were found in both basketball and indoor football SSG. An increase in the number of players affected the duration of unsuccessful offensive phases, the number of passes per offensive phase, successful passes per offensive phase and decreased ball possession per player. Whilst all SSG in this study imposed high physiological demands, 3-a-side games played with one target elicited the greatest responses. In conclusion, the 3-a-side SSG promoted similar technical-tactical indicators and higher physiological demands than 4-a-side SSG. Este estudio tuvo como objetivo examinar los efectos del número de jugadores y metas en la variación de los indicadores técnicos, tácticos y fisiológicos en baloncesto, balonmano y fútbol sala. Nueve estudiantes del octavo grado (edad 13.3 ± 0.7 años, estatura 166.8 ± 3.8 cm, masa corporal 55.3 ± 4.2 kg) participarón en cuatro juegos reducidos (SSG) para cada deporte. A pesar de las diferencias entre los deportes, se encontrarón valores medios similares en los indicadores técnicos y tácticos tanto en los juegos reducidos del baloncesto como en los de fútbol sala. El aumento de los jugadores ha provocado el aumento de la duración de la fase ofensiva sin éxito, número de pases por fase ofensiva, pases acertados por fase ofensiva y ha provocado una disminución de la posesión del balón por jugador. Mientras la totalidad de juegos reducidos utilizados en este estudio han impuesto un elevada demanda fisiológica, los juegos reducidos de 3x3 jugados con una meta provocaron las mayores respuestas. En conclusión, los juegos reducidos de 3x3 ha inducido valores similares en los indicadores técnico-tácticos, pero demandas fisiológicas más altas que los juegos reducidos de 4x4. Este estudo teve como objectivo analisar os efeitos do número de jogadores e dos objectivos na variação dos indicadores técnicos, tácticos e fisiológicos no basquetebol, andebol e futsal. Nove estudantes do oitavo ano (idade 13.3 ± 0.7 anos, estatura 166.8 ± 3.8 cm, massa corporal 55.3 ± 4.2 kg) participaram em quatro jogos reduzidos (SSG) para cada modalidade. Apesar das diferenças entre os desportos, foram verificados valores médios similares nos indicadores técnicos e tácticos nos jogos reduzidos de basquetebol e futsal. O aumento dos jogadores provocou o aumento da duração da fase ofensiva sem êxito, número de passes por fase ofensiva, passes certos por fase ofensiva e provocou uma diminuição da posse de bola por jogador. Enquanto a totalidade de jogos reduzidos utilizados neste estudo implicou uma elevada exigência fisiológica, os jogos reduzidos de 3X3 jogados com um objectivo provocaram as maiores respostas. Em suma, os jogos reduzidos de 3x3 induziram valores similares nos indicadores técnico-tácticos, mas exigências fisiológicas mais elevadas que os jogos reduzidos de 4X4.

We study reinforcement learning for the optimal control of Branching Markov Decision Processes (BMDPs), a natural extension of (multitype) Branching Markov Chains (BMCs). The state of a (discrete-time) BMCs is a collection of entities of various types that, while spawning other entities, generate a payoff. In comparison with BMCs, where the evolution of a each entity of the same type follows the same probabilistic pattern, BMDPs allow an external controller to pick from a range of options. This permits us to study the best/worst behaviour of the system. We generalise model-free reinforcement learning techniques to compute an optimal control strategy of an unknown BMDP in the limit. We present results of an implementation that demonstrate the practicality of the approach.

Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al. (2012), a dual equivalence between a category of coalgebras and a category of algebras was used to explain minimisation. The algebraic semantics is dual to a coalgebraic semantics in which logical equivalence coincides with trace equivalence. It follows that maximal quotients of coalgebras correspond to minimal subobjects of algebras. Examples include partially observable deterministic finite automata, linear weighted automata viewed as coalgebras over finite-dimensional vector spaces, and belief automata, which are coalgebras on compact Hausdorff spaces. In Bonchi et al. (2014), Brzozowski's double-reversal minimisation algorithm for deterministic finite automata was described categorically and its correctness explained via the duality between reachability and observability. This work includes generalisations of Brzozowski's algorithm to Moore and weighted automata over commutative semirings. In this paper we propose a general categorical framework within which such minimisation algorithms can be understood. The goal is to provide a unifying perspective based on duality. Our framework consists of a stack of three interconnected adjunctions: a base dual adjunction that can be lifted to a dual adjunction between coalgebras and algebras and also to a dual adjunction between automata. The approach provides an abstract understanding of reachability and observability. We illustrate the general framework on range of concrete examples, including deterministic Kripke frames, weighted automata, topological automata (belief automata), and alternating automata.

Supplemental material, 20200911_SupplementalMaterial_SLAS for Major Improvements in Robustness and Efficiency during the Screening of Novel Enzyme Effectors by the 3-Point Kinetics Assay by Maria Filipa Pinto, Francisco Figueiredo, Alexandra Silva, António R. Pombinho, Pedro José Barbosa Pereira, Sandra Macedo-Ribeiro, Fernando Rocha and Pedro M. Martins in SLAS Discovery

Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs. However, CKA fundamentally misses tests, which are needed to model standard programming constructs such as conditionals and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {while}$$\end{document}while-loops. It turns out that integrating tests in CKA is subtle, due to their interaction with parallelism. In this paper we provide a solution in the form of Concurrent Kleene Algebra with Observations (CKAO). Our main contribution is a completeness theorem for CKAO. Our result resorts on a more general study of CKA “with hypotheses”, of which CKAO turns out to be an instance: this analysis is of independent interest, as it can be applied to extensions of CKA other than CKAO.

Kleene algebra with tests (KAT) is an algebraic framework for reasoning about the control flow of sequential programs. Generalising KAT to reason about concurrent programs is not straightforward, because axioms native to KAT in conjunction with expected axioms for concurrency lead to an anomalous equation. In this paper, we propose Kleene algebra with observations (KAO), a variant of KAT, as an alternative foundation for extending KAT to a concurrent setting. We characterise the free model of KAO, and establish a decision procedure w.r.t. its equational theory.

We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and K\"onig. Then, we introduce a core language for probabilistic streams and trees, and provide two approaches to verify ASP: a sufficient syntactic criterion, and a reduction to model-checking pCTL* formulas on probabilistic pushdown automata. The reduction shows that ASP is decidable for our core language.

RESUMEN: La Tesis Doctoral Un marco para la evaluación multisectorial de los riesgos del cambio climático en zonas costeras supone un paso adelante importante en la evaluación multisectorial de los riesgos del cambio climático en zonas costeras, en particular, los relativos a la inundación y la erosión de la costa. Para ello, se han planteado y alcanzado tres objetivos específicos: 1) el desarrollo de un marco integrado (i.e., multiamenza, multiimpacto y multisectorial) para el análisis de los riesgos del cambio climático en la costa, con una clara orientación sobre cómo este marco puede ser llevado a la práctica para obtener riesgos y consecuencias; 2) la implementación del marco integrado para el análisis multisectorial de las consecuencias de la inundación costera; y 3) la implementación del marco integrado para el análisis sectorial del riesgo de erosión costera, haciendo especial énfasis en la cuantificación de la incertidumbre. ABSTRACT: The PhD Thesis A framework for the multi-sectoral assessment of climate change risks in coastal areas means a significant step forward in the multi-sectoral assessment of climate change risks in coastal areas, particularly those arising from coastal flooding and erosion. To that end, three specific objectives wet set and achieved: 1) the development of an integrated (i.e., multi-hazard, multi-impact and multi-sectoral) framework for climate change risk analysis in coastal areas, providing practical guidance on how it is to be applied to obtain risks and consequences; 2) the implementation of the integrated framework for the multi-sectoral assessment of coastal flood risk consequences; and 3) the implementation of the integrated framework for the sectoral assessment of coastal erosion risks.

Este trabajo ha sido parcialmente financiado por el proyecto BIA2015-70644-R del Ministerio de Economía Y Competitividad.

Concurrent Kleene Algebra (CKA) is a mathematical formalism to study programs that exhibit concurrent behaviour. As with previous extensions of Kleene Algebra, characterizing the free model is crucial in order to develop the foundations of the theory and potential applications. For CKA, this has been an open question for a few years and this paper makes an important step towards an answer. We present a new automaton model and a Kleene-like theorem that relates a relaxed version of CKA to series-parallel pomset languages, which are a natural candidate for the free model. There are two substantial differences with previous work: from expressions to automata, we use Brzozowski derivatives, which enable a direct construction of the automaton; from automata to expressions, we provide a syntactic characterization of the automata that denote valid CKA behaviours., Comment: Version 2 incorporates changes prompted by comments of the anonymous referees at CONCUR. Besides minor corrections, this includes additions to the introduction and the discussion section, as well as a proof of Lemma 2.5. Version 3 corrects the accent on the first author's surname in the metadata

We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this new setting. In particular we can learn a subclass of nominal non-deterministic automata. An implementation using a recently developed Haskell library for nominal computation is provided for preliminary experiments.

El trabajo ha sido financiado por el Ministerio de Agricultura y Pesca, Alimentación y Medio Ambiente.

Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations are important. This paper exploits monads, both as a mathematical structure and a programming construct, to design, prove correct, and implement a wide class of such optimizations. The former perspective on monads allows us to develop a new algorithm and accompanying correctness proofs, building upon a general framework for automata learning based on category theory. The new algorithm is parametric on a monad, which provides a rich algebraic structure to capture non-determinism and other side-effects. We show that our approach allows us to uniformly capture existing algorithms, develop new ones, and add optimizations. The latter perspective allows us to effortlessly translate the theory into practice: we provide a Haskell library implementing our general framework, and we show experimental results for two specific instances: non-deterministic and weighted automata.

As condições climáticas nas cidades, ou clima urbano, resultam de alterações da paisagem natural e sua substituição por ambiente construído, ocasionados por intensas atividades humanas. O impacto do clima sobre a sociedade, provoca situações que comprometem, dentre outras, a qualidade da saúde humana. Neste artigo são apresentados e discutidos os problemas sociais e ambientais decorrentes da prática de queimadas na cidade de Araguaína-TO.

VCU Theses and Dissertations

We present a coinductive framework for defining infinitary analogues of equational reasoning and rewriting in a uniform way. We define the relation =^infty, notion of infinitary equational reasoning, and ->^infty, the standard notion of infinitary rewriting as follows: =^infty := nu R. ( _root + lift(R) )^* ->^infty := mu R. nu S. ( ->_root + lift(R) )^* ; lift(S) where lift(R) := { (f(s_1,...,s_n), f(t_1,...,t_n)) | s_1 R t_1,...,s_n R t_n } + id , and where mu is the least fixed point operator and nu is the greatest fixed point operator. The setup captures rewrite sequences of arbitrary ordinal length, but it has neither the need for ordinals nor for metric convergence. This makes the framework especially suitable for formalizations in theorem provers., Comment: arXiv admin note: substantial text overlap with arXiv:1306.6224

International Council for the Exploration of the Sea Annual Science Conference (ICES ASC 2014), Sustainability in a changing ocean, 15-19 September 2014, La Coruña

Texto Justificativo para atribuição da Menção Especial/APCT 2010 ao figurinista Bernardo Monteiro.

We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the usual definitions of infinitary rewriting, neither need for ordinals nor for metric convergence. While the idea of a coinductive treatment of infinitary rewriting is not new, all previous approaches were limited to reductions of length at most omega. The approach presented in this paper is the first to capture the full infinitary term rewriting with reductions of arbitrary ordinal length. Apart from an elegant reformulation of known concepts, our approach gives rise, in a very natural way, to a novel notion of infinitary equational reasoning.

This volume contains the pre-proceedings of ICE'11, the 4th Interaction and Concurrency Experience workshop, which was held in Reykjavik, Iceland on the 9th of June 2011 as a satellite event of DisCoTec'11. The topic of ICE'11 was Reliable and Contract-based Interaction. Reliable interactions are, e.g., those enjoying suitable logical, behavioural, or security properties, or adhering to certain QoS standards. Contract-based interactions are, e.g., those where the interacting entities are committed to give certain guarantees whenever certain assumptions are met by their operating environment. The ICE procedure for paper selection allows for PC members to interact, anonymously, with authors. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access is restricted to the authors and to all the PC members not declaring a conflict of interests. The PC members post comments and questions that the authors reply to. Each paper was reviewed by four PC members, and altogether 8 papers (out of 12) were accepted for publication. We were proud to host three invited talks by Rocco De Nicola (joint with PACO), Simon Gay and Prakash Panangaden, whose abstracts are included in this volume together with the regular papers.

In this paper we present a compositional semantics for the channel-based coordination language Reo which enables the analysis of quality of service (QoS) properties of service compositions. For this purpose, we annotate Reo channels with stochastic delay rates and explicitly model data-arrival rates at the boundary of a connector, to capture its interaction with the services that comprise its environment. We propose Stochastic Reo automata as an extension of Reo automata, in order to compositionally derive a QoS-aware semantics for Reo. We further present a translation of Stochastic Reo automata to Continuous-Time Markov Chains (CTMCs). This translation enables us to use third-party CTMC verification tools to do an end-to-end performance analysis of service compositions. As a case study, we are currently applying our method to an industrial application, the ASK system.

This volume contains the proceedings of the 3rd Interaction and Concurrency Experience (ICE 2010) workshop, which was held in Amsterdam, Netherlands on 10th of June 2010 as a satellite event of DisCoTec'10. Each year, the workshop focuses on a specific topic: the topic of ICE 2010 was Guaranteed Interactions, by which we mean, for example, guaranteeing safety, reactivity, quality of service or satisfaction of analysis hypotheses.

We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are represented as coalgebras and (1) and (2) above are derived in a modular fashion from the underlying (functor) type of these coalgebras. In previous work, we applied a similar approach to a class of systems (without weights) that generalizes both the results of Kleene (on rational languages and DFA's) and Milner (on regular behaviours and finite LTS's), and includes many other systems such as Mealy and Moore machines. In the present paper, we extend this framework to deal with quantitative systems. As a consequence, our results now include languages and axiomatizations, both existing and new ones, for many different kinds of probabilistic systems.

The authors aimed to assess the impact of a routine ultrasound examination performed between 10 and 13 weeks of pregnancy. During a thirty month period, 778 ultrasound examinations between 10 and 13 weeks of pregnancy were performed, in women referred to our hospital. Transvaginal ultrasound was systematically adopted and the parameters obtained were introduced in a computerized data base. Biographic data, first day of menses (whenever possible), menstrual cycle characteristics, eventual use of hormonal contraception in the three months before last menses, antecedents of chromosomal abnormalities, number of foetuses and chorionicity, foetal vitality, crown-rump length, nuchal translucency and foetal heart rate were registered in all examinations. The median gestational age at the time of examination was 12.5 weeks (9-14.3). The median of maternal age was 29 years (14-44), maternal age prevalence higher or equal to 35 years was 17%. Fifty two per cent of women had usually regular menstrual cycles and 11% ignored last menses. In 74% of cases discrepancy between amenorrhea and ultrasound derived gestational age was inferior to one week and in 19% superior. The median of nuchal translucency was 1.4 mm (0.5-10), 7% of all cases had a nuchal translucency higher or equal to 2.5 mm. If maternal age criteria had been decisive for diagnostic invasive procedures, they would have been made in 135 cases. Considering nuchal translucency value combined with maternal age, it should have been done in 63 cases. In our series, invasive testing was performed in 31 (5%) cases. Eight women with fetuses with abnormal karyotypes decided for termination of pregnancy. The importance of ultrasound examination between 10 and 13 weeks seems unquestionable, allowing the correction of gestational age, multiple pregnancy characterisation and chromosomal abnormalities screening.

Spanish Oceanogrnphic Institute (IEO) and Portuguese Research Inistitute (IPIMAR, ex-INIP) using their research vessels "Comide de Saavedra" and "Noruega" have conducted groundfish surveys in Spanish and Portuguese waters. The results of these surveys have been reported to the relevant ICES Working Groups, communicated to ICES Annual Conferences and/or published in journals of bioiogy and flsheries. Data collected from groundfish surveys were also the basis to carry out assemblage studies and to several advices to the Spanish, Porttuguese and European fishery administrations concerning the implementation of technical measures for fish stock management. This communication intends to give information about the past, the present and the future of these surveys, concerning objectives, methodology and publications. Critical aspects and solutions to improve some aspects are presented.

Dissertação de Mestrado em Ciências do Desporto, Especialização em Jogos Desportivos Colectivos Os objectivos do presente estudo consistiram em identificar a relação existente entre criatividade individual (CriaI) e colectiva (CriaC) específicas de jovens futebolistas; avaliar os efeitos de um programa de treino de desenvolvimento do reportório técnico e do foco atencional no seu desempenho criativo; e analisar a influência das relações de amizade na CriaC. Foram analisados 25 jogadores, com uma média de idades de 13,92 ± 0,64, e 5,36 ± 2,14 anos de prática da modalidade. A avaliação da CriaI foi realizada através de uma situação de 1 x 1, filmada para posterior análise das acções técnicas. Por sua vez, a avaliação da CriaC foi feita com recurso a jogo Gr+5 x 5+Gr. As equipas envolvidas na tarefa colectiva foram organizadas por pontuação de CriaI; por díades de melhores amigos e de forma aleatória. Foram registados dados posicionais, de carga interna, e efectuada uma filmagem para posterior análise das acções técnicas. Foi também realizada uma avaliação da aptidão física dos participantes. O pós-teste decorreu 12 semanas após o pré-teste, durante as quais foi aplicado um programa de treino visando o desenvolvimento do reportório técnico e do foco atencional. Verificou-se que as melhorias registadas ao nível das pontuações de CriaI foram acompanhadas por melhorias dos valores de CriaC, sugerindo uma possível relação entre ambas. Para além disso, verificou-se que, quando reunimos indivíduos com CriaI mais elevada no mesmo grupo, estes distinguem-se do grupo dos “menos criativos” na média das pontuações de CriaC, sugerindo que jogadores mais criativos individualmente, mantêm valores elevados na tarefa colectiva. Os efeitos do programa de treino foram registados no aumento de iniciativas de remate e na média de CriaC dos jogadores que integraram as equipas mais e menos “criativas”. Os resultados obtidos ao nível das variáveis posicionais apontam para uma melhoria no desempenho táctico dos jogadores do grupo experimental, o que parece reflectir-se também nas variáveis metabólicas. Relativamente ao factor amizade, os resultados sugerem um efeito positivo na CriaC, verificado no sucesso do número e diversidade de intervenções.

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has neither the need for ordinals nor for metric convergence. This makes the framework especially suitable for formalizations in theorem provers., Logical Methods in Computer Science ; Volume 14, Issue 1 ; 1860-5974